/usr/bin/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.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:15:21,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:15:21,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:15:21,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:15:21,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:15:21,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:15:21,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:15:21,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:15:21,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:15:21,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:15:21,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:15:21,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:15:21,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:15:21,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:15:21,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:15:21,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:15:21,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:15:21,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:15:21,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:15:21,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:15:21,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:15:21,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:15:21,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:15:21,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:15:21,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:15:21,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:15:21,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:15:21,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:15:21,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:15:21,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:15:21,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:15:21,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:15:21,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:15:21,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:15:21,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:15:21,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:15:21,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:15:21,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:15:21,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:15:21,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:15:21,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:15:21,398 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-11-07 01:15:21,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:15:21,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:15:21,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:15:21,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:15:21,427 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:15:21,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:15:21,427 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:15:21,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:15:21,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:15:21,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:15:21,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:15:21,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:15:21,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:15:21,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:15:21,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:15:21,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:15:21,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:15:21,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:15:21,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:15:21,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:15:21,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:15:21,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:15:21,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:15:21,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:15:21,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:15:21,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:15:21,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:15:21,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:15:21,433 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-11-07 01:15:21,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:15:21,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:15:21,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:15:21,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:15:21,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:15:21,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-11-07 01:15:21,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b393fbf4/6a06696206104e079cd55b0e9bc87cf6/FLAG29740ea0e [2019-11-07 01:15:22,320 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:15:22,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-11-07 01:15:22,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b393fbf4/6a06696206104e079cd55b0e9bc87cf6/FLAG29740ea0e [2019-11-07 01:15:22,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b393fbf4/6a06696206104e079cd55b0e9bc87cf6 [2019-11-07 01:15:22,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:15:22,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:15:22,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:15:22,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:15:22,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:15:22,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:22" (1/1) ... [2019-11-07 01:15:22,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46486aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:22, skipping insertion in model container [2019-11-07 01:15:22,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:22" (1/1) ... [2019-11-07 01:15:22,712 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:15:22,781 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:15:23,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:15:23,109 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:15:23,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:15:23,308 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:15:23,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23 WrapperNode [2019-11-07 01:15:23,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:15:23,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:15:23,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:15:23,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:15:23,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (1/1) ... [2019-11-07 01:15:23,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:15:23,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:15:23,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:15:23,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:15:23,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (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-11-07 01:15:23,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:15:23,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:15:23,436 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-07 01:15:23,436 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-07 01:15:23,436 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-07 01:15:23,436 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-07 01:15:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-11-07 01:15:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-07 01:15:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-07 01:15:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-07 01:15:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-11-07 01:15:23,437 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-07 01:15:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-07 01:15:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-07 01:15:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-07 01:15:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-07 01:15:23,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-07 01:15:23,440 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-07 01:15:23,440 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-07 01:15:23,440 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-07 01:15:23,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-07 01:15:23,441 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-07 01:15:23,441 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-07 01:15:23,441 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-07 01:15:23,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:15:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:15:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:15:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-07 01:15:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-07 01:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-07 01:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-07 01:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-11-07 01:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-07 01:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-07 01:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-07 01:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:15:24,133 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:15:24,134 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-07 01:15:24,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:24 BoogieIcfgContainer [2019-11-07 01:15:24,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:15:24,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:15:24,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:15:24,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:15:24,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:15:22" (1/3) ... [2019-11-07 01:15:24,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66efb2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:24, skipping insertion in model container [2019-11-07 01:15:24,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:23" (2/3) ... [2019-11-07 01:15:24,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66efb2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:24, skipping insertion in model container [2019-11-07 01:15:24,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:24" (3/3) ... [2019-11-07 01:15:24,144 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-11-07 01:15:24,153 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:15:24,161 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:15:24,171 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:15:24,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:15:24,197 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:15:24,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:15:24,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:15:24,198 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:15:24,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:15:24,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:15:24,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:15:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-07 01:15:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:24,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:24,250 INFO L410 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] [2019-11-07 01:15:24,251 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1961190691, now seen corresponding path program 1 times [2019-11-07 01:15:24,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:24,267 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650580561] [2019-11-07 01:15:24,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:24,614 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650580561] [2019-11-07 01:15:24,615 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:24,616 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:24,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594531983] [2019-11-07 01:15:24,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:24,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:24,644 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 5 states. [2019-11-07 01:15:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:25,387 INFO L93 Difference]: Finished difference Result 412 states and 610 transitions. [2019-11-07 01:15:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:25,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:25,406 INFO L225 Difference]: With dead ends: 412 [2019-11-07 01:15:25,406 INFO L226 Difference]: Without dead ends: 222 [2019-11-07 01:15:25,412 INFO L630 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-11-07 01:15:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-07 01:15:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-11-07 01:15:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:15:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2019-11-07 01:15:25,489 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 105 [2019-11-07 01:15:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:25,490 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2019-11-07 01:15:25,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2019-11-07 01:15:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:25,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:25,495 INFO L410 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] [2019-11-07 01:15:25,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash -767018655, now seen corresponding path program 1 times [2019-11-07 01:15:25,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:25,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121821734] [2019-11-07 01:15:25,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:25,713 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121821734] [2019-11-07 01:15:25,714 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:25,714 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:25,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013706216] [2019-11-07 01:15:25,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:25,717 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:25,718 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand 5 states. [2019-11-07 01:15:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:26,245 INFO L93 Difference]: Finished difference Result 391 states and 548 transitions. [2019-11-07 01:15:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:26,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:26,253 INFO L225 Difference]: With dead ends: 391 [2019-11-07 01:15:26,256 INFO L226 Difference]: Without dead ends: 222 [2019-11-07 01:15:26,261 INFO L630 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-11-07 01:15:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-07 01:15:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-11-07 01:15:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:15:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2019-11-07 01:15:26,314 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 105 [2019-11-07 01:15:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:26,317 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2019-11-07 01:15:26,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2019-11-07 01:15:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:26,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:26,320 INFO L410 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] [2019-11-07 01:15:26,323 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1824856733, now seen corresponding path program 1 times [2019-11-07 01:15:26,323 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:26,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584864157] [2019-11-07 01:15:26,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:26,460 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584864157] [2019-11-07 01:15:26,460 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:26,460 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:26,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187888512] [2019-11-07 01:15:26,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:26,463 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:26,464 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand 5 states. [2019-11-07 01:15:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:26,934 INFO L93 Difference]: Finished difference Result 389 states and 542 transitions. [2019-11-07 01:15:26,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:26,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:26,937 INFO L225 Difference]: With dead ends: 389 [2019-11-07 01:15:26,937 INFO L226 Difference]: Without dead ends: 220 [2019-11-07 01:15:26,938 INFO L630 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-11-07 01:15:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-07 01:15:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2019-11-07 01:15:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:15:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2019-11-07 01:15:26,976 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 105 [2019-11-07 01:15:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:26,976 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2019-11-07 01:15:26,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2019-11-07 01:15:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:26,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:26,979 INFO L410 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] [2019-11-07 01:15:26,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1327608097, now seen corresponding path program 1 times [2019-11-07 01:15:26,980 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:26,981 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120114383] [2019-11-07 01:15:26,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:27,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120114383] [2019-11-07 01:15:27,055 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:27,056 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:27,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855895767] [2019-11-07 01:15:27,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:27,057 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:27,057 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand 5 states. [2019-11-07 01:15:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:27,523 INFO L93 Difference]: Finished difference Result 387 states and 536 transitions. [2019-11-07 01:15:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:27,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:27,526 INFO L225 Difference]: With dead ends: 387 [2019-11-07 01:15:27,526 INFO L226 Difference]: Without dead ends: 218 [2019-11-07 01:15:27,527 INFO L630 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-11-07 01:15:27,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-07 01:15:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2019-11-07 01:15:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:15:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-11-07 01:15:27,547 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 105 [2019-11-07 01:15:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:27,548 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-11-07 01:15:27,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-11-07 01:15:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:27,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:27,550 INFO L410 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] [2019-11-07 01:15:27,551 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1567847843, now seen corresponding path program 1 times [2019-11-07 01:15:27,551 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:27,552 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009936076] [2019-11-07 01:15:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:27,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009936076] [2019-11-07 01:15:27,629 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:27,629 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:27,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035667653] [2019-11-07 01:15:27,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:27,630 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:27,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:27,631 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 5 states. [2019-11-07 01:15:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:28,038 INFO L93 Difference]: Finished difference Result 407 states and 568 transitions. [2019-11-07 01:15:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:28,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:28,041 INFO L225 Difference]: With dead ends: 407 [2019-11-07 01:15:28,041 INFO L226 Difference]: Without dead ends: 238 [2019-11-07 01:15:28,042 INFO L630 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-11-07 01:15:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-07 01:15:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2019-11-07 01:15:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:15:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2019-11-07 01:15:28,062 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 105 [2019-11-07 01:15:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:28,063 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2019-11-07 01:15:28,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2019-11-07 01:15:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:28,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:28,065 INFO L410 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] [2019-11-07 01:15:28,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1888085791, now seen corresponding path program 1 times [2019-11-07 01:15:28,066 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:28,066 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663336620] [2019-11-07 01:15:28,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:28,130 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663336620] [2019-11-07 01:15:28,130 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:28,130 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:28,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107232160] [2019-11-07 01:15:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:28,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:28,132 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand 5 states. [2019-11-07 01:15:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:28,572 INFO L93 Difference]: Finished difference Result 405 states and 562 transitions. [2019-11-07 01:15:28,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:28,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:28,575 INFO L225 Difference]: With dead ends: 405 [2019-11-07 01:15:28,575 INFO L226 Difference]: Without dead ends: 236 [2019-11-07 01:15:28,576 INFO L630 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-11-07 01:15:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-07 01:15:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 190. [2019-11-07 01:15:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:15:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 253 transitions. [2019-11-07 01:15:28,596 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 253 transitions. Word has length 105 [2019-11-07 01:15:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:28,596 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 253 transitions. [2019-11-07 01:15:28,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 253 transitions. [2019-11-07 01:15:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:28,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:28,598 INFO L410 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] [2019-11-07 01:15:28,598 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1861020189, now seen corresponding path program 1 times [2019-11-07 01:15:28,599 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:28,599 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654826929] [2019-11-07 01:15:28,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:28,649 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654826929] [2019-11-07 01:15:28,649 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:28,650 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:28,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270014895] [2019-11-07 01:15:28,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:28,651 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:28,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:28,651 INFO L87 Difference]: Start difference. First operand 190 states and 253 transitions. Second operand 4 states. [2019-11-07 01:15:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:28,861 INFO L93 Difference]: Finished difference Result 518 states and 714 transitions. [2019-11-07 01:15:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:28,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-07 01:15:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:28,864 INFO L225 Difference]: With dead ends: 518 [2019-11-07 01:15:28,864 INFO L226 Difference]: Without dead ends: 350 [2019-11-07 01:15:28,866 INFO L630 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-11-07 01:15:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-07 01:15:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2019-11-07 01:15:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-07 01:15:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 459 transitions. [2019-11-07 01:15:28,900 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 459 transitions. Word has length 105 [2019-11-07 01:15:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:28,901 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 459 transitions. [2019-11-07 01:15:28,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 459 transitions. [2019-11-07 01:15:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:28,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:28,903 INFO L410 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] [2019-11-07 01:15:28,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -723391324, now seen corresponding path program 1 times [2019-11-07 01:15:28,904 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:28,904 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816270687] [2019-11-07 01:15:28,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:28,954 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816270687] [2019-11-07 01:15:28,954 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:28,954 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:28,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638454130] [2019-11-07 01:15:28,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:28,955 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:28,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:28,956 INFO L87 Difference]: Start difference. First operand 345 states and 459 transitions. Second operand 6 states. [2019-11-07 01:15:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:29,044 INFO L93 Difference]: Finished difference Result 684 states and 934 transitions. [2019-11-07 01:15:29,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:29,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-11-07 01:15:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:29,048 INFO L225 Difference]: With dead ends: 684 [2019-11-07 01:15:29,048 INFO L226 Difference]: Without dead ends: 361 [2019-11-07 01:15:29,050 INFO L630 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-11-07 01:15:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-07 01:15:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2019-11-07 01:15:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-07 01:15:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 463 transitions. [2019-11-07 01:15:29,091 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 463 transitions. Word has length 105 [2019-11-07 01:15:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:29,092 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 463 transitions. [2019-11-07 01:15:29,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 463 transitions. [2019-11-07 01:15:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:29,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:29,096 INFO L410 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] [2019-11-07 01:15:29,097 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1140787930, now seen corresponding path program 1 times [2019-11-07 01:15:29,097 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:29,098 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888206279] [2019-11-07 01:15:29,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:29,169 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888206279] [2019-11-07 01:15:29,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:29,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424996101] [2019-11-07 01:15:29,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:29,172 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:29,173 INFO L87 Difference]: Start difference. First operand 350 states and 463 transitions. Second operand 6 states. [2019-11-07 01:15:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:29,247 INFO L93 Difference]: Finished difference Result 704 states and 958 transitions. [2019-11-07 01:15:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:29,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-11-07 01:15:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:29,256 INFO L225 Difference]: With dead ends: 704 [2019-11-07 01:15:29,257 INFO L226 Difference]: Without dead ends: 376 [2019-11-07 01:15:29,269 INFO L630 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-11-07 01:15:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-07 01:15:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2019-11-07 01:15:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-07 01:15:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2019-11-07 01:15:29,312 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 105 [2019-11-07 01:15:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:29,313 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2019-11-07 01:15:29,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2019-11-07 01:15:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:29,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:29,315 INFO L410 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] [2019-11-07 01:15:29,315 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash -264768924, now seen corresponding path program 1 times [2019-11-07 01:15:29,316 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:29,316 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966207188] [2019-11-07 01:15:29,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:29,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966207188] [2019-11-07 01:15:29,375 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:29,376 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:29,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807931513] [2019-11-07 01:15:29,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:29,377 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:29,378 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 6 states. [2019-11-07 01:15:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:29,435 INFO L93 Difference]: Finished difference Result 718 states and 968 transitions. [2019-11-07 01:15:29,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:29,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-11-07 01:15:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:29,438 INFO L225 Difference]: With dead ends: 718 [2019-11-07 01:15:29,438 INFO L226 Difference]: Without dead ends: 380 [2019-11-07 01:15:29,444 INFO L630 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-11-07 01:15:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-07 01:15:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2019-11-07 01:15:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-07 01:15:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 483 transitions. [2019-11-07 01:15:29,485 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 483 transitions. Word has length 105 [2019-11-07 01:15:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:29,486 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 483 transitions. [2019-11-07 01:15:29,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 483 transitions. [2019-11-07 01:15:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:29,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:29,487 INFO L410 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] [2019-11-07 01:15:29,488 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 628717414, now seen corresponding path program 1 times [2019-11-07 01:15:29,488 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:29,488 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704048489] [2019-11-07 01:15:29,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:29,554 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704048489] [2019-11-07 01:15:29,555 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:29,555 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:29,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787635493] [2019-11-07 01:15:29,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:29,556 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:29,557 INFO L87 Difference]: Start difference. First operand 370 states and 483 transitions. Second operand 6 states. [2019-11-07 01:15:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:29,607 INFO L93 Difference]: Finished difference Result 732 states and 978 transitions. [2019-11-07 01:15:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:29,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-11-07 01:15:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:29,611 INFO L225 Difference]: With dead ends: 732 [2019-11-07 01:15:29,611 INFO L226 Difference]: Without dead ends: 384 [2019-11-07 01:15:29,613 INFO L630 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-11-07 01:15:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-07 01:15:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2019-11-07 01:15:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-07 01:15:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 493 transitions. [2019-11-07 01:15:29,644 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 493 transitions. Word has length 105 [2019-11-07 01:15:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:29,646 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 493 transitions. [2019-11-07 01:15:29,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 493 transitions. [2019-11-07 01:15:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:29,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:29,648 INFO L410 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] [2019-11-07 01:15:29,648 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash 234350628, now seen corresponding path program 1 times [2019-11-07 01:15:29,649 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:29,649 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733188449] [2019-11-07 01:15:29,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:29,770 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733188449] [2019-11-07 01:15:29,771 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:29,771 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:29,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261364236] [2019-11-07 01:15:29,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:29,772 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:29,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:29,773 INFO L87 Difference]: Start difference. First operand 380 states and 493 transitions. Second operand 5 states. [2019-11-07 01:15:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:30,414 INFO L93 Difference]: Finished difference Result 896 states and 1184 transitions. [2019-11-07 01:15:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:15:30,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:30,420 INFO L225 Difference]: With dead ends: 896 [2019-11-07 01:15:30,420 INFO L226 Difference]: Without dead ends: 539 [2019-11-07 01:15:30,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:15:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-07 01:15:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 499. [2019-11-07 01:15:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-11-07 01:15:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 635 transitions. [2019-11-07 01:15:30,476 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 635 transitions. Word has length 105 [2019-11-07 01:15:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:30,477 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 635 transitions. [2019-11-07 01:15:30,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 635 transitions. [2019-11-07 01:15:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:30,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:30,479 INFO L410 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] [2019-11-07 01:15:30,479 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:30,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:30,479 INFO L82 PathProgramCache]: Analyzing trace with hash 509110242, now seen corresponding path program 1 times [2019-11-07 01:15:30,480 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:30,481 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190932720] [2019-11-07 01:15:30,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:30,555 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190932720] [2019-11-07 01:15:30,555 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:30,555 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:30,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232058595] [2019-11-07 01:15:30,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:30,557 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:30,558 INFO L87 Difference]: Start difference. First operand 499 states and 635 transitions. Second operand 5 states. [2019-11-07 01:15:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:30,927 INFO L93 Difference]: Finished difference Result 975 states and 1246 transitions. [2019-11-07 01:15:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:30,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:30,931 INFO L225 Difference]: With dead ends: 975 [2019-11-07 01:15:30,931 INFO L226 Difference]: Without dead ends: 499 [2019-11-07 01:15:30,933 INFO L630 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-11-07 01:15:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-07 01:15:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-11-07 01:15:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-11-07 01:15:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 630 transitions. [2019-11-07 01:15:30,974 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 630 transitions. Word has length 105 [2019-11-07 01:15:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:30,975 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 630 transitions. [2019-11-07 01:15:30,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 630 transitions. [2019-11-07 01:15:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:30,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:30,977 INFO L410 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] [2019-11-07 01:15:30,977 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:30,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1210710116, now seen corresponding path program 1 times [2019-11-07 01:15:30,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:30,978 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349578649] [2019-11-07 01:15:30,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:31,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349578649] [2019-11-07 01:15:31,054 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:31,054 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:31,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935373636] [2019-11-07 01:15:31,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:31,055 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:31,055 INFO L87 Difference]: Start difference. First operand 499 states and 630 transitions. Second operand 5 states. [2019-11-07 01:15:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:31,561 INFO L93 Difference]: Finished difference Result 975 states and 1236 transitions. [2019-11-07 01:15:31,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:31,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:31,567 INFO L225 Difference]: With dead ends: 975 [2019-11-07 01:15:31,567 INFO L226 Difference]: Without dead ends: 499 [2019-11-07 01:15:31,570 INFO L630 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-11-07 01:15:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-07 01:15:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-11-07 01:15:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-11-07 01:15:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 625 transitions. [2019-11-07 01:15:31,625 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 625 transitions. Word has length 105 [2019-11-07 01:15:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:31,625 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 625 transitions. [2019-11-07 01:15:31,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2019-11-07 01:15:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:31,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:31,628 INFO L410 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] [2019-11-07 01:15:31,629 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1233342370, now seen corresponding path program 1 times [2019-11-07 01:15:31,630 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:31,630 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587839074] [2019-11-07 01:15:31,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:31,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-11-07 01:15:31,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587839074] [2019-11-07 01:15:31,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:31,706 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:31,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380396180] [2019-11-07 01:15:31,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:31,708 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:31,709 INFO L87 Difference]: Start difference. First operand 499 states and 625 transitions. Second operand 5 states. [2019-11-07 01:15:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:32,300 INFO L93 Difference]: Finished difference Result 1073 states and 1375 transitions. [2019-11-07 01:15:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:32,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:32,304 INFO L225 Difference]: With dead ends: 1073 [2019-11-07 01:15:32,304 INFO L226 Difference]: Without dead ends: 596 [2019-11-07 01:15:32,306 INFO L630 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-11-07 01:15:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-07 01:15:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 561. [2019-11-07 01:15:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-11-07 01:15:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 697 transitions. [2019-11-07 01:15:32,350 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 697 transitions. Word has length 105 [2019-11-07 01:15:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:32,351 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 697 transitions. [2019-11-07 01:15:32,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 697 transitions. [2019-11-07 01:15:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:32,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:32,353 INFO L410 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] [2019-11-07 01:15:32,353 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash 723869280, now seen corresponding path program 1 times [2019-11-07 01:15:32,354 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:32,354 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842988346] [2019-11-07 01:15:32,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:32,421 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842988346] [2019-11-07 01:15:32,421 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:32,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:32,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583883743] [2019-11-07 01:15:32,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:32,422 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:32,423 INFO L87 Difference]: Start difference. First operand 561 states and 697 transitions. Second operand 5 states. [2019-11-07 01:15:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:33,035 INFO L93 Difference]: Finished difference Result 1325 states and 1735 transitions. [2019-11-07 01:15:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:33,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:33,042 INFO L225 Difference]: With dead ends: 1325 [2019-11-07 01:15:33,042 INFO L226 Difference]: Without dead ends: 786 [2019-11-07 01:15:33,045 INFO L630 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-11-07 01:15:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-11-07 01:15:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 647. [2019-11-07 01:15:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-07 01:15:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 786 transitions. [2019-11-07 01:15:33,122 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 786 transitions. Word has length 105 [2019-11-07 01:15:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:33,123 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 786 transitions. [2019-11-07 01:15:33,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 786 transitions. [2019-11-07 01:15:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:33,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:33,124 INFO L410 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] [2019-11-07 01:15:33,125 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1647869982, now seen corresponding path program 1 times [2019-11-07 01:15:33,125 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:33,125 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035687799] [2019-11-07 01:15:33,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:33,200 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035687799] [2019-11-07 01:15:33,200 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:33,200 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:33,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718421965] [2019-11-07 01:15:33,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:33,201 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:33,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:33,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:33,202 INFO L87 Difference]: Start difference. First operand 647 states and 786 transitions. Second operand 5 states. [2019-11-07 01:15:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:33,747 INFO L93 Difference]: Finished difference Result 1474 states and 1904 transitions. [2019-11-07 01:15:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:15:33,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-07 01:15:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:33,754 INFO L225 Difference]: With dead ends: 1474 [2019-11-07 01:15:33,755 INFO L226 Difference]: Without dead ends: 849 [2019-11-07 01:15:33,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:15:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-11-07 01:15:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 739. [2019-11-07 01:15:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-11-07 01:15:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 886 transitions. [2019-11-07 01:15:33,821 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 886 transitions. Word has length 105 [2019-11-07 01:15:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:33,822 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 886 transitions. [2019-11-07 01:15:33,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2019-11-07 01:15:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 01:15:33,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:33,824 INFO L410 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] [2019-11-07 01:15:33,824 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1585830368, now seen corresponding path program 1 times [2019-11-07 01:15:33,825 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:33,825 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300798203] [2019-11-07 01:15:33,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:33,863 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300798203] [2019-11-07 01:15:33,863 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:33,863 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:15:33,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366269776] [2019-11-07 01:15:33,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:33,864 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:33,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:33,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:33,865 INFO L87 Difference]: Start difference. First operand 739 states and 886 transitions. Second operand 3 states. [2019-11-07 01:15:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:33,982 INFO L93 Difference]: Finished difference Result 2099 states and 2536 transitions. [2019-11-07 01:15:33,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:33,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-07 01:15:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:33,992 INFO L225 Difference]: With dead ends: 2099 [2019-11-07 01:15:33,992 INFO L226 Difference]: Without dead ends: 1385 [2019-11-07 01:15:33,995 INFO L630 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-11-07 01:15:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-11-07 01:15:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2019-11-07 01:15:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-11-07 01:15:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1666 transitions. [2019-11-07 01:15:34,136 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1666 transitions. Word has length 105 [2019-11-07 01:15:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:34,136 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 1666 transitions. [2019-11-07 01:15:34,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1666 transitions. [2019-11-07 01:15:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:15:34,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:34,139 INFO L410 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] [2019-11-07 01:15:34,139 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1038281626, now seen corresponding path program 1 times [2019-11-07 01:15:34,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:34,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620469103] [2019-11-07 01:15:34,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:34,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620469103] [2019-11-07 01:15:34,183 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:34,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:15:34,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122728793] [2019-11-07 01:15:34,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:34,184 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:34,185 INFO L87 Difference]: Start difference. First operand 1382 states and 1666 transitions. Second operand 3 states. [2019-11-07 01:15:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:34,392 INFO L93 Difference]: Finished difference Result 4000 states and 5001 transitions. [2019-11-07 01:15:34,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:34,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-07 01:15:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:34,412 INFO L225 Difference]: With dead ends: 4000 [2019-11-07 01:15:34,412 INFO L226 Difference]: Without dead ends: 2649 [2019-11-07 01:15:34,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-07 01:15:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-11-07 01:15:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2643. [2019-11-07 01:15:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-11-07 01:15:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3237 transitions. [2019-11-07 01:15:34,639 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3237 transitions. Word has length 106 [2019-11-07 01:15:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:34,639 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 3237 transitions. [2019-11-07 01:15:34,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3237 transitions. [2019-11-07 01:15:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-07 01:15:34,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:34,643 INFO L410 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] [2019-11-07 01:15:34,644 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1706050930, now seen corresponding path program 1 times [2019-11-07 01:15:34,644 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:34,645 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450446869] [2019-11-07 01:15:34,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:34,712 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450446869] [2019-11-07 01:15:34,712 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:34,713 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:34,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536581695] [2019-11-07 01:15:34,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:34,714 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:34,714 INFO L87 Difference]: Start difference. First operand 2643 states and 3237 transitions. Second operand 4 states. [2019-11-07 01:15:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:34,968 INFO L93 Difference]: Finished difference Result 4719 states and 5752 transitions. [2019-11-07 01:15:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:34,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-07 01:15:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:34,983 INFO L225 Difference]: With dead ends: 4719 [2019-11-07 01:15:34,983 INFO L226 Difference]: Without dead ends: 2101 [2019-11-07 01:15:34,992 INFO L630 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-11-07 01:15:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-11-07 01:15:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2042. [2019-11-07 01:15:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-11-07 01:15:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2486 transitions. [2019-11-07 01:15:35,228 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2486 transitions. Word has length 127 [2019-11-07 01:15:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:35,229 INFO L462 AbstractCegarLoop]: Abstraction has 2042 states and 2486 transitions. [2019-11-07 01:15:35,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2486 transitions. [2019-11-07 01:15:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-07 01:15:35,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:35,233 INFO L410 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] [2019-11-07 01:15:35,234 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -941553424, now seen corresponding path program 1 times [2019-11-07 01:15:35,235 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:35,235 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408397963] [2019-11-07 01:15:35,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:15:35,298 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408397963] [2019-11-07 01:15:35,298 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:35,299 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:15:35,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513384102] [2019-11-07 01:15:35,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:35,300 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:35,301 INFO L87 Difference]: Start difference. First operand 2042 states and 2486 transitions. Second operand 3 states. [2019-11-07 01:15:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:35,731 INFO L93 Difference]: Finished difference Result 6036 states and 7443 transitions. [2019-11-07 01:15:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:35,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-07 01:15:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:35,750 INFO L225 Difference]: With dead ends: 6036 [2019-11-07 01:15:35,750 INFO L226 Difference]: Without dead ends: 3035 [2019-11-07 01:15:35,762 INFO L630 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-11-07 01:15:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-11-07 01:15:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3035. [2019-11-07 01:15:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-11-07 01:15:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 3687 transitions. [2019-11-07 01:15:36,011 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 3687 transitions. Word has length 127 [2019-11-07 01:15:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:36,011 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 3687 transitions. [2019-11-07 01:15:36,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 3687 transitions. [2019-11-07 01:15:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-07 01:15:36,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:36,016 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:36,017 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1911837015, now seen corresponding path program 1 times [2019-11-07 01:15:36,017 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:36,018 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511500927] [2019-11-07 01:15:36,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-07 01:15:36,079 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511500927] [2019-11-07 01:15:36,079 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:36,079 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:15:36,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174019132] [2019-11-07 01:15:36,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:36,080 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:36,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:36,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:36,081 INFO L87 Difference]: Start difference. First operand 3035 states and 3687 transitions. Second operand 3 states. [2019-11-07 01:15:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:36,476 INFO L93 Difference]: Finished difference Result 8922 states and 11107 transitions. [2019-11-07 01:15:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:36,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-07 01:15:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:36,511 INFO L225 Difference]: With dead ends: 8922 [2019-11-07 01:15:36,511 INFO L226 Difference]: Without dead ends: 5912 [2019-11-07 01:15:36,525 INFO L630 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-11-07 01:15:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5912 states. [2019-11-07 01:15:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5912 to 5909. [2019-11-07 01:15:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-11-07 01:15:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 7294 transitions. [2019-11-07 01:15:37,037 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 7294 transitions. Word has length 180 [2019-11-07 01:15:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:37,038 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 7294 transitions. [2019-11-07 01:15:37,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 7294 transitions. [2019-11-07 01:15:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-07 01:15:37,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:37,048 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:37,049 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:37,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash -875605821, now seen corresponding path program 1 times [2019-11-07 01:15:37,050 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:37,050 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032220908] [2019-11-07 01:15:37,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-07 01:15:37,228 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032220908] [2019-11-07 01:15:37,228 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354848485] [2019-11-07 01:15:37,228 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-11-07 01:15:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:37,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:15:37,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-07 01:15:37,458 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-07 01:15:37,652 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:15:37,652 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-11-07 01:15:37,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436169549] [2019-11-07 01:15:37,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:37,656 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:15:37,657 INFO L87 Difference]: Start difference. First operand 5909 states and 7294 transitions. Second operand 4 states. [2019-11-07 01:15:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:38,485 INFO L93 Difference]: Finished difference Result 17293 states and 22570 transitions. [2019-11-07 01:15:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:38,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-07 01:15:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:38,550 INFO L225 Difference]: With dead ends: 17293 [2019-11-07 01:15:38,550 INFO L226 Difference]: Without dead ends: 11413 [2019-11-07 01:15:38,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:15:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11413 states. [2019-11-07 01:15:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11413 to 11392. [2019-11-07 01:15:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11392 states. [2019-11-07 01:15:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11392 states to 11392 states and 13807 transitions. [2019-11-07 01:15:39,560 INFO L78 Accepts]: Start accepts. Automaton has 11392 states and 13807 transitions. Word has length 181 [2019-11-07 01:15:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:39,562 INFO L462 AbstractCegarLoop]: Abstraction has 11392 states and 13807 transitions. [2019-11-07 01:15:39,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11392 states and 13807 transitions. [2019-11-07 01:15:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-07 01:15:39,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:39,579 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-07 01:15:39,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:39,784 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1139497071, now seen corresponding path program 1 times [2019-11-07 01:15:39,786 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:39,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917662047] [2019-11-07 01:15:39,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-07 01:15:39,874 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917662047] [2019-11-07 01:15:39,875 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654090603] [2019-11-07 01:15:39,875 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-11-07 01:15:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:40,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:15:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-07 01:15:40,208 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-07 01:15:40,427 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:40,427 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-11-07 01:15:40,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6389794] [2019-11-07 01:15:40,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:40,430 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:40,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:40,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:40,431 INFO L87 Difference]: Start difference. First operand 11392 states and 13807 transitions. Second operand 3 states. [2019-11-07 01:15:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:41,363 INFO L93 Difference]: Finished difference Result 29721 states and 38362 transitions. [2019-11-07 01:15:41,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:41,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-11-07 01:15:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:41,452 INFO L225 Difference]: With dead ends: 29721 [2019-11-07 01:15:41,453 INFO L226 Difference]: Without dead ends: 18362 [2019-11-07 01:15:41,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18362 states. [2019-11-07 01:15:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18362 to 18305. [2019-11-07 01:15:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18305 states. [2019-11-07 01:15:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18305 states to 18305 states and 22604 transitions. [2019-11-07 01:15:43,408 INFO L78 Accepts]: Start accepts. Automaton has 18305 states and 22604 transitions. Word has length 242 [2019-11-07 01:15:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:43,409 INFO L462 AbstractCegarLoop]: Abstraction has 18305 states and 22604 transitions. [2019-11-07 01:15:43,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 18305 states and 22604 transitions. [2019-11-07 01:15:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-07 01:15:43,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:43,531 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-07 01:15:43,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:43,735 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash -65823310, now seen corresponding path program 1 times [2019-11-07 01:15:43,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:43,736 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981191200] [2019-11-07 01:15:43,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-07 01:15:43,829 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981191200] [2019-11-07 01:15:43,830 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885640532] [2019-11-07 01:15:43,830 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-11-07 01:15:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:44,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 01:15:44,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-07 01:15:44,118 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-07 01:15:44,348 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:44,349 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-11-07 01:15:44,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123234594] [2019-11-07 01:15:44,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:44,351 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:44,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:44,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:44,351 INFO L87 Difference]: Start difference. First operand 18305 states and 22604 transitions. Second operand 3 states. [2019-11-07 01:15:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:46,364 INFO L93 Difference]: Finished difference Result 29721 states and 36612 transitions. [2019-11-07 01:15:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:46,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-07 01:15:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:46,449 INFO L225 Difference]: With dead ends: 29721 [2019-11-07 01:15:46,449 INFO L226 Difference]: Without dead ends: 18358 [2019-11-07 01:15:46,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 485 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18358 states. [2019-11-07 01:15:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18358 to 18301. [2019-11-07 01:15:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18301 states. [2019-11-07 01:15:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18301 states to 18301 states and 22132 transitions. [2019-11-07 01:15:48,570 INFO L78 Accepts]: Start accepts. Automaton has 18301 states and 22132 transitions. Word has length 245 [2019-11-07 01:15:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:48,570 INFO L462 AbstractCegarLoop]: Abstraction has 18301 states and 22132 transitions. [2019-11-07 01:15:48,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18301 states and 22132 transitions. [2019-11-07 01:15:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-07 01:15:48,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:48,600 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-07 01:15:48,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:48,807 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 550544530, now seen corresponding path program 1 times [2019-11-07 01:15:48,808 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:48,808 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357047778] [2019-11-07 01:15:48,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-07 01:15:48,945 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357047778] [2019-11-07 01:15:48,945 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288965769] [2019-11-07 01:15:48,945 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-11-07 01:15:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:49,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 01:15:49,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-07 01:15:49,208 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-07 01:15:49,462 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:49,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-11-07 01:15:49,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364179767] [2019-11-07 01:15:49,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:49,463 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:15:49,464 INFO L87 Difference]: Start difference. First operand 18301 states and 22132 transitions. Second operand 4 states. [2019-11-07 01:15:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:52,842 INFO L93 Difference]: Finished difference Result 46982 states and 58485 transitions. [2019-11-07 01:15:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:52,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-11-07 01:15:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:52,976 INFO L225 Difference]: With dead ends: 46982 [2019-11-07 01:15:52,976 INFO L226 Difference]: Without dead ends: 28714