java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:10:20,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:10:20,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:10:20,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:10:20,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:10:20,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:10:20,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:10:20,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:10:20,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:10:20,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:10:20,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:10:20,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:10:20,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:10:20,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:10:20,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:10:20,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:10:20,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:10:20,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:10:20,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:10:20,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:10:20,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:10:20,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:10:20,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:10:20,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:10:20,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:10:20,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:10:20,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:10:20,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:10:20,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:10:20,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:10:20,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:10:20,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:10:20,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:10:20,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:10:20,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:10:20,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:10:20,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:10:20,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:10:20,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:10:20,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:10:20,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:10:20,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:10:20,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:10:20,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:10:20,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:10:20,178 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:10:20,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:10:20,179 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:10:20,179 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:10:20,179 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:10:20,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:10:20,180 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:10:20,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:10:20,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:10:20,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:10:20,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:10:20,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:10:20,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:10:20,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:10:20,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:10:20,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:10:20,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:10:20,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:10:20,182 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:10:20,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:10:20,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:20,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:10:20,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:10:20,184 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:10:20,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:10:20,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:10:20,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:10:20,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:10:20,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:10:20,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:10:20,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:10:20,232 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:10:20,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-03 04:10:20,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044b0ce0e/667093ee9d044627b334a4d44511d05f/FLAGb040c4f72 [2019-10-03 04:10:20,741 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:10:20,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-03 04:10:20,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044b0ce0e/667093ee9d044627b334a4d44511d05f/FLAGb040c4f72 [2019-10-03 04:10:21,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044b0ce0e/667093ee9d044627b334a4d44511d05f [2019-10-03 04:10:21,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:10:21,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:10:21,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:21,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:10:21,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:10:21,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ea0c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21, skipping insertion in model container [2019-10-03 04:10:21,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,071 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:10:21,112 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:10:21,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:21,363 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:10:21,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:21,533 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:10:21,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21 WrapperNode [2019-10-03 04:10:21,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:21,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:10:21,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:10:21,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:10:21,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... [2019-10-03 04:10:21,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:10:21,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:10:21,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:10:21,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:10:21,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:21,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:10:21,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:10:21,661 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-03 04:10:21,662 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-03 04:10:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-03 04:10:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-03 04:10:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:10:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-03 04:10:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-03 04:10:21,663 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-03 04:10:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-03 04:10:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-03 04:10:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-03 04:10:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-03 04:10:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-03 04:10:21,665 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:10:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:10:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:10:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:10:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-03 04:10:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-03 04:10:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-03 04:10:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-03 04:10:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:10:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-03 04:10:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-03 04:10:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-03 04:10:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:10:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:10:22,225 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:10:22,225 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-03 04:10:22,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:22 BoogieIcfgContainer [2019-10-03 04:10:22,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:10:22,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:10:22,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:10:22,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:10:22,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:10:21" (1/3) ... [2019-10-03 04:10:22,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b7f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:22, skipping insertion in model container [2019-10-03 04:10:22,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:21" (2/3) ... [2019-10-03 04:10:22,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b7f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:22, skipping insertion in model container [2019-10-03 04:10:22,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:22" (3/3) ... [2019-10-03 04:10:22,234 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-10-03 04:10:22,243 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:10:22,250 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:10:22,263 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:10:22,290 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:10:22,290 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:10:22,290 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:10:22,290 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:10:22,291 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:10:22,291 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:10:22,291 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:10:22,291 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:10:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-10-03 04:10:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:10:22,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:22,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:22,329 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-10-03 04:10:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:22,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:22,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:22,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:22,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:22,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:22,745 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-10-03 04:10:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:23,382 INFO L93 Difference]: Finished difference Result 207 states and 287 transitions. [2019-10-03 04:10:23,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:23,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-03 04:10:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:23,412 INFO L225 Difference]: With dead ends: 207 [2019-10-03 04:10:23,412 INFO L226 Difference]: Without dead ends: 195 [2019-10-03 04:10:23,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-03 04:10:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-10-03 04:10:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-03 04:10:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-10-03 04:10:23,472 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2019-10-03 04:10:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:23,472 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-10-03 04:10:23,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-10-03 04:10:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:10:23,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:23,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:23,478 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:23,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-10-03 04:10:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:23,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:23,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:23,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:23,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:23,611 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-10-03 04:10:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:24,051 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2019-10-03 04:10:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:24,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-03 04:10:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:24,054 INFO L225 Difference]: With dead ends: 193 [2019-10-03 04:10:24,055 INFO L226 Difference]: Without dead ends: 193 [2019-10-03 04:10:24,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-03 04:10:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2019-10-03 04:10:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-03 04:10:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-10-03 04:10:24,072 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2019-10-03 04:10:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:24,073 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-10-03 04:10:24,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-10-03 04:10:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:10:24,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:24,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:24,077 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:24,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1453730190, now seen corresponding path program 1 times [2019-10-03 04:10:24,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:24,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:24,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:24,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:24,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:24,220 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2019-10-03 04:10:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:24,594 INFO L93 Difference]: Finished difference Result 210 states and 296 transitions. [2019-10-03 04:10:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:24,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-03 04:10:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:24,598 INFO L225 Difference]: With dead ends: 210 [2019-10-03 04:10:24,598 INFO L226 Difference]: Without dead ends: 210 [2019-10-03 04:10:24,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-03 04:10:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2019-10-03 04:10:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-03 04:10:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-10-03 04:10:24,615 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-10-03 04:10:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:24,616 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-10-03 04:10:24,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-10-03 04:10:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:10:24,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:24,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:24,618 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 721762764, now seen corresponding path program 1 times [2019-10-03 04:10:24,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:24,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:24,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:24,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:24,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:24,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:24,700 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2019-10-03 04:10:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:25,096 INFO L93 Difference]: Finished difference Result 204 states and 286 transitions. [2019-10-03 04:10:25,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:25,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-03 04:10:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:25,099 INFO L225 Difference]: With dead ends: 204 [2019-10-03 04:10:25,099 INFO L226 Difference]: Without dead ends: 204 [2019-10-03 04:10:25,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-03 04:10:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2019-10-03 04:10:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-03 04:10:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-10-03 04:10:25,124 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2019-10-03 04:10:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:25,125 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-10-03 04:10:25,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-10-03 04:10:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:10:25,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:25,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:25,129 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash -964417074, now seen corresponding path program 1 times [2019-10-03 04:10:25,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:25,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:25,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:25,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:25,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:25,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:25,208 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2019-10-03 04:10:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:25,568 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2019-10-03 04:10:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:25,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-03 04:10:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:25,570 INFO L225 Difference]: With dead ends: 206 [2019-10-03 04:10:25,570 INFO L226 Difference]: Without dead ends: 206 [2019-10-03 04:10:25,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-03 04:10:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2019-10-03 04:10:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-03 04:10:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2019-10-03 04:10:25,582 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2019-10-03 04:10:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:25,582 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2019-10-03 04:10:25,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2019-10-03 04:10:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:10:25,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:25,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:25,585 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1018809972, now seen corresponding path program 1 times [2019-10-03 04:10:25,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:25,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:25,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:25,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:25,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:25,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:25,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:25,643 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 4 states. [2019-10-03 04:10:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:25,815 INFO L93 Difference]: Finished difference Result 301 states and 396 transitions. [2019-10-03 04:10:25,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:25,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 04:10:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:25,817 INFO L225 Difference]: With dead ends: 301 [2019-10-03 04:10:25,817 INFO L226 Difference]: Without dead ends: 301 [2019-10-03 04:10:25,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-03 04:10:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-10-03 04:10:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-03 04:10:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2019-10-03 04:10:25,832 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 91 [2019-10-03 04:10:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:25,833 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2019-10-03 04:10:25,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2019-10-03 04:10:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 04:10:25,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:25,836 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:25,836 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash -207780250, now seen corresponding path program 1 times [2019-10-03 04:10:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 04:10:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:25,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:25,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-10-03 04:10:25,934 INFO L207 CegarAbsIntRunner]: [58], [63], [77], [80], [83], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [140], [142], [144], [145], [184], [185], [187], [192], [195], [198], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [248], [256], [260], [266], [272], [278], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [384], [397], [403], [404], [418], [420], [453], [454], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:10:25,984 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:25,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:26,115 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:26,117 INFO L272 AbstractInterpreter]: Visited 50 different actions 50 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 4. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-10-03 04:10:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:26,125 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:26,288 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 65.93% of their original sizes. [2019-10-03 04:10:26,288 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:26,462 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-10-03 04:10:26,462 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2019-10-03 04:10:26,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:26,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 04:10:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 04:10:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:10:26,465 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand 15 states. [2019-10-03 04:10:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,219 INFO L93 Difference]: Finished difference Result 402 states and 510 transitions. [2019-10-03 04:10:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 04:10:29,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2019-10-03 04:10:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,222 INFO L225 Difference]: With dead ends: 402 [2019-10-03 04:10:29,223 INFO L226 Difference]: Without dead ends: 402 [2019-10-03 04:10:29,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-10-03 04:10:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-03 04:10:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2019-10-03 04:10:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-10-03 04:10:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2019-10-03 04:10:29,240 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 145 [2019-10-03 04:10:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,240 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2019-10-03 04:10:29,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 04:10:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2019-10-03 04:10:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 04:10:29,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,243 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:29,244 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 56462567, now seen corresponding path program 1 times [2019-10-03 04:10:29,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 04:10:29,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:29,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:29,314 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 6 states. [2019-10-03 04:10:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,343 INFO L93 Difference]: Finished difference Result 414 states and 529 transitions. [2019-10-03 04:10:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:29,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 04:10:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,347 INFO L225 Difference]: With dead ends: 414 [2019-10-03 04:10:29,347 INFO L226 Difference]: Without dead ends: 414 [2019-10-03 04:10:29,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-10-03 04:10:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 404. [2019-10-03 04:10:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-03 04:10:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 511 transitions. [2019-10-03 04:10:29,365 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 511 transitions. Word has length 145 [2019-10-03 04:10:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,365 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 511 transitions. [2019-10-03 04:10:29,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 511 transitions. [2019-10-03 04:10:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-03 04:10:29,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,368 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:29,369 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1847007389, now seen corresponding path program 1 times [2019-10-03 04:10:29,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-03 04:10:29,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:29,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:29,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:29,451 INFO L87 Difference]: Start difference. First operand 404 states and 511 transitions. Second operand 4 states. [2019-10-03 04:10:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,564 INFO L93 Difference]: Finished difference Result 485 states and 597 transitions. [2019-10-03 04:10:29,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:29,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-03 04:10:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,568 INFO L225 Difference]: With dead ends: 485 [2019-10-03 04:10:29,568 INFO L226 Difference]: Without dead ends: 485 [2019-10-03 04:10:29,568 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-03 04:10:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-10-03 04:10:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-03 04:10:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 597 transitions. [2019-10-03 04:10:29,584 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 597 transitions. Word has length 165 [2019-10-03 04:10:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,585 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 597 transitions. [2019-10-03 04:10:29,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 597 transitions. [2019-10-03 04:10:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 04:10:29,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,588 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:29,588 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1914461978, now seen corresponding path program 1 times [2019-10-03 04:10:29,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 04:10:29,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:29,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:29,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:29,646 INFO L87 Difference]: Start difference. First operand 485 states and 597 transitions. Second operand 4 states. [2019-10-03 04:10:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,837 INFO L93 Difference]: Finished difference Result 742 states and 923 transitions. [2019-10-03 04:10:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:29,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-03 04:10:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,844 INFO L225 Difference]: With dead ends: 742 [2019-10-03 04:10:29,844 INFO L226 Difference]: Without dead ends: 742 [2019-10-03 04:10:29,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-03 04:10:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 741. [2019-10-03 04:10:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-03 04:10:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 922 transitions. [2019-10-03 04:10:29,877 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 922 transitions. Word has length 145 [2019-10-03 04:10:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,878 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 922 transitions. [2019-10-03 04:10:29,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 922 transitions. [2019-10-03 04:10:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 04:10:29,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,883 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-03 04:10:29,883 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1988983491, now seen corresponding path program 1 times [2019-10-03 04:10:29,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-03 04:10:30,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:30,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:30,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-10-03 04:10:30,041 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [384], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:10:30,046 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:30,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:30,078 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:30,078 INFO L272 AbstractInterpreter]: Visited 101 different actions 132 times. Never merged. Never widened. Performed 463 root evaluator evaluations with a maximum evaluation depth of 4. Performed 463 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-10-03 04:10:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:30,079 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:30,183 INFO L227 lantSequenceWeakener]: Weakened 138 states. On average, predicates are now at 74.23% of their original sizes. [2019-10-03 04:10:30,184 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:31,330 INFO L420 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2019-10-03 04:10:31,331 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:31,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:31,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [6] total 57 [2019-10-03 04:10:31,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:31,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-03 04:10:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-03 04:10:31,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2479, Unknown=0, NotChecked=0, Total=2756 [2019-10-03 04:10:31,334 INFO L87 Difference]: Start difference. First operand 741 states and 922 transitions. Second operand 53 states. [2019-10-03 04:10:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:46,992 INFO L93 Difference]: Finished difference Result 1080 states and 1322 transitions. [2019-10-03 04:10:46,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-03 04:10:46,992 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 189 [2019-10-03 04:10:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:46,998 INFO L225 Difference]: With dead ends: 1080 [2019-10-03 04:10:46,998 INFO L226 Difference]: Without dead ends: 1080 [2019-10-03 04:10:47,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1113, Invalid=10877, Unknown=0, NotChecked=0, Total=11990 [2019-10-03 04:10:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2019-10-03 04:10:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1061. [2019-10-03 04:10:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-10-03 04:10:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1303 transitions. [2019-10-03 04:10:47,037 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1303 transitions. Word has length 189 [2019-10-03 04:10:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:47,037 INFO L475 AbstractCegarLoop]: Abstraction has 1061 states and 1303 transitions. [2019-10-03 04:10:47,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-03 04:10:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1303 transitions. [2019-10-03 04:10:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 04:10:47,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:47,043 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:10:47,043 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:47,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 126694160, now seen corresponding path program 1 times [2019-10-03 04:10:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:47,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-03 04:10:47,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:47,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:47,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-10-03 04:10:47,148 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [375], [378], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:10:47,157 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:47,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:47,196 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:47,197 INFO L272 AbstractInterpreter]: Visited 105 different actions 137 times. Never merged. Never widened. Performed 510 root evaluator evaluations with a maximum evaluation depth of 4. Performed 510 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-10-03 04:10:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:47,198 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:47,325 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 73.1% of their original sizes. [2019-10-03 04:10:47,326 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:48,656 INFO L420 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2019-10-03 04:10:48,656 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:48,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:48,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2019-10-03 04:10:48,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:48,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-03 04:10:48,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-03 04:10:48,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2600, Unknown=0, NotChecked=0, Total=2862 [2019-10-03 04:10:48,659 INFO L87 Difference]: Start difference. First operand 1061 states and 1303 transitions. Second operand 54 states. [2019-10-03 04:11:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:01,609 INFO L93 Difference]: Finished difference Result 918 states and 1123 transitions. [2019-10-03 04:11:01,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-03 04:11:01,610 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 189 [2019-10-03 04:11:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:01,615 INFO L225 Difference]: With dead ends: 918 [2019-10-03 04:11:01,616 INFO L226 Difference]: Without dead ends: 918 [2019-10-03 04:11:01,619 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3384 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1066, Invalid=10490, Unknown=0, NotChecked=0, Total=11556 [2019-10-03 04:11:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-10-03 04:11:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 901. [2019-10-03 04:11:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-03 04:11:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1105 transitions. [2019-10-03 04:11:01,643 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1105 transitions. Word has length 189 [2019-10-03 04:11:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:01,644 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1105 transitions. [2019-10-03 04:11:01,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-03 04:11:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1105 transitions. [2019-10-03 04:11:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-03 04:11:01,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:01,648 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:11:01,648 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 755851865, now seen corresponding path program 1 times [2019-10-03 04:11:01,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:01,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:01,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:01,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:01,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-03 04:11:01,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:01,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:01,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2019-10-03 04:11:01,741 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [375], [381], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:11:01,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:01,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:01,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:01,775 INFO L272 AbstractInterpreter]: Visited 106 different actions 137 times. Never merged. Never widened. Performed 516 root evaluator evaluations with a maximum evaluation depth of 4. Performed 516 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 42 variables. [2019-10-03 04:11:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:01,775 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:01,864 INFO L227 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 74.58% of their original sizes. [2019-10-03 04:11:01,865 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:03,096 INFO L420 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2019-10-03 04:11:03,096 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:03,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:03,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2019-10-03 04:11:03,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:03,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-03 04:11:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-03 04:11:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2901, Unknown=0, NotChecked=0, Total=3192 [2019-10-03 04:11:03,099 INFO L87 Difference]: Start difference. First operand 901 states and 1105 transitions. Second operand 57 states. [2019-10-03 04:11:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:19,139 INFO L93 Difference]: Finished difference Result 925 states and 1133 transitions. [2019-10-03 04:11:19,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-03 04:11:19,139 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 190 [2019-10-03 04:11:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:19,144 INFO L225 Difference]: With dead ends: 925 [2019-10-03 04:11:19,144 INFO L226 Difference]: Without dead ends: 925 [2019-10-03 04:11:19,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3704 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1144, Invalid=11512, Unknown=0, NotChecked=0, Total=12656 [2019-10-03 04:11:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-03 04:11:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 903. [2019-10-03 04:11:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-10-03 04:11:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1108 transitions. [2019-10-03 04:11:19,171 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1108 transitions. Word has length 190 [2019-10-03 04:11:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:19,172 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1108 transitions. [2019-10-03 04:11:19,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-03 04:11:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1108 transitions. [2019-10-03 04:11:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 04:11:19,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:19,176 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-03 04:11:19,176 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1624527967, now seen corresponding path program 1 times [2019-10-03 04:11:19,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:19,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:19,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-03 04:11:19,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:19,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:19,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2019-10-03 04:11:19,264 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [375], [378], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:11:19,266 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:19,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:19,290 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:19,290 INFO L272 AbstractInterpreter]: Visited 112 different actions 143 times. Never merged. Never widened. Performed 558 root evaluator evaluations with a maximum evaluation depth of 4. Performed 558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 42 variables. [2019-10-03 04:11:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:19,291 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:19,354 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 74.94% of their original sizes. [2019-10-03 04:11:19,354 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:20,572 INFO L420 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2019-10-03 04:11:20,572 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:20,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:20,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [59] imperfect sequences [6] total 63 [2019-10-03 04:11:20,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:20,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-03 04:11:20,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-03 04:11:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3125, Unknown=0, NotChecked=0, Total=3422 [2019-10-03 04:11:20,575 INFO L87 Difference]: Start difference. First operand 903 states and 1108 transitions. Second operand 59 states. [2019-10-03 04:11:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:45,038 INFO L93 Difference]: Finished difference Result 1238 states and 1532 transitions. [2019-10-03 04:11:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-03 04:11:45,038 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 196 [2019-10-03 04:11:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:45,045 INFO L225 Difference]: With dead ends: 1238 [2019-10-03 04:11:45,045 INFO L226 Difference]: Without dead ends: 1238 [2019-10-03 04:11:45,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3771 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1140, Invalid=11742, Unknown=0, NotChecked=0, Total=12882 [2019-10-03 04:11:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-03 04:11:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1192. [2019-10-03 04:11:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-10-03 04:11:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1473 transitions. [2019-10-03 04:11:45,081 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1473 transitions. Word has length 196 [2019-10-03 04:11:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:45,082 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1473 transitions. [2019-10-03 04:11:45,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-03 04:11:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1473 transitions. [2019-10-03 04:11:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 04:11:45,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:45,087 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:45,087 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash 652169860, now seen corresponding path program 1 times [2019-10-03 04:11:45,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:45,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:45,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-03 04:11:45,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:45,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:45,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2019-10-03 04:11:45,178 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [384], [388], [391], [397], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:11:45,180 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:45,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:45,235 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:45,236 INFO L272 AbstractInterpreter]: Visited 115 different actions 160 times. Merged at 6 different actions 6 times. Never widened. Performed 657 root evaluator evaluations with a maximum evaluation depth of 4. Performed 657 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 42 variables. [2019-10-03 04:11:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:45,236 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:45,343 INFO L227 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 75.56% of their original sizes. [2019-10-03 04:11:45,344 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:46,737 INFO L420 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2019-10-03 04:11:46,738 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:46,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:46,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-10-03 04:11:46,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:46,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-03 04:11:46,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-03 04:11:46,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=3523, Unknown=0, NotChecked=0, Total=3906 [2019-10-03 04:11:46,741 INFO L87 Difference]: Start difference. First operand 1192 states and 1473 transitions. Second operand 63 states. [2019-10-03 04:12:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:19,726 INFO L93 Difference]: Finished difference Result 3372 states and 4276 transitions. [2019-10-03 04:12:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-03 04:12:19,726 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 209 [2019-10-03 04:12:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:19,741 INFO L225 Difference]: With dead ends: 3372 [2019-10-03 04:12:19,742 INFO L226 Difference]: Without dead ends: 3372 [2019-10-03 04:12:19,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5668 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1684, Invalid=16406, Unknown=0, NotChecked=0, Total=18090 [2019-10-03 04:12:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2019-10-03 04:12:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3186. [2019-10-03 04:12:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2019-10-03 04:12:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4033 transitions. [2019-10-03 04:12:19,849 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4033 transitions. Word has length 209 [2019-10-03 04:12:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:19,850 INFO L475 AbstractCegarLoop]: Abstraction has 3186 states and 4033 transitions. [2019-10-03 04:12:19,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-03 04:12:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4033 transitions. [2019-10-03 04:12:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 04:12:19,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:19,857 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:19,857 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1249922777, now seen corresponding path program 1 times [2019-10-03 04:12:19,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:19,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:19,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-03 04:12:19,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:19,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:19,931 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2019-10-03 04:12:19,932 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [381], [384], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:19,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:19,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:19,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:20,000 INFO L272 AbstractInterpreter]: Visited 121 different actions 375 times. Merged at 23 different actions 40 times. Never widened. Performed 1491 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1491 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 42 variables. [2019-10-03 04:12:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:20,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:20,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:20,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:20,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:20,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:12:20,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 04:12:20,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:12:20,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-03 04:12:20,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:20,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:20,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:20,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:20,494 INFO L87 Difference]: Start difference. First operand 3186 states and 4033 transitions. Second operand 3 states. [2019-10-03 04:12:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:20,531 INFO L93 Difference]: Finished difference Result 3196 states and 4032 transitions. [2019-10-03 04:12:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:20,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-03 04:12:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:20,545 INFO L225 Difference]: With dead ends: 3196 [2019-10-03 04:12:20,545 INFO L226 Difference]: Without dead ends: 3196 [2019-10-03 04:12:20,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2019-10-03 04:12:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3186. [2019-10-03 04:12:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2019-10-03 04:12:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4022 transitions. [2019-10-03 04:12:20,632 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4022 transitions. Word has length 210 [2019-10-03 04:12:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:20,633 INFO L475 AbstractCegarLoop]: Abstraction has 3186 states and 4022 transitions. [2019-10-03 04:12:20,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4022 transitions. [2019-10-03 04:12:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 04:12:20,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:20,639 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:20,639 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -28823128, now seen corresponding path program 1 times [2019-10-03 04:12:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-03 04:12:20,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:20,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:20,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2019-10-03 04:12:20,799 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [216], [219], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [371], [375], [378], [381], [388], [391], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:20,801 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:20,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:20,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:20,851 INFO L272 AbstractInterpreter]: Visited 123 different actions 234 times. Merged at 16 different actions 19 times. Never widened. Performed 900 root evaluator evaluations with a maximum evaluation depth of 4. Performed 900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 42 variables. [2019-10-03 04:12:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:20,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:20,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:20,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:20,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:20,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:21,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:12:21,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 04:12:21,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-03 04:12:21,293 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:12:21,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-03 04:12:21,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:21,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:21,296 INFO L87 Difference]: Start difference. First operand 3186 states and 4022 transitions. Second operand 3 states. [2019-10-03 04:12:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:21,323 INFO L93 Difference]: Finished difference Result 3672 states and 4667 transitions. [2019-10-03 04:12:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:21,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-03 04:12:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:21,338 INFO L225 Difference]: With dead ends: 3672 [2019-10-03 04:12:21,338 INFO L226 Difference]: Without dead ends: 3672 [2019-10-03 04:12:21,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2019-10-03 04:12:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3654. [2019-10-03 04:12:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3654 states. [2019-10-03 04:12:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4646 transitions. [2019-10-03 04:12:21,438 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4646 transitions. Word has length 210 [2019-10-03 04:12:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:21,439 INFO L475 AbstractCegarLoop]: Abstraction has 3654 states and 4646 transitions. [2019-10-03 04:12:21,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4646 transitions. [2019-10-03 04:12:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-03 04:12:21,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:21,447 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:21,447 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1797680742, now seen corresponding path program 1 times [2019-10-03 04:12:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:21,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:21,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:21,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-03 04:12:21,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:21,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:21,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:21,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:21,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:21,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:21,534 INFO L87 Difference]: Start difference. First operand 3654 states and 4646 transitions. Second operand 5 states. [2019-10-03 04:12:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:21,959 INFO L93 Difference]: Finished difference Result 4054 states and 5197 transitions. [2019-10-03 04:12:21,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:12:21,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-10-03 04:12:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:21,984 INFO L225 Difference]: With dead ends: 4054 [2019-10-03 04:12:21,984 INFO L226 Difference]: Without dead ends: 4054 [2019-10-03 04:12:21,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-10-03 04:12:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 3894. [2019-10-03 04:12:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3894 states. [2019-10-03 04:12:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 4840 transitions. [2019-10-03 04:12:22,159 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 4840 transitions. Word has length 217 [2019-10-03 04:12:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:22,160 INFO L475 AbstractCegarLoop]: Abstraction has 3894 states and 4840 transitions. [2019-10-03 04:12:22,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 4840 transitions. [2019-10-03 04:12:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 04:12:22,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:22,171 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:22,172 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash 322942973, now seen corresponding path program 1 times [2019-10-03 04:12:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:22,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-03 04:12:22,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:22,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:22,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-10-03 04:12:22,320 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [216], [219], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [371], [375], [381], [384], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:22,322 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:22,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:22,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:12:22,372 INFO L272 AbstractInterpreter]: Visited 116 different actions 175 times. Merged at 13 different actions 13 times. Never widened. Performed 674 root evaluator evaluations with a maximum evaluation depth of 4. Performed 674 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2019-10-03 04:12:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:22,373 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:12:22,533 INFO L227 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 73.8% of their original sizes. [2019-10-03 04:12:22,534 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:12:24,953 INFO L420 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2019-10-03 04:12:24,953 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:12:24,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:12:24,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [4] total 71 [2019-10-03 04:12:24,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:24,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 04:12:24,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 04:12:24,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=4329, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 04:12:24,956 INFO L87 Difference]: Start difference. First operand 3894 states and 4840 transitions. Second operand 69 states. [2019-10-03 04:12:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:51,363 INFO L93 Difference]: Finished difference Result 2967 states and 3672 transitions. [2019-10-03 04:12:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-03 04:12:51,363 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 211 [2019-10-03 04:12:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:51,376 INFO L225 Difference]: With dead ends: 2967 [2019-10-03 04:12:51,376 INFO L226 Difference]: Without dead ends: 2967 [2019-10-03 04:12:51,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5856 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1519, Invalid=16841, Unknown=0, NotChecked=0, Total=18360 [2019-10-03 04:12:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2019-10-03 04:12:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2903. [2019-10-03 04:12:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2019-10-03 04:12:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3579 transitions. [2019-10-03 04:12:51,447 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3579 transitions. Word has length 211 [2019-10-03 04:12:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:51,448 INFO L475 AbstractCegarLoop]: Abstraction has 2903 states and 3579 transitions. [2019-10-03 04:12:51,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 04:12:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3579 transitions. [2019-10-03 04:12:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 04:12:51,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:51,455 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:51,455 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1625507174, now seen corresponding path program 1 times [2019-10-03 04:12:51,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:51,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:51,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-03 04:12:51,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:51,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:51,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:51,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:51,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:51,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:51,592 INFO L87 Difference]: Start difference. First operand 2903 states and 3579 transitions. Second operand 6 states. [2019-10-03 04:12:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:51,625 INFO L93 Difference]: Finished difference Result 2276 states and 2744 transitions. [2019-10-03 04:12:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:51,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-10-03 04:12:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:51,646 INFO L225 Difference]: With dead ends: 2276 [2019-10-03 04:12:51,646 INFO L226 Difference]: Without dead ends: 2276 [2019-10-03 04:12:51,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2019-10-03 04:12:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2276. [2019-10-03 04:12:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-10-03 04:12:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 2744 transitions. [2019-10-03 04:12:51,693 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 2744 transitions. Word has length 212 [2019-10-03 04:12:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:51,693 INFO L475 AbstractCegarLoop]: Abstraction has 2276 states and 2744 transitions. [2019-10-03 04:12:51,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2744 transitions. [2019-10-03 04:12:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 04:12:51,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:51,700 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:51,700 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 71123211, now seen corresponding path program 1 times [2019-10-03 04:12:51,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:51,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:51,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-03 04:12:51,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:51,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:51,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-10-03 04:12:51,784 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [381], [384], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:51,786 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:51,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:52,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:52,096 INFO L272 AbstractInterpreter]: Visited 125 different actions 810 times. Merged at 41 different actions 187 times. Widened at 1 different actions 1 times. Performed 3990 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 21 fixpoints after 8 different actions. Largest state had 42 variables. [2019-10-03 04:12:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:52,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:52,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:52,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:52,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:52,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:52,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-03 04:12:52,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 04:12:52,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:52,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:12:52,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:12:52,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:12:52,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:12:52,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:12:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-03 04:12:52,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:52,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-10-03 04:12:52,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:52,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:12:52,681 INFO L87 Difference]: Start difference. First operand 2276 states and 2744 transitions. Second operand 4 states. [2019-10-03 04:12:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:53,013 INFO L93 Difference]: Finished difference Result 3338 states and 4160 transitions. [2019-10-03 04:12:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:53,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-10-03 04:12:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:53,024 INFO L225 Difference]: With dead ends: 3338 [2019-10-03 04:12:53,025 INFO L226 Difference]: Without dead ends: 3338 [2019-10-03 04:12:53,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:12:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-03 04:12:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3288. [2019-10-03 04:12:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-10-03 04:12:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4092 transitions. [2019-10-03 04:12:53,103 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4092 transitions. Word has length 212 [2019-10-03 04:12:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:53,103 INFO L475 AbstractCegarLoop]: Abstraction has 3288 states and 4092 transitions. [2019-10-03 04:12:53,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4092 transitions. [2019-10-03 04:12:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 04:12:53,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:53,113 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:53,113 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -5777587, now seen corresponding path program 1 times [2019-10-03 04:12:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:53,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:53,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-03 04:12:53,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:53,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:53,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-10-03 04:12:53,205 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [381], [384], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:53,206 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:53,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:53,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:53,372 INFO L272 AbstractInterpreter]: Visited 126 different actions 743 times. Merged at 41 different actions 183 times. Never widened. Performed 3553 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3553 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2019-10-03 04:12:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:53,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:53,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:53,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:53,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:53,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:53,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 04:12:53,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 04:12:53,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-03 04:12:53,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:53,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 9 [2019-10-03 04:12:53,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:53,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:12:53,943 INFO L87 Difference]: Start difference. First operand 3288 states and 4092 transitions. Second operand 4 states. [2019-10-03 04:12:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:54,339 INFO L93 Difference]: Finished difference Result 5255 states and 7059 transitions. [2019-10-03 04:12:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:54,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-10-03 04:12:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:54,359 INFO L225 Difference]: With dead ends: 5255 [2019-10-03 04:12:54,359 INFO L226 Difference]: Without dead ends: 5255 [2019-10-03 04:12:54,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:12:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2019-10-03 04:12:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4915. [2019-10-03 04:12:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4915 states. [2019-10-03 04:12:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 6490 transitions. [2019-10-03 04:12:54,503 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 6490 transitions. Word has length 212 [2019-10-03 04:12:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:54,504 INFO L475 AbstractCegarLoop]: Abstraction has 4915 states and 6490 transitions. [2019-10-03 04:12:54,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 6490 transitions. [2019-10-03 04:12:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 04:12:54,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:54,513 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:12:54,513 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 547975687, now seen corresponding path program 1 times [2019-10-03 04:12:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:54,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-03 04:12:54,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:54,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:54,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2019-10-03 04:12:54,590 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [381], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:54,591 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:54,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:54,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:54,720 INFO L272 AbstractInterpreter]: Visited 125 different actions 759 times. Merged at 41 different actions 155 times. Widened at 1 different actions 1 times. Performed 2879 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2879 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 18 fixpoints after 7 different actions. Largest state had 42 variables. [2019-10-03 04:12:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:54,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:54,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:54,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:54,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:54,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-03 04:12:54,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 04:12:54,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:12:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2019-10-03 04:12:55,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:55,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:55,156 INFO L87 Difference]: Start difference. First operand 4915 states and 6490 transitions. Second operand 6 states. [2019-10-03 04:12:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:55,201 INFO L93 Difference]: Finished difference Result 4079 states and 5156 transitions. [2019-10-03 04:12:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:55,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-10-03 04:12:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:55,214 INFO L225 Difference]: With dead ends: 4079 [2019-10-03 04:12:55,214 INFO L226 Difference]: Without dead ends: 4079 [2019-10-03 04:12:55,215 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2019-10-03 04:12:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 4073. [2019-10-03 04:12:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4073 states. [2019-10-03 04:12:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5143 transitions. [2019-10-03 04:12:55,304 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5143 transitions. Word has length 213 [2019-10-03 04:12:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:55,305 INFO L475 AbstractCegarLoop]: Abstraction has 4073 states and 5143 transitions. [2019-10-03 04:12:55,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5143 transitions. [2019-10-03 04:12:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-03 04:12:55,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:55,317 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:55,317 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:55,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash -735921170, now seen corresponding path program 1 times [2019-10-03 04:12:55,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:55,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:55,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:55,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-03 04:12:55,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:55,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:55,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2019-10-03 04:12:55,415 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [198], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [236], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [381], [388], [391], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:55,416 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:55,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:55,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:55,624 INFO L272 AbstractInterpreter]: Visited 132 different actions 1051 times. Merged at 42 different actions 243 times. Widened at 1 different actions 1 times. Performed 4961 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4961 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 24 fixpoints after 6 different actions. Largest state had 42 variables. [2019-10-03 04:12:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:55,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:55,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:55,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:55,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:55,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:55,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:12:55,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-03 04:12:55,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-03 04:12:56,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:56,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-03 04:12:56,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:56,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:56,163 INFO L87 Difference]: Start difference. First operand 4073 states and 5143 transitions. Second operand 3 states. [2019-10-03 04:12:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:56,184 INFO L93 Difference]: Finished difference Result 3711 states and 4608 transitions. [2019-10-03 04:12:56,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:56,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-10-03 04:12:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:56,196 INFO L225 Difference]: With dead ends: 3711 [2019-10-03 04:12:56,197 INFO L226 Difference]: Without dead ends: 3711 [2019-10-03 04:12:56,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 508 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-10-03 04:12:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2019-10-03 04:12:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-10-03 04:12:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 4608 transitions. [2019-10-03 04:12:56,273 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 4608 transitions. Word has length 257 [2019-10-03 04:12:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:56,273 INFO L475 AbstractCegarLoop]: Abstraction has 3711 states and 4608 transitions. [2019-10-03 04:12:56,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 4608 transitions. [2019-10-03 04:12:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-03 04:12:56,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:56,283 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:56,283 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1980617327, now seen corresponding path program 1 times [2019-10-03 04:12:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:56,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-03 04:12:56,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:56,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:56,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2019-10-03 04:12:56,380 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [381], [388], [391], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:56,382 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:56,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:56,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:56,459 INFO L272 AbstractInterpreter]: Visited 124 different actions 338 times. Merged at 27 different actions 58 times. Never widened. Performed 2140 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2140 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2019-10-03 04:12:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:56,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:56,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:56,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:56,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:56,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:56,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 04:12:56,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-03 04:12:56,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-03 04:12:57,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:57,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-03 04:12:57,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:57,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:12:57,036 INFO L87 Difference]: Start difference. First operand 3711 states and 4608 transitions. Second operand 5 states. [2019-10-03 04:12:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:57,521 INFO L93 Difference]: Finished difference Result 3971 states and 4998 transitions. [2019-10-03 04:12:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:57,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-10-03 04:12:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:57,534 INFO L225 Difference]: With dead ends: 3971 [2019-10-03 04:12:57,534 INFO L226 Difference]: Without dead ends: 3971 [2019-10-03 04:12:57,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 511 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:12:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2019-10-03 04:12:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3954. [2019-10-03 04:12:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3954 states. [2019-10-03 04:12:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 4959 transitions. [2019-10-03 04:12:57,623 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 4959 transitions. Word has length 259 [2019-10-03 04:12:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:57,624 INFO L475 AbstractCegarLoop]: Abstraction has 3954 states and 4959 transitions. [2019-10-03 04:12:57,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 4959 transitions. [2019-10-03 04:12:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-03 04:12:57,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:57,634 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:57,635 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402789, now seen corresponding path program 1 times [2019-10-03 04:12:57,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:57,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:57,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-03 04:12:57,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:57,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:57,797 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2019-10-03 04:12:57,797 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [216], [219], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [371], [375], [378], [388], [391], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:57,799 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:57,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:58,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:58,159 INFO L272 AbstractInterpreter]: Visited 143 different actions 1775 times. Merged at 52 different actions 511 times. Widened at 1 different actions 1 times. Performed 7478 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 60 fixpoints after 14 different actions. Largest state had 42 variables. [2019-10-03 04:12:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:58,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:58,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:58,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:58,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:58,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:58,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 04:12:58,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:12:58,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-03 04:12:58,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:58,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 10 [2019-10-03 04:12:58,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:58,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:12:58,670 INFO L87 Difference]: Start difference. First operand 3954 states and 4959 transitions. Second operand 4 states. [2019-10-03 04:12:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:58,988 INFO L93 Difference]: Finished difference Result 1857 states and 2123 transitions. [2019-10-03 04:12:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:58,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-10-03 04:12:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:58,991 INFO L225 Difference]: With dead ends: 1857 [2019-10-03 04:12:58,991 INFO L226 Difference]: Without dead ends: 1081 [2019-10-03 04:12:58,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-03 04:12:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-10-03 04:12:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1074. [2019-10-03 04:12:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-10-03 04:12:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1219 transitions. [2019-10-03 04:12:59,014 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1219 transitions. Word has length 264 [2019-10-03 04:12:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:59,014 INFO L475 AbstractCegarLoop]: Abstraction has 1074 states and 1219 transitions. [2019-10-03 04:12:59,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1219 transitions. [2019-10-03 04:12:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 04:12:59,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:59,017 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:59,017 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -409838869, now seen corresponding path program 1 times [2019-10-03 04:12:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:59,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-03 04:12:59,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:59,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:59,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-10-03 04:12:59,131 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [198], [200], [203], [208], [210], [211], [214], [228], [229], [230], [233], [236], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [388], [391], [394], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-10-03 04:12:59,132 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:59,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:59,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:59,366 INFO L272 AbstractInterpreter]: Visited 131 different actions 1218 times. Merged at 42 different actions 305 times. Widened at 1 different actions 1 times. Performed 5210 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5210 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 28 fixpoints after 7 different actions. Largest state had 42 variables. [2019-10-03 04:12:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:59,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:59,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:59,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:12:59,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:59,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:59,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 04:12:59,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 24 proven. 95 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-03 04:12:59,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-03 04:12:59,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:59,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-03 04:12:59,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:59,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:59,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:12:59,986 INFO L87 Difference]: Start difference. First operand 1074 states and 1219 transitions. Second operand 5 states. [2019-10-03 04:13:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:00,433 INFO L93 Difference]: Finished difference Result 1113 states and 1265 transitions. [2019-10-03 04:13:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:13:00,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2019-10-03 04:13:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:00,436 INFO L225 Difference]: With dead ends: 1113 [2019-10-03 04:13:00,437 INFO L226 Difference]: Without dead ends: 938 [2019-10-03 04:13:00,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 509 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:13:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-10-03 04:13:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 927. [2019-10-03 04:13:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-03 04:13:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1053 transitions. [2019-10-03 04:13:00,451 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1053 transitions. Word has length 258 [2019-10-03 04:13:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:00,451 INFO L475 AbstractCegarLoop]: Abstraction has 927 states and 1053 transitions. [2019-10-03 04:13:00,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:13:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1053 transitions. [2019-10-03 04:13:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-03 04:13:00,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:00,455 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:13:00,455 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2108904620, now seen corresponding path program 1 times [2019-10-03 04:13:00,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:00,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-03 04:13:00,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:13:00,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 04:13:00,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:00,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 04:13:00,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 04:13:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:13:00,714 INFO L87 Difference]: Start difference. First operand 927 states and 1053 transitions. Second operand 7 states. [2019-10-03 04:13:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:01,941 INFO L93 Difference]: Finished difference Result 959 states and 1101 transitions. [2019-10-03 04:13:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 04:13:01,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-10-03 04:13:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:01,943 INFO L225 Difference]: With dead ends: 959 [2019-10-03 04:13:01,943 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:13:01,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-03 04:13:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:13:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:13:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:13:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:13:01,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2019-10-03 04:13:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:01,944 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:13:01,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 04:13:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:13:01,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:13:01,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:13:01 BoogieIcfgContainer [2019-10-03 04:13:01,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:13:01,951 INFO L168 Benchmark]: Toolchain (without parser) took 160898.34 ms. Allocated memory was 131.1 MB in the beginning and 1.1 GB in the end (delta: 936.4 MB). Free memory was 86.9 MB in the beginning and 405.8 MB in the end (delta: -318.9 MB). Peak memory consumption was 617.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:13:01,952 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:13:01,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.96 ms. Allocated memory was 131.1 MB in the beginning and 197.7 MB in the end (delta: 66.6 MB). Free memory was 86.5 MB in the beginning and 171.8 MB in the end (delta: -85.3 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-10-03 04:13:01,953 INFO L168 Benchmark]: Boogie Preprocessor took 58.65 ms. Allocated memory is still 197.7 MB. Free memory was 171.8 MB in the beginning and 169.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-03 04:13:01,954 INFO L168 Benchmark]: RCFGBuilder took 633.16 ms. Allocated memory is still 197.7 MB. Free memory was 169.8 MB in the beginning and 132.3 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:13:01,955 INFO L168 Benchmark]: TraceAbstraction took 159721.40 ms. Allocated memory was 197.7 MB in the beginning and 1.1 GB in the end (delta: 869.8 MB). Free memory was 131.7 MB in the beginning and 405.8 MB in the end (delta: -274.2 MB). Peak memory consumption was 595.6 MB. Max. memory is 7.1 GB. [2019-10-03 04:13:01,958 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.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 477.96 ms. Allocated memory was 131.1 MB in the beginning and 197.7 MB in the end (delta: 66.6 MB). Free memory was 86.5 MB in the beginning and 171.8 MB in the end (delta: -85.3 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.65 ms. Allocated memory is still 197.7 MB. Free memory was 171.8 MB in the beginning and 169.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 633.16 ms. Allocated memory is still 197.7 MB. Free memory was 169.8 MB in the beginning and 132.3 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159721.40 ms. Allocated memory was 197.7 MB in the beginning and 1.1 GB in the end (delta: 869.8 MB). Free memory was 131.7 MB in the beginning and 405.8 MB in the end (delta: -274.2 MB). Peak memory consumption was 595.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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 23 procedures, 174 locations, 1 error locations. SAFE Result, 159.6s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 138.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8069 SDtfs, 12208 SDslu, 45274 SDs, 0 SdLazy, 32402 SolverSat, 4144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6043 GetRequests, 5193 SyntacticMatches, 18 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26091 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4915occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 16 AbstIntIterations, 7 AbstIntStrong, 0.989756777163628 AbsIntWeakeningRatio, 0.5847201210287444 AbsIntAvgWeakeningVarsNumRemoved, 17.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 1176 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 7214 NumberOfCodeBlocks, 7214 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 9263 ConstructedInterpolants, 0 QuantifiedInterpolants, 2858232 SizeOfPredicates, 10 NumberOfNonLiveVariables, 8905 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 5637/6169 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...