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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:24:02,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:24:02,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:24:02,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:24:02,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:24:02,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:24:02,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:24:02,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:24:02,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:24:02,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:24:02,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:24:02,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:24:02,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:24:02,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:24:02,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:24:02,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:24:02,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:24:02,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:24:02,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:24:02,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:24:02,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:24:02,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:24:02,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:24:02,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:24:02,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:24:02,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:24:02,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:24:02,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:24:02,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:24:02,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:24:02,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:24:02,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:24:02,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:24:02,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:24:02,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:24:02,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:24:02,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:24:02,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:24:02,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:24:02,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:24:02,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:24:02,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:24:02,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:24:02,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:24:02,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:24:02,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:24:02,376 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:24:02,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:24:02,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:24:02,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:24:02,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:24:02,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:24:02,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:24:02,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:24:02,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:24:02,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:24:02,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:24:02,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:24:02,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:24:02,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:24:02,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:24:02,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:24:02,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:24:02,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:02,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:24:02,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:24:02,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:24:02,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:24:02,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:24:02,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:24:02,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:24:02,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:24:02,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:24:02,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:24:02,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:24:02,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:24:02,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:02,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772f18743/d6082af88a3642fa8fc015bd4199923e/FLAGc51ed9512 [2019-10-15 01:24:03,266 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:24:03,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:03,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772f18743/d6082af88a3642fa8fc015bd4199923e/FLAGc51ed9512 [2019-10-15 01:24:03,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772f18743/d6082af88a3642fa8fc015bd4199923e [2019-10-15 01:24:03,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:24:03,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:24:03,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:03,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:24:03,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:24:03,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:03" (1/1) ... [2019-10-15 01:24:03,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbca3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:03, skipping insertion in model container [2019-10-15 01:24:03,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:03" (1/1) ... [2019-10-15 01:24:03,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:24:03,630 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:24:04,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:04,069 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:24:04,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:04,170 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:24:04,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04 WrapperNode [2019-10-15 01:24:04,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:04,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:24:04,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:24:04,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:24:04,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... [2019-10-15 01:24:04,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:24:04,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:24:04,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:24:04,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:24:04,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:04,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:24:04,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:24:04,305 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 01:24:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 01:24:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 01:24:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 01:24:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 01:24:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 01:24:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 01:24:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 01:24:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 01:24:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 01:24:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 01:24:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:04,308 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:04,308 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 01:24:04,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:24:04,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 01:24:04,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:24:04,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:24:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:24:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:24:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:24:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:24:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:24:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 01:24:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 01:24:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 01:24:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 01:24:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 01:24:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 01:24:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:24:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:24:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:24:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:24:05,131 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:24:05,132 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:24:05,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:05 BoogieIcfgContainer [2019-10-15 01:24:05,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:24:05,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:24:05,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:24:05,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:24:05,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:24:03" (1/3) ... [2019-10-15 01:24:05,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b5602d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:05, skipping insertion in model container [2019-10-15 01:24:05,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:04" (2/3) ... [2019-10-15 01:24:05,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b5602d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:05, skipping insertion in model container [2019-10-15 01:24:05,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:05" (3/3) ... [2019-10-15 01:24:05,144 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:05,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:24:05,166 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:24:05,177 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:24:05,214 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:24:05,216 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:24:05,216 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:24:05,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:24:05,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:24:05,217 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:24:05,217 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:24:05,217 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:24:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states. [2019-10-15 01:24:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:24:05,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:05,254 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1914592099, now seen corresponding path program 1 times [2019-10-15 01:24:05,266 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372929697] [2019-10-15 01:24:05,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:05,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372929697] [2019-10-15 01:24:05,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:05,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799874990] [2019-10-15 01:24:05,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:05,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:05,684 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 4 states. [2019-10-15 01:24:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,780 INFO L93 Difference]: Finished difference Result 444 states and 684 transitions. [2019-10-15 01:24:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:05,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-15 01:24:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,797 INFO L225 Difference]: With dead ends: 444 [2019-10-15 01:24:05,798 INFO L226 Difference]: Without dead ends: 229 [2019-10-15 01:24:05,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-15 01:24:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-10-15 01:24:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-15 01:24:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2019-10-15 01:24:05,873 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 65 [2019-10-15 01:24:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,873 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2019-10-15 01:24:05,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2019-10-15 01:24:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:24:05,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,878 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:05,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2098614595, now seen corresponding path program 1 times [2019-10-15 01:24:05,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476858345] [2019-10-15 01:24:05,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:06,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476858345] [2019-10-15 01:24:06,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:06,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831617561] [2019-10-15 01:24:06,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:06,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:06,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:06,120 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 4 states. [2019-10-15 01:24:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,243 INFO L93 Difference]: Finished difference Result 440 states and 626 transitions. [2019-10-15 01:24:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:06,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 01:24:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,252 INFO L225 Difference]: With dead ends: 440 [2019-10-15 01:24:06,253 INFO L226 Difference]: Without dead ends: 233 [2019-10-15 01:24:06,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-15 01:24:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-10-15 01:24:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 01:24:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 322 transitions. [2019-10-15 01:24:06,306 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 322 transitions. Word has length 76 [2019-10-15 01:24:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,306 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-10-15 01:24:06,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 322 transitions. [2019-10-15 01:24:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:24:06,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:06,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1135646998, now seen corresponding path program 1 times [2019-10-15 01:24:06,314 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232701157] [2019-10-15 01:24:06,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:06,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232701157] [2019-10-15 01:24:06,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:06,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235934577] [2019-10-15 01:24:06,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:06,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:06,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:06,494 INFO L87 Difference]: Start difference. First operand 233 states and 322 transitions. Second operand 7 states. [2019-10-15 01:24:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,755 INFO L93 Difference]: Finished difference Result 531 states and 736 transitions. [2019-10-15 01:24:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:07,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:24:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,761 INFO L225 Difference]: With dead ends: 531 [2019-10-15 01:24:07,762 INFO L226 Difference]: Without dead ends: 320 [2019-10-15 01:24:07,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-15 01:24:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-10-15 01:24:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-15 01:24:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2019-10-15 01:24:07,792 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 94 [2019-10-15 01:24:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:07,793 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2019-10-15 01:24:07,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2019-10-15 01:24:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:24:07,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:07,796 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:07,796 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash -376916963, now seen corresponding path program 1 times [2019-10-15 01:24:07,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:07,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143818411] [2019-10-15 01:24:07,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:07,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143818411] [2019-10-15 01:24:07,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:07,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:07,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705916693] [2019-10-15 01:24:07,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:07,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:07,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:07,917 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand 7 states. [2019-10-15 01:24:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:08,976 INFO L93 Difference]: Finished difference Result 537 states and 744 transitions. [2019-10-15 01:24:08,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:08,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:24:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:08,980 INFO L225 Difference]: With dead ends: 537 [2019-10-15 01:24:08,980 INFO L226 Difference]: Without dead ends: 323 [2019-10-15 01:24:08,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-15 01:24:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-10-15 01:24:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-15 01:24:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2019-10-15 01:24:09,004 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 95 [2019-10-15 01:24:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,005 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2019-10-15 01:24:09,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2019-10-15 01:24:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:24:09,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:09,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash 121472215, now seen corresponding path program 1 times [2019-10-15 01:24:09,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810832842] [2019-10-15 01:24:09,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:09,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810832842] [2019-10-15 01:24:09,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:09,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642162560] [2019-10-15 01:24:09,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:09,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:09,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,088 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand 3 states. [2019-10-15 01:24:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:09,134 INFO L93 Difference]: Finished difference Result 764 states and 1063 transitions. [2019-10-15 01:24:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:09,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-15 01:24:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:09,141 INFO L225 Difference]: With dead ends: 764 [2019-10-15 01:24:09,141 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:24:09,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:24:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2019-10-15 01:24:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-15 01:24:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 737 transitions. [2019-10-15 01:24:09,190 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 737 transitions. Word has length 96 [2019-10-15 01:24:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,191 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 737 transitions. [2019-10-15 01:24:09,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 737 transitions. [2019-10-15 01:24:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:09,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:09,194 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1774390923, now seen corresponding path program 1 times [2019-10-15 01:24:09,195 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631361517] [2019-10-15 01:24:09,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:09,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631361517] [2019-10-15 01:24:09,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:09,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045748313] [2019-10-15 01:24:09,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:09,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:09,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,307 INFO L87 Difference]: Start difference. First operand 533 states and 737 transitions. Second operand 3 states. [2019-10-15 01:24:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:09,378 INFO L93 Difference]: Finished difference Result 1266 states and 1792 transitions. [2019-10-15 01:24:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:09,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:24:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:09,387 INFO L225 Difference]: With dead ends: 1266 [2019-10-15 01:24:09,387 INFO L226 Difference]: Without dead ends: 881 [2019-10-15 01:24:09,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-15 01:24:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 875. [2019-10-15 01:24:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-10-15 01:24:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1228 transitions. [2019-10-15 01:24:09,455 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1228 transitions. Word has length 97 [2019-10-15 01:24:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,456 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1228 transitions. [2019-10-15 01:24:09,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1228 transitions. [2019-10-15 01:24:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:09,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:09,459 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1073326345, now seen corresponding path program 1 times [2019-10-15 01:24:09,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112332870] [2019-10-15 01:24:09,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:09,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112332870] [2019-10-15 01:24:09,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:09,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7621578] [2019-10-15 01:24:09,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:09,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:09,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,545 INFO L87 Difference]: Start difference. First operand 875 states and 1228 transitions. Second operand 3 states. [2019-10-15 01:24:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:09,600 INFO L93 Difference]: Finished difference Result 1475 states and 2083 transitions. [2019-10-15 01:24:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:09,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:24:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:09,607 INFO L225 Difference]: With dead ends: 1475 [2019-10-15 01:24:09,607 INFO L226 Difference]: Without dead ends: 716 [2019-10-15 01:24:09,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-15 01:24:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-10-15 01:24:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-10-15 01:24:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 996 transitions. [2019-10-15 01:24:09,668 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 996 transitions. Word has length 97 [2019-10-15 01:24:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,668 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 996 transitions. [2019-10-15 01:24:09,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 996 transitions. [2019-10-15 01:24:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:09,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,671 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:09,671 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1721002108, now seen corresponding path program 1 times [2019-10-15 01:24:09,672 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392888792] [2019-10-15 01:24:09,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:09,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392888792] [2019-10-15 01:24:09,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:09,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632276986] [2019-10-15 01:24:09,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:09,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:09,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:09,780 INFO L87 Difference]: Start difference. First operand 716 states and 996 transitions. Second operand 4 states. [2019-10-15 01:24:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:09,843 INFO L93 Difference]: Finished difference Result 1296 states and 1829 transitions. [2019-10-15 01:24:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:09,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-15 01:24:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:09,848 INFO L225 Difference]: With dead ends: 1296 [2019-10-15 01:24:09,848 INFO L226 Difference]: Without dead ends: 731 [2019-10-15 01:24:09,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-15 01:24:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-15 01:24:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-15 01:24:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1008 transitions. [2019-10-15 01:24:09,897 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1008 transitions. Word has length 97 [2019-10-15 01:24:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,899 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1008 transitions. [2019-10-15 01:24:09,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1008 transitions. [2019-10-15 01:24:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:24:09,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:09,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash 190055260, now seen corresponding path program 1 times [2019-10-15 01:24:09,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226308448] [2019-10-15 01:24:09,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:10,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226308448] [2019-10-15 01:24:10,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999594086] [2019-10-15 01:24:10,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,040 INFO L87 Difference]: Start difference. First operand 731 states and 1008 transitions. Second operand 4 states. [2019-10-15 01:24:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,112 INFO L93 Difference]: Finished difference Result 1326 states and 1862 transitions. [2019-10-15 01:24:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:24:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,117 INFO L225 Difference]: With dead ends: 1326 [2019-10-15 01:24:10,117 INFO L226 Difference]: Without dead ends: 746 [2019-10-15 01:24:10,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-15 01:24:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2019-10-15 01:24:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-15 01:24:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1020 transitions. [2019-10-15 01:24:10,164 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1020 transitions. Word has length 105 [2019-10-15 01:24:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,164 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1020 transitions. [2019-10-15 01:24:10,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1020 transitions. [2019-10-15 01:24:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:24:10,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,167 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,167 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash 338939110, now seen corresponding path program 1 times [2019-10-15 01:24:10,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671800033] [2019-10-15 01:24:10,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:10,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671800033] [2019-10-15 01:24:10,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986950764] [2019-10-15 01:24:10,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,245 INFO L87 Difference]: Start difference. First operand 746 states and 1020 transitions. Second operand 4 states. [2019-10-15 01:24:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,308 INFO L93 Difference]: Finished difference Result 1353 states and 1874 transitions. [2019-10-15 01:24:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:24:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,314 INFO L225 Difference]: With dead ends: 1353 [2019-10-15 01:24:10,314 INFO L226 Difference]: Without dead ends: 758 [2019-10-15 01:24:10,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-15 01:24:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2019-10-15 01:24:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-15 01:24:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1029 transitions. [2019-10-15 01:24:10,373 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1029 transitions. Word has length 113 [2019-10-15 01:24:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,373 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1029 transitions. [2019-10-15 01:24:10,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1029 transitions. [2019-10-15 01:24:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:24:10,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash 462889986, now seen corresponding path program 1 times [2019-10-15 01:24:10,378 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568647802] [2019-10-15 01:24:10,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:10,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568647802] [2019-10-15 01:24:10,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588696305] [2019-10-15 01:24:10,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,484 INFO L87 Difference]: Start difference. First operand 758 states and 1029 transitions. Second operand 4 states. [2019-10-15 01:24:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,581 INFO L93 Difference]: Finished difference Result 1380 states and 1904 transitions. [2019-10-15 01:24:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:24:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,588 INFO L225 Difference]: With dead ends: 1380 [2019-10-15 01:24:10,588 INFO L226 Difference]: Without dead ends: 773 [2019-10-15 01:24:10,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-15 01:24:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2019-10-15 01:24:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-15 01:24:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1041 transitions. [2019-10-15 01:24:10,653 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1041 transitions. Word has length 113 [2019-10-15 01:24:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,654 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1041 transitions. [2019-10-15 01:24:10,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1041 transitions. [2019-10-15 01:24:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:24:10,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,658 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,658 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash 397660294, now seen corresponding path program 1 times [2019-10-15 01:24:10,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505657085] [2019-10-15 01:24:10,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:24:10,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505657085] [2019-10-15 01:24:10,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008108956] [2019-10-15 01:24:10,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,813 INFO L87 Difference]: Start difference. First operand 773 states and 1041 transitions. Second operand 4 states. [2019-10-15 01:24:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,899 INFO L93 Difference]: Finished difference Result 1413 states and 1925 transitions. [2019-10-15 01:24:10,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-15 01:24:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,907 INFO L225 Difference]: With dead ends: 1413 [2019-10-15 01:24:10,907 INFO L226 Difference]: Without dead ends: 791 [2019-10-15 01:24:10,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-15 01:24:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-10-15 01:24:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-15 01:24:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1056 transitions. [2019-10-15 01:24:10,970 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1056 transitions. Word has length 121 [2019-10-15 01:24:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,971 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1056 transitions. [2019-10-15 01:24:10,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1056 transitions. [2019-10-15 01:24:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:24:10,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,975 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1636035475, now seen corresponding path program 1 times [2019-10-15 01:24:10,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636232319] [2019-10-15 01:24:10,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:24:11,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636232319] [2019-10-15 01:24:11,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:11,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:11,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756104102] [2019-10-15 01:24:11,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:11,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:11,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:11,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:11,192 INFO L87 Difference]: Start difference. First operand 791 states and 1056 transitions. Second operand 10 states. [2019-10-15 01:24:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:13,944 INFO L93 Difference]: Finished difference Result 2065 states and 2738 transitions. [2019-10-15 01:24:13,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:13,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-10-15 01:24:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:13,953 INFO L225 Difference]: With dead ends: 2065 [2019-10-15 01:24:13,953 INFO L226 Difference]: Without dead ends: 1416 [2019-10-15 01:24:13,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:24:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-15 01:24:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1323. [2019-10-15 01:24:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-10-15 01:24:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1734 transitions. [2019-10-15 01:24:14,046 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1734 transitions. Word has length 126 [2019-10-15 01:24:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,046 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 1734 transitions. [2019-10-15 01:24:14,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1734 transitions. [2019-10-15 01:24:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:24:14,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,049 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:14,049 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229945, now seen corresponding path program 1 times [2019-10-15 01:24:14,050 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440851459] [2019-10-15 01:24:14,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:24:14,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440851459] [2019-10-15 01:24:14,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:14,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169004227] [2019-10-15 01:24:14,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:14,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:14,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:14,152 INFO L87 Difference]: Start difference. First operand 1323 states and 1734 transitions. Second operand 4 states. [2019-10-15 01:24:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,232 INFO L93 Difference]: Finished difference Result 2404 states and 3173 transitions. [2019-10-15 01:24:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:14,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-15 01:24:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,243 INFO L225 Difference]: With dead ends: 2404 [2019-10-15 01:24:14,243 INFO L226 Difference]: Without dead ends: 1335 [2019-10-15 01:24:14,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-15 01:24:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1329. [2019-10-15 01:24:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-10-15 01:24:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1721 transitions. [2019-10-15 01:24:14,329 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1721 transitions. Word has length 128 [2019-10-15 01:24:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,330 INFO L462 AbstractCegarLoop]: Abstraction has 1329 states and 1721 transitions. [2019-10-15 01:24:14,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1721 transitions. [2019-10-15 01:24:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:24:14,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,335 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:14,335 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash -287290418, now seen corresponding path program 1 times [2019-10-15 01:24:14,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643674674] [2019-10-15 01:24:14,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:24:14,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643674674] [2019-10-15 01:24:14,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:14,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94156540] [2019-10-15 01:24:14,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:14,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:14,487 INFO L87 Difference]: Start difference. First operand 1329 states and 1721 transitions. Second operand 9 states. [2019-10-15 01:24:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:16,417 INFO L93 Difference]: Finished difference Result 2737 states and 3519 transitions. [2019-10-15 01:24:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:24:16,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-15 01:24:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:16,428 INFO L225 Difference]: With dead ends: 2737 [2019-10-15 01:24:16,428 INFO L226 Difference]: Without dead ends: 1713 [2019-10-15 01:24:16,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:24:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2019-10-15 01:24:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1452. [2019-10-15 01:24:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-10-15 01:24:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1855 transitions. [2019-10-15 01:24:16,530 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1855 transitions. Word has length 130 [2019-10-15 01:24:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:16,530 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 1855 transitions. [2019-10-15 01:24:16,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1855 transitions. [2019-10-15 01:24:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:24:16,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:16,533 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:16,534 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash 99662188, now seen corresponding path program 1 times [2019-10-15 01:24:16,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:16,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603813334] [2019-10-15 01:24:16,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:16,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603813334] [2019-10-15 01:24:16,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:16,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:16,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570415720] [2019-10-15 01:24:16,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:16,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:16,711 INFO L87 Difference]: Start difference. First operand 1452 states and 1855 transitions. Second operand 7 states. [2019-10-15 01:24:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:16,815 INFO L93 Difference]: Finished difference Result 1551 states and 1996 transitions. [2019-10-15 01:24:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:24:16,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-15 01:24:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:16,824 INFO L225 Difference]: With dead ends: 1551 [2019-10-15 01:24:16,824 INFO L226 Difference]: Without dead ends: 1549 [2019-10-15 01:24:16,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2019-10-15 01:24:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1473. [2019-10-15 01:24:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-10-15 01:24:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1878 transitions. [2019-10-15 01:24:16,905 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1878 transitions. Word has length 129 [2019-10-15 01:24:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:16,906 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 1878 transitions. [2019-10-15 01:24:16,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1878 transitions. [2019-10-15 01:24:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:24:16,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:16,909 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:16,909 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash -563839625, now seen corresponding path program 1 times [2019-10-15 01:24:16,910 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:16,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528978178] [2019-10-15 01:24:16,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:17,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528978178] [2019-10-15 01:24:17,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:17,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:17,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421549103] [2019-10-15 01:24:17,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:17,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:17,136 INFO L87 Difference]: Start difference. First operand 1473 states and 1878 transitions. Second operand 10 states. [2019-10-15 01:24:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:20,247 INFO L93 Difference]: Finished difference Result 3867 states and 4909 transitions. [2019-10-15 01:24:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:20,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-10-15 01:24:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:20,261 INFO L225 Difference]: With dead ends: 3867 [2019-10-15 01:24:20,261 INFO L226 Difference]: Without dead ends: 2741 [2019-10-15 01:24:20,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:24:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2019-10-15 01:24:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1898. [2019-10-15 01:24:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-10-15 01:24:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2408 transitions. [2019-10-15 01:24:20,452 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2408 transitions. Word has length 134 [2019-10-15 01:24:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:20,453 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2408 transitions. [2019-10-15 01:24:20,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2408 transitions. [2019-10-15 01:24:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:24:20,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:20,456 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:20,457 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1781848955, now seen corresponding path program 1 times [2019-10-15 01:24:20,457 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:20,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137098012] [2019-10-15 01:24:20,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:20,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137098012] [2019-10-15 01:24:20,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:20,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:20,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144133448] [2019-10-15 01:24:20,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:20,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:20,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:20,555 INFO L87 Difference]: Start difference. First operand 1898 states and 2408 transitions. Second operand 5 states. [2019-10-15 01:24:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:20,987 INFO L93 Difference]: Finished difference Result 6566 states and 8442 transitions. [2019-10-15 01:24:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:20,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:24:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:21,016 INFO L225 Difference]: With dead ends: 6566 [2019-10-15 01:24:21,016 INFO L226 Difference]: Without dead ends: 4960 [2019-10-15 01:24:21,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2019-10-15 01:24:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4504. [2019-10-15 01:24:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-10-15 01:24:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 5734 transitions. [2019-10-15 01:24:21,301 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 5734 transitions. Word has length 135 [2019-10-15 01:24:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:21,302 INFO L462 AbstractCegarLoop]: Abstraction has 4504 states and 5734 transitions. [2019-10-15 01:24:21,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 5734 transitions. [2019-10-15 01:24:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:21,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:21,308 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:21,308 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1847941033, now seen corresponding path program 1 times [2019-10-15 01:24:21,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:21,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963133836] [2019-10-15 01:24:21,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:21,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963133836] [2019-10-15 01:24:21,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:21,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:21,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121686517] [2019-10-15 01:24:21,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:21,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:21,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:21,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:21,505 INFO L87 Difference]: Start difference. First operand 4504 states and 5734 transitions. Second operand 4 states. [2019-10-15 01:24:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:21,944 INFO L93 Difference]: Finished difference Result 8456 states and 10801 transitions. [2019-10-15 01:24:21,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:21,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:24:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:21,969 INFO L225 Difference]: With dead ends: 8456 [2019-10-15 01:24:21,970 INFO L226 Difference]: Without dead ends: 4541 [2019-10-15 01:24:21,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2019-10-15 01:24:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4122. [2019-10-15 01:24:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4122 states. [2019-10-15 01:24:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 5249 transitions. [2019-10-15 01:24:22,245 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 5249 transitions. Word has length 139 [2019-10-15 01:24:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:22,249 INFO L462 AbstractCegarLoop]: Abstraction has 4122 states and 5249 transitions. [2019-10-15 01:24:22,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 5249 transitions. [2019-10-15 01:24:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:24:22,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:22,255 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:22,255 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1695535937, now seen corresponding path program 1 times [2019-10-15 01:24:22,256 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:22,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484643290] [2019-10-15 01:24:22,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:22,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:22,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:24:22,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484643290] [2019-10-15 01:24:22,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:22,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:22,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509676798] [2019-10-15 01:24:22,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:22,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:22,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:22,520 INFO L87 Difference]: Start difference. First operand 4122 states and 5249 transitions. Second operand 9 states. [2019-10-15 01:24:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:23,763 INFO L93 Difference]: Finished difference Result 7550 states and 9682 transitions. [2019-10-15 01:24:23,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:24:23,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-15 01:24:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:23,805 INFO L225 Difference]: With dead ends: 7550 [2019-10-15 01:24:23,805 INFO L226 Difference]: Without dead ends: 3839 [2019-10-15 01:24:23,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:24:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2019-10-15 01:24:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3482. [2019-10-15 01:24:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2019-10-15 01:24:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4424 transitions. [2019-10-15 01:24:24,049 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4424 transitions. Word has length 136 [2019-10-15 01:24:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,049 INFO L462 AbstractCegarLoop]: Abstraction has 3482 states and 4424 transitions. [2019-10-15 01:24:24,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4424 transitions. [2019-10-15 01:24:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:24:24,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,052 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:24,052 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1308999803, now seen corresponding path program 1 times [2019-10-15 01:24:24,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408865013] [2019-10-15 01:24:24,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:24:24,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408865013] [2019-10-15 01:24:24,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:24,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321169513] [2019-10-15 01:24:24,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:24,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:24,195 INFO L87 Difference]: Start difference. First operand 3482 states and 4424 transitions. Second operand 9 states. [2019-10-15 01:24:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,649 INFO L93 Difference]: Finished difference Result 7075 states and 9138 transitions. [2019-10-15 01:24:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:24:25,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-15 01:24:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,666 INFO L225 Difference]: With dead ends: 7075 [2019-10-15 01:24:25,666 INFO L226 Difference]: Without dead ends: 3943 [2019-10-15 01:24:25,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:24:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2019-10-15 01:24:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3381. [2019-10-15 01:24:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2019-10-15 01:24:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4295 transitions. [2019-10-15 01:24:25,878 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4295 transitions. Word has length 137 [2019-10-15 01:24:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,879 INFO L462 AbstractCegarLoop]: Abstraction has 3381 states and 4295 transitions. [2019-10-15 01:24:25,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4295 transitions. [2019-10-15 01:24:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:24:25,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,882 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,882 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1491067408, now seen corresponding path program 1 times [2019-10-15 01:24:25,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867726706] [2019-10-15 01:24:25,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:25,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867726706] [2019-10-15 01:24:25,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:25,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672159111] [2019-10-15 01:24:25,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:25,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,962 INFO L87 Difference]: Start difference. First operand 3381 states and 4295 transitions. Second operand 5 states. [2019-10-15 01:24:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,701 INFO L93 Difference]: Finished difference Result 10413 states and 13355 transitions. [2019-10-15 01:24:26,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:26,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-15 01:24:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,732 INFO L225 Difference]: With dead ends: 10413 [2019-10-15 01:24:26,733 INFO L226 Difference]: Without dead ends: 7541 [2019-10-15 01:24:26,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7541 states. [2019-10-15 01:24:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7541 to 5188. [2019-10-15 01:24:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-10-15 01:24:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 6581 transitions. [2019-10-15 01:24:27,062 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 6581 transitions. Word has length 138 [2019-10-15 01:24:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:27,063 INFO L462 AbstractCegarLoop]: Abstraction has 5188 states and 6581 transitions. [2019-10-15 01:24:27,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 6581 transitions. [2019-10-15 01:24:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:24:27,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:27,070 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:27,070 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:27,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1745801643, now seen corresponding path program 1 times [2019-10-15 01:24:27,071 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:27,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463995629] [2019-10-15 01:24:27,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:27,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:27,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:27,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463995629] [2019-10-15 01:24:27,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:27,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:27,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751694919] [2019-10-15 01:24:27,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:27,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:27,148 INFO L87 Difference]: Start difference. First operand 5188 states and 6581 transitions. Second operand 5 states. [2019-10-15 01:24:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:27,710 INFO L93 Difference]: Finished difference Result 12039 states and 15339 transitions. [2019-10-15 01:24:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:27,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-15 01:24:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:27,734 INFO L225 Difference]: With dead ends: 12039 [2019-10-15 01:24:27,735 INFO L226 Difference]: Without dead ends: 7495 [2019-10-15 01:24:27,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7495 states. [2019-10-15 01:24:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7495 to 6951. [2019-10-15 01:24:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6951 states. [2019-10-15 01:24:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6951 states to 6951 states and 8771 transitions. [2019-10-15 01:24:28,134 INFO L78 Accepts]: Start accepts. Automaton has 6951 states and 8771 transitions. Word has length 138 [2019-10-15 01:24:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:28,134 INFO L462 AbstractCegarLoop]: Abstraction has 6951 states and 8771 transitions. [2019-10-15 01:24:28,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6951 states and 8771 transitions. [2019-10-15 01:24:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:28,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:28,138 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:28,139 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1645561488, now seen corresponding path program 1 times [2019-10-15 01:24:28,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:28,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093712225] [2019-10-15 01:24:28,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:28,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:28,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:28,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093712225] [2019-10-15 01:24:28,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:28,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:28,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856230562] [2019-10-15 01:24:28,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:28,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:28,197 INFO L87 Difference]: Start difference. First operand 6951 states and 8771 transitions. Second operand 3 states. [2019-10-15 01:24:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:28,836 INFO L93 Difference]: Finished difference Result 13391 states and 16973 transitions. [2019-10-15 01:24:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:28,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-15 01:24:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:28,861 INFO L225 Difference]: With dead ends: 13391 [2019-10-15 01:24:28,861 INFO L226 Difference]: Without dead ends: 7020 [2019-10-15 01:24:28,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2019-10-15 01:24:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 6957. [2019-10-15 01:24:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-10-15 01:24:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 8777 transitions. [2019-10-15 01:24:29,303 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 8777 transitions. Word has length 139 [2019-10-15 01:24:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:29,303 INFO L462 AbstractCegarLoop]: Abstraction has 6957 states and 8777 transitions. [2019-10-15 01:24:29,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 8777 transitions. [2019-10-15 01:24:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:24:29,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:29,307 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:29,307 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1802829423, now seen corresponding path program 1 times [2019-10-15 01:24:29,308 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:29,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392057147] [2019-10-15 01:24:29,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:29,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:29,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:29,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392057147] [2019-10-15 01:24:29,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:29,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:24:29,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299066249] [2019-10-15 01:24:29,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:24:29,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:24:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:29,608 INFO L87 Difference]: Start difference. First operand 6957 states and 8777 transitions. Second operand 12 states. [2019-10-15 01:24:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:32,773 INFO L93 Difference]: Finished difference Result 14024 states and 17715 transitions. [2019-10-15 01:24:32,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:24:32,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-15 01:24:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:32,797 INFO L225 Difference]: With dead ends: 14024 [2019-10-15 01:24:32,797 INFO L226 Difference]: Without dead ends: 7224 [2019-10-15 01:24:32,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-15 01:24:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-10-15 01:24:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7016. [2019-10-15 01:24:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-10-15 01:24:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8842 transitions. [2019-10-15 01:24:33,347 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8842 transitions. Word has length 140 [2019-10-15 01:24:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:33,348 INFO L462 AbstractCegarLoop]: Abstraction has 7016 states and 8842 transitions. [2019-10-15 01:24:33,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:24:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8842 transitions. [2019-10-15 01:24:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:24:33,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:33,351 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:33,352 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash 551555859, now seen corresponding path program 1 times [2019-10-15 01:24:33,352 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:33,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195420106] [2019-10-15 01:24:33,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:33,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:33,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:33,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195420106] [2019-10-15 01:24:33,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:33,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:24:33,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610423197] [2019-10-15 01:24:33,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:24:33,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:24:33,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:24:33,731 INFO L87 Difference]: Start difference. First operand 7016 states and 8842 transitions. Second operand 14 states.