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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:48,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:48,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:48,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:48,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:48,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:48,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:48,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:48,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:48,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:48,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:48,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:48,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:48,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:48,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:48,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:48,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:48,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:48,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:48,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:48,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:48,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:48,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:48,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:48,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:48,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:48,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:48,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:48,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:48,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:48,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:48,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:48,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:48,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:48,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:48,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:48,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:48,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:48,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:48,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:48,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:48,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:48,194 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:48,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:48,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:48,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:48,197 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:48,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:48,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:48,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:48,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:48,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:48,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:48,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:48,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:48,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:48,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:48,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:48,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:48,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:48,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:48,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:48,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:48,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:48,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:48,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:48,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:48,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:48,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:48,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:48,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:48,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:48,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:48,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:48,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:48,506 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:48,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-10-15 01:28:48,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbaca88f7/c16cbdffc43d427799fde34ae2c259a4/FLAG06835798c [2019-10-15 01:28:49,114 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:49,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-10-15 01:28:49,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbaca88f7/c16cbdffc43d427799fde34ae2c259a4/FLAG06835798c [2019-10-15 01:28:49,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbaca88f7/c16cbdffc43d427799fde34ae2c259a4 [2019-10-15 01:28:49,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:49,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:49,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:49,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:49,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:49,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:49" (1/1) ... [2019-10-15 01:28:49,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2d3d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:49, skipping insertion in model container [2019-10-15 01:28:49,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:49" (1/1) ... [2019-10-15 01:28:49,535 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:49,578 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:49,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:49,980 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:50,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:50,193 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:50,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50 WrapperNode [2019-10-15 01:28:50,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:50,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:50,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:50,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:50,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (1/1) ... [2019-10-15 01:28:50,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:50,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:50,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:50,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:50,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (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-15 01:28:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:50,360 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:50,360 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:28:50,360 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-15 01:28:50,360 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:50,360 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:50,361 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:50,361 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:28:50,361 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-15 01:28:50,361 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:50,361 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:50,361 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:50,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:50,363 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:50,363 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:50,363 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:50,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:28:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-15 01:28:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:28:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-15 01:28:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:51,143 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:51,143 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-15 01:28:51,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:51 BoogieIcfgContainer [2019-10-15 01:28:51,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:51,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:51,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:51,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:51,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:49" (1/3) ... [2019-10-15 01:28:51,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72383161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:51, skipping insertion in model container [2019-10-15 01:28:51,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:50" (2/3) ... [2019-10-15 01:28:51,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72383161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:51, skipping insertion in model container [2019-10-15 01:28:51,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:51" (3/3) ... [2019-10-15 01:28:51,161 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2019-10-15 01:28:51,170 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:51,178 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:51,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:51,221 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:51,222 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:51,222 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:51,222 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:51,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:51,223 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:51,223 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:51,223 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-10-15 01:28:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:51,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,267 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:51,269 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:51,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1449217388, now seen corresponding path program 1 times [2019-10-15 01:28:51,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:51,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450209816] [2019-10-15 01:28:51,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,705 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-15 01:28:51,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450209816] [2019-10-15 01:28:51,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:51,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:51,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762373619] [2019-10-15 01:28:51,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:51,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:51,736 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 5 states. [2019-10-15 01:28:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,537 INFO L93 Difference]: Finished difference Result 475 states and 713 transitions. [2019-10-15 01:28:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:52,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,578 INFO L225 Difference]: With dead ends: 475 [2019-10-15 01:28:52,578 INFO L226 Difference]: Without dead ends: 256 [2019-10-15 01:28:52,595 INFO L600 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-15 01:28:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-15 01:28:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2019-10-15 01:28:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 304 transitions. [2019-10-15 01:28:52,746 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 304 transitions. Word has length 120 [2019-10-15 01:28:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,748 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 304 transitions. [2019-10-15 01:28:52,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 304 transitions. [2019-10-15 01:28:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:52,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:52,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1789018706, now seen corresponding path program 1 times [2019-10-15 01:28:52,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107223662] [2019-10-15 01:28:52,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,946 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-15 01:28:52,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107223662] [2019-10-15 01:28:52,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:52,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717476441] [2019-10-15 01:28:52,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:52,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:52,979 INFO L87 Difference]: Start difference. First operand 220 states and 304 transitions. Second operand 5 states. [2019-10-15 01:28:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,554 INFO L93 Difference]: Finished difference Result 454 states and 646 transitions. [2019-10-15 01:28:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:53,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,560 INFO L225 Difference]: With dead ends: 454 [2019-10-15 01:28:53,561 INFO L226 Difference]: Without dead ends: 256 [2019-10-15 01:28:53,563 INFO L600 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-15 01:28:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-15 01:28:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2019-10-15 01:28:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 303 transitions. [2019-10-15 01:28:53,591 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 303 transitions. Word has length 120 [2019-10-15 01:28:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,592 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 303 transitions. [2019-10-15 01:28:53,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 303 transitions. [2019-10-15 01:28:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:53,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:53,596 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1154563372, now seen corresponding path program 1 times [2019-10-15 01:28:53,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005576572] [2019-10-15 01:28:53,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,736 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-15 01:28:53,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005576572] [2019-10-15 01:28:53,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:53,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:53,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835011069] [2019-10-15 01:28:53,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:53,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:53,741 INFO L87 Difference]: Start difference. First operand 220 states and 303 transitions. Second operand 5 states. [2019-10-15 01:28:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,289 INFO L93 Difference]: Finished difference Result 452 states and 640 transitions. [2019-10-15 01:28:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:54,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,292 INFO L225 Difference]: With dead ends: 452 [2019-10-15 01:28:54,292 INFO L226 Difference]: Without dead ends: 254 [2019-10-15 01:28:54,294 INFO L600 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-15 01:28:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-15 01:28:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 220. [2019-10-15 01:28:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 302 transitions. [2019-10-15 01:28:54,318 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 302 transitions. Word has length 120 [2019-10-15 01:28:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,319 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 302 transitions. [2019-10-15 01:28:54,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 302 transitions. [2019-10-15 01:28:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:54,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,321 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:54,321 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1521429010, now seen corresponding path program 1 times [2019-10-15 01:28:54,322 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585310859] [2019-10-15 01:28:54,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,401 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-15 01:28:54,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585310859] [2019-10-15 01:28:54,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:54,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:54,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755394696] [2019-10-15 01:28:54,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:54,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:54,404 INFO L87 Difference]: Start difference. First operand 220 states and 302 transitions. Second operand 5 states. [2019-10-15 01:28:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,982 INFO L93 Difference]: Finished difference Result 450 states and 634 transitions. [2019-10-15 01:28:54,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:54,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,986 INFO L225 Difference]: With dead ends: 450 [2019-10-15 01:28:54,986 INFO L226 Difference]: Without dead ends: 252 [2019-10-15 01:28:54,988 INFO L600 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-15 01:28:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-15 01:28:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 220. [2019-10-15 01:28:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 301 transitions. [2019-10-15 01:28:55,011 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 301 transitions. Word has length 120 [2019-10-15 01:28:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,012 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 301 transitions. [2019-10-15 01:28:55,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2019-10-15 01:28:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:55,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,014 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:55,014 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 637920020, now seen corresponding path program 1 times [2019-10-15 01:28:55,015 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917447639] [2019-10-15 01:28:55,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,166 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-15 01:28:55,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917447639] [2019-10-15 01:28:55,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:55,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:55,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106750662] [2019-10-15 01:28:55,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:55,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:55,171 INFO L87 Difference]: Start difference. First operand 220 states and 301 transitions. Second operand 5 states. [2019-10-15 01:28:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,630 INFO L93 Difference]: Finished difference Result 471 states and 668 transitions. [2019-10-15 01:28:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:55,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,634 INFO L225 Difference]: With dead ends: 471 [2019-10-15 01:28:55,634 INFO L226 Difference]: Without dead ends: 273 [2019-10-15 01:28:55,635 INFO L600 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-15 01:28:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-15 01:28:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 220. [2019-10-15 01:28:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 300 transitions. [2019-10-15 01:28:55,677 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 300 transitions. Word has length 120 [2019-10-15 01:28:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,678 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 300 transitions. [2019-10-15 01:28:55,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 300 transitions. [2019-10-15 01:28:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:55,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:55,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1302661994, now seen corresponding path program 1 times [2019-10-15 01:28:55,681 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745271660] [2019-10-15 01:28:55,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,749 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-15 01:28:55,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745271660] [2019-10-15 01:28:55,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:55,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:55,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30946639] [2019-10-15 01:28:55,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:55,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:55,752 INFO L87 Difference]: Start difference. First operand 220 states and 300 transitions. Second operand 5 states. [2019-10-15 01:28:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,201 INFO L93 Difference]: Finished difference Result 469 states and 662 transitions. [2019-10-15 01:28:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:56,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,204 INFO L225 Difference]: With dead ends: 469 [2019-10-15 01:28:56,204 INFO L226 Difference]: Without dead ends: 271 [2019-10-15 01:28:56,206 INFO L600 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-15 01:28:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-15 01:28:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 220. [2019-10-15 01:28:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 299 transitions. [2019-10-15 01:28:56,227 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 299 transitions. Word has length 120 [2019-10-15 01:28:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,228 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 299 transitions. [2019-10-15 01:28:56,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 299 transitions. [2019-10-15 01:28:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:56,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:56,230 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash 574401236, now seen corresponding path program 1 times [2019-10-15 01:28:56,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:56,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380357851] [2019-10-15 01:28:56,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,292 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-15 01:28:56,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380357851] [2019-10-15 01:28:56,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:56,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:56,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224479326] [2019-10-15 01:28:56,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:56,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:56,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:56,295 INFO L87 Difference]: Start difference. First operand 220 states and 299 transitions. Second operand 5 states. [2019-10-15 01:28:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,791 INFO L93 Difference]: Finished difference Result 467 states and 656 transitions. [2019-10-15 01:28:56,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:56,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,794 INFO L225 Difference]: With dead ends: 467 [2019-10-15 01:28:56,794 INFO L226 Difference]: Without dead ends: 269 [2019-10-15 01:28:56,795 INFO L600 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-15 01:28:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-15 01:28:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 220. [2019-10-15 01:28:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 298 transitions. [2019-10-15 01:28:56,817 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 298 transitions. Word has length 120 [2019-10-15 01:28:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,818 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 298 transitions. [2019-10-15 01:28:56,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 298 transitions. [2019-10-15 01:28:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:56,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,820 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:56,820 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash -196332330, now seen corresponding path program 1 times [2019-10-15 01:28:56,821 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:56,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215806020] [2019-10-15 01:28:56,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,883 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-15 01:28:56,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215806020] [2019-10-15 01:28:56,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:56,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:56,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244796654] [2019-10-15 01:28:56,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:56,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:56,886 INFO L87 Difference]: Start difference. First operand 220 states and 298 transitions. Second operand 5 states. [2019-10-15 01:28:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,324 INFO L93 Difference]: Finished difference Result 465 states and 650 transitions. [2019-10-15 01:28:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:57,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,327 INFO L225 Difference]: With dead ends: 465 [2019-10-15 01:28:57,327 INFO L226 Difference]: Without dead ends: 267 [2019-10-15 01:28:57,329 INFO L600 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-15 01:28:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-15 01:28:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 220. [2019-10-15 01:28:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:28:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 297 transitions. [2019-10-15 01:28:57,356 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 297 transitions. Word has length 120 [2019-10-15 01:28:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:57,356 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 297 transitions. [2019-10-15 01:28:57,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 297 transitions. [2019-10-15 01:28:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:57,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:57,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1191026028, now seen corresponding path program 1 times [2019-10-15 01:28:57,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630506771] [2019-10-15 01:28:57,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,446 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-15 01:28:57,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630506771] [2019-10-15 01:28:57,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:57,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:57,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310570704] [2019-10-15 01:28:57,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:57,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:57,450 INFO L87 Difference]: Start difference. First operand 220 states and 297 transitions. Second operand 6 states. [2019-10-15 01:28:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,495 INFO L93 Difference]: Finished difference Result 436 states and 607 transitions. [2019-10-15 01:28:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:57,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:28:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,499 INFO L225 Difference]: With dead ends: 436 [2019-10-15 01:28:57,499 INFO L226 Difference]: Without dead ends: 239 [2019-10-15 01:28:57,500 INFO L600 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-15 01:28:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-15 01:28:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2019-10-15 01:28:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-15 01:28:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 302 transitions. [2019-10-15 01:28:57,520 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 302 transitions. Word has length 120 [2019-10-15 01:28:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:57,521 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 302 transitions. [2019-10-15 01:28:57,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 302 transitions. [2019-10-15 01:28:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:57,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:57,523 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 543078422, now seen corresponding path program 1 times [2019-10-15 01:28:57,524 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439619452] [2019-10-15 01:28:57,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,603 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-15 01:28:57,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439619452] [2019-10-15 01:28:57,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:57,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:57,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179446045] [2019-10-15 01:28:57,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:57,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:57,606 INFO L87 Difference]: Start difference. First operand 225 states and 302 transitions. Second operand 6 states. [2019-10-15 01:28:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,657 INFO L93 Difference]: Finished difference Result 443 states and 612 transitions. [2019-10-15 01:28:57,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:57,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:28:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,660 INFO L225 Difference]: With dead ends: 443 [2019-10-15 01:28:57,661 INFO L226 Difference]: Without dead ends: 241 [2019-10-15 01:28:57,666 INFO L600 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-15 01:28:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-15 01:28:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2019-10-15 01:28:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-15 01:28:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 307 transitions. [2019-10-15 01:28:57,688 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 307 transitions. Word has length 120 [2019-10-15 01:28:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:57,688 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 307 transitions. [2019-10-15 01:28:57,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 307 transitions. [2019-10-15 01:28:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:57,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:57,693 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash -188889004, now seen corresponding path program 1 times [2019-10-15 01:28:57,694 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254048035] [2019-10-15 01:28:57,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,800 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-15 01:28:57,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254048035] [2019-10-15 01:28:57,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:57,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:57,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032797104] [2019-10-15 01:28:57,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:57,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:57,802 INFO L87 Difference]: Start difference. First operand 230 states and 307 transitions. Second operand 4 states. [2019-10-15 01:28:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,040 INFO L93 Difference]: Finished difference Result 637 states and 877 transitions. [2019-10-15 01:28:58,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:58,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:28:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,045 INFO L225 Difference]: With dead ends: 637 [2019-10-15 01:28:58,045 INFO L226 Difference]: Without dead ends: 430 [2019-10-15 01:28:58,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-15 01:28:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 425. [2019-10-15 01:28:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-15 01:28:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 566 transitions. [2019-10-15 01:28:58,087 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 566 transitions. Word has length 120 [2019-10-15 01:28:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,088 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 566 transitions. [2019-10-15 01:28:58,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 566 transitions. [2019-10-15 01:28:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:58,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:58,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 388039637, now seen corresponding path program 1 times [2019-10-15 01:28:58,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39896313] [2019-10-15 01:28:58,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,155 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-15 01:28:58,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39896313] [2019-10-15 01:28:58,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:58,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:58,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198551442] [2019-10-15 01:28:58,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:58,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:58,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:58,178 INFO L87 Difference]: Start difference. First operand 425 states and 566 transitions. Second operand 6 states. [2019-10-15 01:28:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,253 INFO L93 Difference]: Finished difference Result 840 states and 1145 transitions. [2019-10-15 01:28:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:58,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:28:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,257 INFO L225 Difference]: With dead ends: 840 [2019-10-15 01:28:58,258 INFO L226 Difference]: Without dead ends: 438 [2019-10-15 01:28:58,260 INFO L600 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-15 01:28:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-15 01:28:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 430. [2019-10-15 01:28:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-10-15 01:28:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 570 transitions. [2019-10-15 01:28:58,310 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 570 transitions. Word has length 120 [2019-10-15 01:28:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,312 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 570 transitions. [2019-10-15 01:28:58,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 570 transitions. [2019-10-15 01:28:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:58,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,314 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:58,314 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1648956887, now seen corresponding path program 1 times [2019-10-15 01:28:58,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858604614] [2019-10-15 01:28:58,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,391 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-15 01:28:58,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858604614] [2019-10-15 01:28:58,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:58,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:58,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988916517] [2019-10-15 01:28:58,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:58,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:58,394 INFO L87 Difference]: Start difference. First operand 430 states and 570 transitions. Second operand 4 states. [2019-10-15 01:28:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,674 INFO L93 Difference]: Finished difference Result 1231 states and 1684 transitions. [2019-10-15 01:28:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:58,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:28:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,682 INFO L225 Difference]: With dead ends: 1231 [2019-10-15 01:28:58,682 INFO L226 Difference]: Without dead ends: 824 [2019-10-15 01:28:58,685 INFO L600 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-15 01:28:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-10-15 01:28:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 817. [2019-10-15 01:28:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-10-15 01:28:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1080 transitions. [2019-10-15 01:28:58,748 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1080 transitions. Word has length 120 [2019-10-15 01:28:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,749 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1080 transitions. [2019-10-15 01:28:58,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1080 transitions. [2019-10-15 01:28:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:58,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,751 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:58,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1751758134, now seen corresponding path program 1 times [2019-10-15 01:28:58,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489661353] [2019-10-15 01:28:58,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,829 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-15 01:28:58,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489661353] [2019-10-15 01:28:58,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:58,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:58,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550513594] [2019-10-15 01:28:58,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:58,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:58,831 INFO L87 Difference]: Start difference. First operand 817 states and 1080 transitions. Second operand 6 states. [2019-10-15 01:28:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,922 INFO L93 Difference]: Finished difference Result 1631 states and 2205 transitions. [2019-10-15 01:28:58,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:58,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:28:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,930 INFO L225 Difference]: With dead ends: 1631 [2019-10-15 01:28:58,930 INFO L226 Difference]: Without dead ends: 837 [2019-10-15 01:28:58,935 INFO L600 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-15 01:28:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-10-15 01:28:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 827. [2019-10-15 01:28:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-10-15 01:28:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1088 transitions. [2019-10-15 01:28:59,033 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1088 transitions. Word has length 120 [2019-10-15 01:28:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,034 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1088 transitions. [2019-10-15 01:28:59,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1088 transitions. [2019-10-15 01:28:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:59,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,037 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:59,037 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,038 INFO L82 PathProgramCache]: Analyzing trace with hash -604047116, now seen corresponding path program 1 times [2019-10-15 01:28:59,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104695245] [2019-10-15 01:28:59,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,113 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-15 01:28:59,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104695245] [2019-10-15 01:28:59,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:59,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637112561] [2019-10-15 01:28:59,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:59,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:59,117 INFO L87 Difference]: Start difference. First operand 827 states and 1088 transitions. Second operand 4 states. [2019-10-15 01:28:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,516 INFO L93 Difference]: Finished difference Result 2411 states and 3286 transitions. [2019-10-15 01:28:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:59,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:28:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,527 INFO L225 Difference]: With dead ends: 2411 [2019-10-15 01:28:59,527 INFO L226 Difference]: Without dead ends: 1607 [2019-10-15 01:28:59,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-10-15 01:28:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1598. [2019-10-15 01:28:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2019-10-15 01:28:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2097 transitions. [2019-10-15 01:28:59,666 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2097 transitions. Word has length 120 [2019-10-15 01:28:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,666 INFO L462 AbstractCegarLoop]: Abstraction has 1598 states and 2097 transitions. [2019-10-15 01:28:59,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2097 transitions. [2019-10-15 01:28:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:28:59,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,670 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:59,670 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1761845548, now seen corresponding path program 1 times [2019-10-15 01:28:59,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716859421] [2019-10-15 01:28:59,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:28:59,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716859421] [2019-10-15 01:28:59,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:59,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335025142] [2019-10-15 01:28:59,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:59,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:59,736 INFO L87 Difference]: Start difference. First operand 1598 states and 2097 transitions. Second operand 6 states. [2019-10-15 01:28:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,898 INFO L93 Difference]: Finished difference Result 3201 states and 4303 transitions. [2019-10-15 01:28:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:59,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:28:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,909 INFO L225 Difference]: With dead ends: 3201 [2019-10-15 01:28:59,909 INFO L226 Difference]: Without dead ends: 1626 [2019-10-15 01:28:59,916 INFO L600 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-15 01:28:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-10-15 01:29:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1618. [2019-10-15 01:29:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-10-15 01:29:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2113 transitions. [2019-10-15 01:29:00,052 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2113 transitions. Word has length 141 [2019-10-15 01:29:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,053 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2113 transitions. [2019-10-15 01:29:00,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2113 transitions. [2019-10-15 01:29:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:00,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,056 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:00,057 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1560021614, now seen corresponding path program 1 times [2019-10-15 01:29:00,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100775427] [2019-10-15 01:29:00,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:00,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100775427] [2019-10-15 01:29:00,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:00,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:00,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230360817] [2019-10-15 01:29:00,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:00,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:00,137 INFO L87 Difference]: Start difference. First operand 1618 states and 2113 transitions. Second operand 5 states. [2019-10-15 01:29:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,666 INFO L93 Difference]: Finished difference Result 3212 states and 4210 transitions. [2019-10-15 01:29:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:00,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,680 INFO L225 Difference]: With dead ends: 3212 [2019-10-15 01:29:00,680 INFO L226 Difference]: Without dead ends: 1618 [2019-10-15 01:29:00,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-15 01:29:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-10-15 01:29:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-10-15 01:29:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-10-15 01:29:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2097 transitions. [2019-10-15 01:29:00,856 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2097 transitions. Word has length 141 [2019-10-15 01:29:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2097 transitions. [2019-10-15 01:29:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2097 transitions. [2019-10-15 01:29:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:00,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,860 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:00,860 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -173236204, now seen corresponding path program 1 times [2019-10-15 01:29:00,861 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47514604] [2019-10-15 01:29:00,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:00,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47514604] [2019-10-15 01:29:00,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:00,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:00,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556612710] [2019-10-15 01:29:00,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:00,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:00,963 INFO L87 Difference]: Start difference. First operand 1618 states and 2097 transitions. Second operand 5 states. [2019-10-15 01:29:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,467 INFO L93 Difference]: Finished difference Result 3212 states and 4178 transitions. [2019-10-15 01:29:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:01,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,477 INFO L225 Difference]: With dead ends: 3212 [2019-10-15 01:29:01,477 INFO L226 Difference]: Without dead ends: 1618 [2019-10-15 01:29:01,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-10-15 01:29:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-10-15 01:29:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-10-15 01:29:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2081 transitions. [2019-10-15 01:29:01,599 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2081 transitions. Word has length 141 [2019-10-15 01:29:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,600 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2081 transitions. [2019-10-15 01:29:01,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2081 transitions. [2019-10-15 01:29:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:01,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,603 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:01,603 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 702782802, now seen corresponding path program 1 times [2019-10-15 01:29:01,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:01,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174506602] [2019-10-15 01:29:01,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:01,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174506602] [2019-10-15 01:29:01,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:01,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:01,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545310839] [2019-10-15 01:29:01,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:01,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:01,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:01,697 INFO L87 Difference]: Start difference. First operand 1618 states and 2081 transitions. Second operand 5 states. [2019-10-15 01:29:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:02,168 INFO L93 Difference]: Finished difference Result 3212 states and 4146 transitions. [2019-10-15 01:29:02,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:02,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:02,179 INFO L225 Difference]: With dead ends: 3212 [2019-10-15 01:29:02,179 INFO L226 Difference]: Without dead ends: 1618 [2019-10-15 01:29:02,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-15 01:29:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-10-15 01:29:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-10-15 01:29:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-10-15 01:29:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2065 transitions. [2019-10-15 01:29:02,307 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2065 transitions. Word has length 141 [2019-10-15 01:29:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,307 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2065 transitions. [2019-10-15 01:29:02,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2065 transitions. [2019-10-15 01:29:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:02,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,312 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:02,312 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1146683476, now seen corresponding path program 1 times [2019-10-15 01:29:02,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884454012] [2019-10-15 01:29:02,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:02,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884454012] [2019-10-15 01:29:02,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:02,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:02,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813781368] [2019-10-15 01:29:02,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:02,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:02,378 INFO L87 Difference]: Start difference. First operand 1618 states and 2065 transitions. Second operand 5 states. [2019-10-15 01:29:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:03,073 INFO L93 Difference]: Finished difference Result 4062 states and 5227 transitions. [2019-10-15 01:29:03,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:03,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:03,088 INFO L225 Difference]: With dead ends: 4062 [2019-10-15 01:29:03,088 INFO L226 Difference]: Without dead ends: 2468 [2019-10-15 01:29:03,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-15 01:29:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2019-10-15 01:29:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2324. [2019-10-15 01:29:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2324 states. [2019-10-15 01:29:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 2887 transitions. [2019-10-15 01:29:03,259 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 2887 transitions. Word has length 141 [2019-10-15 01:29:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,260 INFO L462 AbstractCegarLoop]: Abstraction has 2324 states and 2887 transitions. [2019-10-15 01:29:03,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2887 transitions. [2019-10-15 01:29:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:03,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,263 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:03,263 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1609943790, now seen corresponding path program 1 times [2019-10-15 01:29:03,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571016988] [2019-10-15 01:29:03,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:03,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571016988] [2019-10-15 01:29:03,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:03,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:03,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867608773] [2019-10-15 01:29:03,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:03,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:03,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:03,331 INFO L87 Difference]: Start difference. First operand 2324 states and 2887 transitions. Second operand 5 states. [2019-10-15 01:29:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,210 INFO L93 Difference]: Finished difference Result 5805 states and 7585 transitions. [2019-10-15 01:29:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:04,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,229 INFO L225 Difference]: With dead ends: 5805 [2019-10-15 01:29:04,229 INFO L226 Difference]: Without dead ends: 3505 [2019-10-15 01:29:04,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-15 01:29:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2019-10-15 01:29:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2820. [2019-10-15 01:29:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-10-15 01:29:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3415 transitions. [2019-10-15 01:29:04,460 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3415 transitions. Word has length 141 [2019-10-15 01:29:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:04,460 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 3415 transitions. [2019-10-15 01:29:04,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3415 transitions. [2019-10-15 01:29:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:04,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,463 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:04,463 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash 656437396, now seen corresponding path program 1 times [2019-10-15 01:29:04,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511670489] [2019-10-15 01:29:04,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:04,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511670489] [2019-10-15 01:29:04,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:04,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:04,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755099577] [2019-10-15 01:29:04,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:04,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:04,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:04,543 INFO L87 Difference]: Start difference. First operand 2820 states and 3415 transitions. Second operand 5 states. [2019-10-15 01:29:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,418 INFO L93 Difference]: Finished difference Result 6425 states and 8158 transitions. [2019-10-15 01:29:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:05,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,439 INFO L225 Difference]: With dead ends: 6425 [2019-10-15 01:29:05,439 INFO L226 Difference]: Without dead ends: 3631 [2019-10-15 01:29:05,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2019-10-15 01:29:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3266. [2019-10-15 01:29:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2019-10-15 01:29:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 3871 transitions. [2019-10-15 01:29:05,722 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 3871 transitions. Word has length 141 [2019-10-15 01:29:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,723 INFO L462 AbstractCegarLoop]: Abstraction has 3266 states and 3871 transitions. [2019-10-15 01:29:05,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3871 transitions. [2019-10-15 01:29:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:05,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:05,726 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:05,726 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash 175357138, now seen corresponding path program 1 times [2019-10-15 01:29:05,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:05,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554754065] [2019-10-15 01:29:05,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:05,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554754065] [2019-10-15 01:29:05,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:05,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:05,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53298787] [2019-10-15 01:29:05,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:05,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:05,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:05,813 INFO L87 Difference]: Start difference. First operand 3266 states and 3871 transitions. Second operand 5 states. [2019-10-15 01:29:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,606 INFO L93 Difference]: Finished difference Result 6853 states and 8371 transitions. [2019-10-15 01:29:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:06,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-15 01:29:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,634 INFO L225 Difference]: With dead ends: 6853 [2019-10-15 01:29:06,634 INFO L226 Difference]: Without dead ends: 3613 [2019-10-15 01:29:06,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2019-10-15 01:29:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3448. [2019-10-15 01:29:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2019-10-15 01:29:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 4017 transitions. [2019-10-15 01:29:06,920 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 4017 transitions. Word has length 141 [2019-10-15 01:29:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,921 INFO L462 AbstractCegarLoop]: Abstraction has 3448 states and 4017 transitions. [2019-10-15 01:29:06,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 4017 transitions. [2019-10-15 01:29:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:29:06,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,924 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:06,924 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash 159838420, now seen corresponding path program 1 times [2019-10-15 01:29:06,925 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223454140] [2019-10-15 01:29:06,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:29:06,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223454140] [2019-10-15 01:29:06,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479835868] [2019-10-15 01:29:06,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:07,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:07,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:29:07,165 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:29:07,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:07,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-15 01:29:07,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335870514] [2019-10-15 01:29:07,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:07,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:07,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:07,286 INFO L87 Difference]: Start difference. First operand 3448 states and 4017 transitions. Second operand 3 states. [2019-10-15 01:29:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,634 INFO L93 Difference]: Finished difference Result 10063 states and 11933 transitions. [2019-10-15 01:29:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:07,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-15 01:29:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,658 INFO L225 Difference]: With dead ends: 10063 [2019-10-15 01:29:07,659 INFO L226 Difference]: Without dead ends: 6641 [2019-10-15 01:29:07,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6641 states. [2019-10-15 01:29:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6641 to 6299. [2019-10-15 01:29:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2019-10-15 01:29:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 7496 transitions. [2019-10-15 01:29:08,186 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 7496 transitions. Word has length 141 [2019-10-15 01:29:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,189 INFO L462 AbstractCegarLoop]: Abstraction has 6299 states and 7496 transitions. [2019-10-15 01:29:08,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 7496 transitions. [2019-10-15 01:29:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:29:08,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,195 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:08,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:08,403 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1140993030, now seen corresponding path program 1 times [2019-10-15 01:29:08,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398881456] [2019-10-15 01:29:08,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:29:08,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398881456] [2019-10-15 01:29:08,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:08,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:08,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172785612] [2019-10-15 01:29:08,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:08,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:08,460 INFO L87 Difference]: Start difference. First operand 6299 states and 7496 transitions. Second operand 3 states. [2019-10-15 01:29:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:09,139 INFO L93 Difference]: Finished difference Result 18759 states and 22655 transitions. [2019-10-15 01:29:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:09,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-15 01:29:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:09,172 INFO L225 Difference]: With dead ends: 18759 [2019-10-15 01:29:09,172 INFO L226 Difference]: Without dead ends: 9487 [2019-10-15 01:29:09,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2019-10-15 01:29:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 9487. [2019-10-15 01:29:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9487 states. [2019-10-15 01:29:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 11482 transitions. [2019-10-15 01:29:09,884 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 11482 transitions. Word has length 143 [2019-10-15 01:29:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:09,884 INFO L462 AbstractCegarLoop]: Abstraction has 9487 states and 11482 transitions. [2019-10-15 01:29:09,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 11482 transitions. [2019-10-15 01:29:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-15 01:29:09,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:09,905 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:09,905 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1352677120, now seen corresponding path program 1 times [2019-10-15 01:29:09,905 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:09,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328189323] [2019-10-15 01:29:09,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-15 01:29:10,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328189323] [2019-10-15 01:29:10,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:10,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:10,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110692907] [2019-10-15 01:29:10,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:10,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:10,069 INFO L87 Difference]: Start difference. First operand 9487 states and 11482 transitions. Second operand 4 states. [2019-10-15 01:29:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,582 INFO L93 Difference]: Finished difference Result 18939 states and 22908 transitions. [2019-10-15 01:29:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:10,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-10-15 01:29:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,618 INFO L225 Difference]: With dead ends: 18939 [2019-10-15 01:29:10,618 INFO L226 Difference]: Without dead ends: 9476 [2019-10-15 01:29:10,636 INFO L600 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-15 01:29:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2019-10-15 01:29:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 9476. [2019-10-15 01:29:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2019-10-15 01:29:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11458 transitions. [2019-10-15 01:29:12,002 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11458 transitions. Word has length 204 [2019-10-15 01:29:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:12,002 INFO L462 AbstractCegarLoop]: Abstraction has 9476 states and 11458 transitions. [2019-10-15 01:29:12,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11458 transitions. [2019-10-15 01:29:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-15 01:29:12,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:12,019 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:12,019 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -868057022, now seen corresponding path program 1 times [2019-10-15 01:29:12,020 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:12,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179296152] [2019-10-15 01:29:12,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-15 01:29:12,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179296152] [2019-10-15 01:29:12,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:12,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:12,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35985193] [2019-10-15 01:29:12,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:12,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:12,091 INFO L87 Difference]: Start difference. First operand 9476 states and 11458 transitions. Second operand 4 states. [2019-10-15 01:29:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:12,672 INFO L93 Difference]: Finished difference Result 17815 states and 21977 transitions. [2019-10-15 01:29:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:12,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-10-15 01:29:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:12,696 INFO L225 Difference]: With dead ends: 17815 [2019-10-15 01:29:12,697 INFO L226 Difference]: Without dead ends: 8365 [2019-10-15 01:29:12,714 INFO L600 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-15 01:29:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8365 states. [2019-10-15 01:29:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8365 to 8353. [2019-10-15 01:29:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8353 states. [2019-10-15 01:29:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8353 states to 8353 states and 9758 transitions. [2019-10-15 01:29:13,257 INFO L78 Accepts]: Start accepts. Automaton has 8353 states and 9758 transitions. Word has length 204 [2019-10-15 01:29:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:13,257 INFO L462 AbstractCegarLoop]: Abstraction has 8353 states and 9758 transitions. [2019-10-15 01:29:13,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 8353 states and 9758 transitions. [2019-10-15 01:29:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:29:13,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:13,275 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:29:13,276 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1088029884, now seen corresponding path program 1 times [2019-10-15 01:29:13,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:13,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000660510] [2019-10-15 01:29:13,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-15 01:29:13,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000660510] [2019-10-15 01:29:13,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047329535] [2019-10-15 01:29:13,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:13,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:13,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:13,560 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-15 01:29:13,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:13,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2019-10-15 01:29:13,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324305562] [2019-10-15 01:29:13,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:13,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:13,786 INFO L87 Difference]: Start difference. First operand 8353 states and 9758 transitions. Second operand 3 states. [2019-10-15 01:29:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:15,198 INFO L93 Difference]: Finished difference Result 21016 states and 24930 transitions. [2019-10-15 01:29:15,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:15,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-15 01:29:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:15,240 INFO L225 Difference]: With dead ends: 21016 [2019-10-15 01:29:15,240 INFO L226 Difference]: Without dead ends: 9719 [2019-10-15 01:29:15,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2019-10-15 01:29:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 9713. [2019-10-15 01:29:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9713 states. [2019-10-15 01:29:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9713 states to 9713 states and 11471 transitions. [2019-10-15 01:29:16,188 INFO L78 Accepts]: Start accepts. Automaton has 9713 states and 11471 transitions. Word has length 213 [2019-10-15 01:29:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:16,189 INFO L462 AbstractCegarLoop]: Abstraction has 9713 states and 11471 transitions. [2019-10-15 01:29:16,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 9713 states and 11471 transitions. [2019-10-15 01:29:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-10-15 01:29:16,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:16,221 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:16,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:16,433 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash 264604308, now seen corresponding path program 1 times [2019-10-15 01:29:16,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:16,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528680385] [2019-10-15 01:29:16,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:16,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:16,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-15 01:29:16,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528680385] [2019-10-15 01:29:16,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120920920] [2019-10-15 01:29:16,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:16,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:16,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-15 01:29:16,947 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:17,088 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-10-15 01:29:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-10-15 01:29:17,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:17,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2019-10-15 01:29:17,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817072791] [2019-10-15 01:29:17,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:17,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:29:17,404 INFO L87 Difference]: Start difference. First operand 9713 states and 11471 transitions. Second operand 3 states. [2019-10-15 01:29:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:18,166 INFO L93 Difference]: Finished difference Result 20154 states and 24494 transitions. [2019-10-15 01:29:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:18,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-10-15 01:29:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:18,206 INFO L225 Difference]: With dead ends: 20154 [2019-10-15 01:29:18,206 INFO L226 Difference]: Without dead ends: 10465 [2019-10-15 01:29:18,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:29:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10465 states. [2019-10-15 01:29:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10465 to 10461. [2019-10-15 01:29:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10461 states. [2019-10-15 01:29:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10461 states to 10461 states and 11914 transitions. [2019-10-15 01:29:19,237 INFO L78 Accepts]: Start accepts. Automaton has 10461 states and 11914 transitions. Word has length 424 [2019-10-15 01:29:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:19,237 INFO L462 AbstractCegarLoop]: Abstraction has 10461 states and 11914 transitions. [2019-10-15 01:29:19,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 10461 states and 11914 transitions. [2019-10-15 01:29:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-15 01:29:19,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:19,265 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:19,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:19,470 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1866289792, now seen corresponding path program 1 times [2019-10-15 01:29:19,471 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:19,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744578304] [2019-10-15 01:29:19,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:19,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:19,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-15 01:29:19,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744578304] [2019-10-15 01:29:19,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309637619] [2019-10-15 01:29:19,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:19,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:19,896 INFO L279 TraceCheckSpWp]: Computing forward predicates...