java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:40:57,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:40:57,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:40:57,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:40:57,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:40:57,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:40:57,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:40:57,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:40:57,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:40:57,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:40:57,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:40:57,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:40:57,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:40:57,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:40:57,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:40:57,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:40:57,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:40:57,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:40:57,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:40:57,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:40:57,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:40:57,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:40:57,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:40:57,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:40:57,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:40:57,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:40:57,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:40:57,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:40:57,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:40:57,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:40:57,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:40:57,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:40:57,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:40:57,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:40:57,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:40:57,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:40:57,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:40:57,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:40:57,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:40:57,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:40:57,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:40:57,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:40:57,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:40:57,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:40:57,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:40:57,225 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:40:57,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:40:57,226 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:40:57,226 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:40:57,227 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:40:57,227 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:40:57,227 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:40:57,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:40:57,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:40:57,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:40:57,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:40:57,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:40:57,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:40:57,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:40:57,229 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:40:57,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:40:57,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:40:57,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:40:57,231 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:40:57,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:40:57,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:40:57,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:40:57,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:40:57,233 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:40:57,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:40:57,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:40:57,233 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:40:57,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:40:57,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:40:57,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:40:57,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:40:57,316 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:40:57,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:40:57,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09763bbfa/5eeef10a561c44ea8e47da523f5741d2/FLAG2966bdda8 [2019-09-10 08:40:58,006 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:40:58,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:40:58,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09763bbfa/5eeef10a561c44ea8e47da523f5741d2/FLAG2966bdda8 [2019-09-10 08:40:58,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09763bbfa/5eeef10a561c44ea8e47da523f5741d2 [2019-09-10 08:40:58,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:40:58,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:40:58,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:40:58,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:40:58,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:40:58,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:40:58" (1/1) ... [2019-09-10 08:40:58,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e21f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:58, skipping insertion in model container [2019-09-10 08:40:58,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:40:58" (1/1) ... [2019-09-10 08:40:58,246 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:40:58,320 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:40:58,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:40:58,873 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:40:59,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:40:59,316 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:40:59,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59 WrapperNode [2019-09-10 08:40:59,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:40:59,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:40:59,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:40:59,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:40:59,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... [2019-09-10 08:40:59,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:40:59,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:40:59,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:40:59,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:40:59,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:40:59,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:40:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:40:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:40:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:40:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:40:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:40:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:40:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:40:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:40:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:40:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:40:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:40:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:40:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:40:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:40:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:40:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:40:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:40:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:41:01,158 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:41:01,159 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:41:01,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:41:01 BoogieIcfgContainer [2019-09-10 08:41:01,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:41:01,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:41:01,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:41:01,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:41:01,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:40:58" (1/3) ... [2019-09-10 08:41:01,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50db5d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:41:01, skipping insertion in model container [2019-09-10 08:41:01,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:40:59" (2/3) ... [2019-09-10 08:41:01,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50db5d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:41:01, skipping insertion in model container [2019-09-10 08:41:01,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:41:01" (3/3) ... [2019-09-10 08:41:01,170 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:41:01,180 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:41:01,189 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:41:01,207 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:41:01,236 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:41:01,236 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:41:01,236 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:41:01,237 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:41:01,237 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:41:01,237 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:41:01,237 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:41:01,238 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:41:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2019-09-10 08:41:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:41:01,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:01,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:01,298 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:01,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -680724110, now seen corresponding path program 1 times [2019-09-10 08:41:01,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:01,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:01,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:02,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:02,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:02,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:02,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:02,217 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 4 states. [2019-09-10 08:41:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:02,433 INFO L93 Difference]: Finished difference Result 670 states and 1166 transitions. [2019-09-10 08:41:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:02,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-10 08:41:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:02,470 INFO L225 Difference]: With dead ends: 670 [2019-09-10 08:41:02,474 INFO L226 Difference]: Without dead ends: 662 [2019-09-10 08:41:02,476 INFO L628 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-09-10 08:41:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-10 08:41:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2019-09-10 08:41:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 08:41:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 961 transitions. [2019-09-10 08:41:02,569 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 961 transitions. Word has length 159 [2019-09-10 08:41:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:02,570 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 961 transitions. [2019-09-10 08:41:02,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 961 transitions. [2019-09-10 08:41:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:41:02,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:02,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:02,578 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1230031220, now seen corresponding path program 1 times [2019-09-10 08:41:02,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:02,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:02,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:02,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:02,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:02,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:02,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:02,701 INFO L87 Difference]: Start difference. First operand 660 states and 961 transitions. Second operand 3 states. [2019-09-10 08:41:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:02,735 INFO L93 Difference]: Finished difference Result 1306 states and 1901 transitions. [2019-09-10 08:41:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:02,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:41:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:02,743 INFO L225 Difference]: With dead ends: 1306 [2019-09-10 08:41:02,744 INFO L226 Difference]: Without dead ends: 1306 [2019-09-10 08:41:02,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-10 08:41:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 662. [2019-09-10 08:41:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-10 08:41:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 963 transitions. [2019-09-10 08:41:02,798 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 963 transitions. Word has length 160 [2019-09-10 08:41:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:02,800 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 963 transitions. [2019-09-10 08:41:02,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 963 transitions. [2019-09-10 08:41:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:41:02,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:02,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:02,806 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 230722581, now seen corresponding path program 1 times [2019-09-10 08:41:02,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:02,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:02,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:02,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:03,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:03,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:03,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:03,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:03,040 INFO L87 Difference]: Start difference. First operand 662 states and 963 transitions. Second operand 3 states. [2019-09-10 08:41:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:03,111 INFO L93 Difference]: Finished difference Result 1274 states and 1836 transitions. [2019-09-10 08:41:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:03,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:41:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:03,120 INFO L225 Difference]: With dead ends: 1274 [2019-09-10 08:41:03,121 INFO L226 Difference]: Without dead ends: 1274 [2019-09-10 08:41:03,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-10 08:41:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-10 08:41:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-10 08:41:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1835 transitions. [2019-09-10 08:41:03,156 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1835 transitions. Word has length 161 [2019-09-10 08:41:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:03,156 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1835 transitions. [2019-09-10 08:41:03,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1835 transitions. [2019-09-10 08:41:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:41:03,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:03,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:03,160 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1877064936, now seen corresponding path program 1 times [2019-09-10 08:41:03,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:03,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:03,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:03,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:03,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:03,407 INFO L87 Difference]: Start difference. First operand 1272 states and 1835 transitions. Second operand 4 states. [2019-09-10 08:41:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:03,447 INFO L93 Difference]: Finished difference Result 1033 states and 1485 transitions. [2019-09-10 08:41:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:03,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 08:41:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:03,455 INFO L225 Difference]: With dead ends: 1033 [2019-09-10 08:41:03,455 INFO L226 Difference]: Without dead ends: 973 [2019-09-10 08:41:03,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-10 08:41:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2019-09-10 08:41:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-10 08:41:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1399 transitions. [2019-09-10 08:41:03,482 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1399 transitions. Word has length 161 [2019-09-10 08:41:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:03,482 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1399 transitions. [2019-09-10 08:41:03,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1399 transitions. [2019-09-10 08:41:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:41:03,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:03,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:03,486 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash 916510918, now seen corresponding path program 1 times [2019-09-10 08:41:03,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:03,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:03,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:03,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:03,624 INFO L87 Difference]: Start difference. First operand 973 states and 1399 transitions. Second operand 3 states. [2019-09-10 08:41:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:03,690 INFO L93 Difference]: Finished difference Result 1359 states and 1991 transitions. [2019-09-10 08:41:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:03,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 08:41:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:03,698 INFO L225 Difference]: With dead ends: 1359 [2019-09-10 08:41:03,699 INFO L226 Difference]: Without dead ends: 1359 [2019-09-10 08:41:03,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-09-10 08:41:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1194. [2019-09-10 08:41:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-09-10 08:41:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1757 transitions. [2019-09-10 08:41:03,735 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1757 transitions. Word has length 163 [2019-09-10 08:41:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:03,735 INFO L475 AbstractCegarLoop]: Abstraction has 1194 states and 1757 transitions. [2019-09-10 08:41:03,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1757 transitions. [2019-09-10 08:41:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:41:03,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:03,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:03,740 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash -575678253, now seen corresponding path program 1 times [2019-09-10 08:41:03,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:03,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:03,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:03,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:03,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:03,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:03,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:03,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:03,899 INFO L87 Difference]: Start difference. First operand 1194 states and 1757 transitions. Second operand 3 states. [2019-09-10 08:41:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:03,987 INFO L93 Difference]: Finished difference Result 1742 states and 2610 transitions. [2019-09-10 08:41:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:03,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 08:41:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:04,002 INFO L225 Difference]: With dead ends: 1742 [2019-09-10 08:41:04,003 INFO L226 Difference]: Without dead ends: 1742 [2019-09-10 08:41:04,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-10 08:41:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1583. [2019-09-10 08:41:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2019-09-10 08:41:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2386 transitions. [2019-09-10 08:41:04,074 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2386 transitions. Word has length 165 [2019-09-10 08:41:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:04,075 INFO L475 AbstractCegarLoop]: Abstraction has 1583 states and 2386 transitions. [2019-09-10 08:41:04,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2386 transitions. [2019-09-10 08:41:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:41:04,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:04,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:04,085 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash 866582975, now seen corresponding path program 1 times [2019-09-10 08:41:04,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:04,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:04,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:04,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:04,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:04,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:04,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:04,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:04,330 INFO L87 Difference]: Start difference. First operand 1583 states and 2386 transitions. Second operand 4 states. [2019-09-10 08:41:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:04,524 INFO L93 Difference]: Finished difference Result 2810 states and 4293 transitions. [2019-09-10 08:41:04,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:04,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 08:41:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:04,540 INFO L225 Difference]: With dead ends: 2810 [2019-09-10 08:41:04,540 INFO L226 Difference]: Without dead ends: 2810 [2019-09-10 08:41:04,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-09-10 08:41:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2019-09-10 08:41:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-10 08:41:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4292 transitions. [2019-09-10 08:41:04,627 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4292 transitions. Word has length 166 [2019-09-10 08:41:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:04,628 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 4292 transitions. [2019-09-10 08:41:04,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4292 transitions. [2019-09-10 08:41:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:41:04,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:04,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:04,633 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:04,633 INFO L82 PathProgramCache]: Analyzing trace with hash 604906342, now seen corresponding path program 1 times [2019-09-10 08:41:04,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:04,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:04,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:04,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:04,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:41:04,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:04,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:41:04,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:41:04,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:04,837 INFO L87 Difference]: Start difference. First operand 2808 states and 4292 transitions. Second operand 5 states. [2019-09-10 08:41:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:05,184 INFO L93 Difference]: Finished difference Result 6438 states and 10135 transitions. [2019-09-10 08:41:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:05,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-10 08:41:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:05,230 INFO L225 Difference]: With dead ends: 6438 [2019-09-10 08:41:05,230 INFO L226 Difference]: Without dead ends: 6438 [2019-09-10 08:41:05,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6438 states. [2019-09-10 08:41:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6438 to 4696. [2019-09-10 08:41:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-09-10 08:41:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 7288 transitions. [2019-09-10 08:41:05,543 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 7288 transitions. Word has length 166 [2019-09-10 08:41:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:05,544 INFO L475 AbstractCegarLoop]: Abstraction has 4696 states and 7288 transitions. [2019-09-10 08:41:05,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:41:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 7288 transitions. [2019-09-10 08:41:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:41:05,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:05,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:05,553 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:05,553 INFO L82 PathProgramCache]: Analyzing trace with hash 407053155, now seen corresponding path program 1 times [2019-09-10 08:41:05,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:05,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:05,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:05,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:05,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:05,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:05,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:05,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:05,729 INFO L87 Difference]: Start difference. First operand 4696 states and 7288 transitions. Second operand 3 states. [2019-09-10 08:41:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:05,873 INFO L93 Difference]: Finished difference Result 8075 states and 12554 transitions. [2019-09-10 08:41:05,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:05,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:41:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:05,945 INFO L225 Difference]: With dead ends: 8075 [2019-09-10 08:41:05,945 INFO L226 Difference]: Without dead ends: 8075 [2019-09-10 08:41:05,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2019-09-10 08:41:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2019-09-10 08:41:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8073 states. [2019-09-10 08:41:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 12553 transitions. [2019-09-10 08:41:06,167 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 12553 transitions. Word has length 166 [2019-09-10 08:41:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:06,167 INFO L475 AbstractCegarLoop]: Abstraction has 8073 states and 12553 transitions. [2019-09-10 08:41:06,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 12553 transitions. [2019-09-10 08:41:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:41:06,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:06,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:06,174 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash -481927627, now seen corresponding path program 1 times [2019-09-10 08:41:06,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:06,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:06,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:06,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:06,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:06,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:06,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:06,331 INFO L87 Difference]: Start difference. First operand 8073 states and 12553 transitions. Second operand 3 states. [2019-09-10 08:41:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:06,588 INFO L93 Difference]: Finished difference Result 15312 states and 23940 transitions. [2019-09-10 08:41:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:06,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:41:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:06,633 INFO L225 Difference]: With dead ends: 15312 [2019-09-10 08:41:06,633 INFO L226 Difference]: Without dead ends: 15312 [2019-09-10 08:41:06,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15312 states. [2019-09-10 08:41:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15312 to 15310. [2019-09-10 08:41:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15310 states. [2019-09-10 08:41:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15310 states to 15310 states and 23939 transitions. [2019-09-10 08:41:06,966 INFO L78 Accepts]: Start accepts. Automaton has 15310 states and 23939 transitions. Word has length 166 [2019-09-10 08:41:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:06,966 INFO L475 AbstractCegarLoop]: Abstraction has 15310 states and 23939 transitions. [2019-09-10 08:41:06,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 15310 states and 23939 transitions. [2019-09-10 08:41:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:41:06,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:06,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:06,977 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1103659511, now seen corresponding path program 1 times [2019-09-10 08:41:06,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:06,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:06,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:07,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:07,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:07,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:07,183 INFO L87 Difference]: Start difference. First operand 15310 states and 23939 transitions. Second operand 4 states. [2019-09-10 08:41:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:07,520 INFO L93 Difference]: Finished difference Result 24971 states and 38684 transitions. [2019-09-10 08:41:07,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:07,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 08:41:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:07,589 INFO L225 Difference]: With dead ends: 24971 [2019-09-10 08:41:07,589 INFO L226 Difference]: Without dead ends: 24971 [2019-09-10 08:41:07,590 INFO L628 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-09-10 08:41:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24971 states. [2019-09-10 08:41:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24971 to 24969. [2019-09-10 08:41:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24969 states. [2019-09-10 08:41:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24969 states to 24969 states and 38683 transitions. [2019-09-10 08:41:08,142 INFO L78 Accepts]: Start accepts. Automaton has 24969 states and 38683 transitions. Word has length 166 [2019-09-10 08:41:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:08,143 INFO L475 AbstractCegarLoop]: Abstraction has 24969 states and 38683 transitions. [2019-09-10 08:41:08,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24969 states and 38683 transitions. [2019-09-10 08:41:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:41:08,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:08,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:08,156 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1600496136, now seen corresponding path program 1 times [2019-09-10 08:41:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:08,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:08,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:08,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:08,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:08,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:08,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:08,963 INFO L87 Difference]: Start difference. First operand 24969 states and 38683 transitions. Second operand 3 states. [2019-09-10 08:41:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:09,129 INFO L93 Difference]: Finished difference Result 43074 states and 65960 transitions. [2019-09-10 08:41:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:09,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:41:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:09,236 INFO L225 Difference]: With dead ends: 43074 [2019-09-10 08:41:09,236 INFO L226 Difference]: Without dead ends: 43074 [2019-09-10 08:41:09,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43074 states. [2019-09-10 08:41:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43074 to 43072. [2019-09-10 08:41:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43072 states. [2019-09-10 08:41:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43072 states to 43072 states and 65959 transitions. [2019-09-10 08:41:10,175 INFO L78 Accepts]: Start accepts. Automaton has 43072 states and 65959 transitions. Word has length 168 [2019-09-10 08:41:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:10,176 INFO L475 AbstractCegarLoop]: Abstraction has 43072 states and 65959 transitions. [2019-09-10 08:41:10,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43072 states and 65959 transitions. [2019-09-10 08:41:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:41:10,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:10,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:10,202 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1549111509, now seen corresponding path program 1 times [2019-09-10 08:41:10,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:10,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:10,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:10,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:10,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:10,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:10,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:10,415 INFO L87 Difference]: Start difference. First operand 43072 states and 65959 transitions. Second operand 4 states. [2019-09-10 08:41:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:10,548 INFO L93 Difference]: Finished difference Result 39054 states and 59778 transitions. [2019-09-10 08:41:10,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:10,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-10 08:41:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:10,612 INFO L225 Difference]: With dead ends: 39054 [2019-09-10 08:41:10,612 INFO L226 Difference]: Without dead ends: 39006 [2019-09-10 08:41:10,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39006 states. [2019-09-10 08:41:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39006 to 39006. [2019-09-10 08:41:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39006 states. [2019-09-10 08:41:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39006 states to 39006 states and 59715 transitions. [2019-09-10 08:41:11,471 INFO L78 Accepts]: Start accepts. Automaton has 39006 states and 59715 transitions. Word has length 168 [2019-09-10 08:41:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:11,472 INFO L475 AbstractCegarLoop]: Abstraction has 39006 states and 59715 transitions. [2019-09-10 08:41:11,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 39006 states and 59715 transitions. [2019-09-10 08:41:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:41:11,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:11,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:11,492 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1641209572, now seen corresponding path program 1 times [2019-09-10 08:41:11,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:11,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:11,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:11,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:11,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:11,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:11,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:11,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:11,587 INFO L87 Difference]: Start difference. First operand 39006 states and 59715 transitions. Second operand 3 states. [2019-09-10 08:41:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:11,843 INFO L93 Difference]: Finished difference Result 68780 states and 105851 transitions. [2019-09-10 08:41:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:11,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:41:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:11,961 INFO L225 Difference]: With dead ends: 68780 [2019-09-10 08:41:11,961 INFO L226 Difference]: Without dead ends: 68780 [2019-09-10 08:41:11,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68780 states. [2019-09-10 08:41:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68780 to 63162. [2019-09-10 08:41:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63162 states. [2019-09-10 08:41:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63162 states to 63162 states and 98050 transitions. [2019-09-10 08:41:13,998 INFO L78 Accepts]: Start accepts. Automaton has 63162 states and 98050 transitions. Word has length 172 [2019-09-10 08:41:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:13,998 INFO L475 AbstractCegarLoop]: Abstraction has 63162 states and 98050 transitions. [2019-09-10 08:41:13,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 63162 states and 98050 transitions. [2019-09-10 08:41:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:41:14,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:14,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:14,017 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1028468433, now seen corresponding path program 1 times [2019-09-10 08:41:14,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:14,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:14,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:14,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:14,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:14,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:14,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:14,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:14,102 INFO L87 Difference]: Start difference. First operand 63162 states and 98050 transitions. Second operand 3 states. [2019-09-10 08:41:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:15,085 INFO L93 Difference]: Finished difference Result 124447 states and 192485 transitions. [2019-09-10 08:41:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:15,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:41:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:15,301 INFO L225 Difference]: With dead ends: 124447 [2019-09-10 08:41:15,302 INFO L226 Difference]: Without dead ends: 124447 [2019-09-10 08:41:15,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124447 states. [2019-09-10 08:41:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124447 to 124445. [2019-09-10 08:41:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124445 states. [2019-09-10 08:41:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124445 states to 124445 states and 192484 transitions. [2019-09-10 08:41:17,047 INFO L78 Accepts]: Start accepts. Automaton has 124445 states and 192484 transitions. Word has length 173 [2019-09-10 08:41:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:17,047 INFO L475 AbstractCegarLoop]: Abstraction has 124445 states and 192484 transitions. [2019-09-10 08:41:17,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 124445 states and 192484 transitions. [2019-09-10 08:41:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:41:17,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:17,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:17,079 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1862933814, now seen corresponding path program 1 times [2019-09-10 08:41:17,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:17,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:17,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:17,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:17,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:17,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:17,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:17,214 INFO L87 Difference]: Start difference. First operand 124445 states and 192484 transitions. Second operand 3 states. [2019-09-10 08:41:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:19,904 INFO L93 Difference]: Finished difference Result 176383 states and 269109 transitions. [2019-09-10 08:41:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:19,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:41:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:20,165 INFO L225 Difference]: With dead ends: 176383 [2019-09-10 08:41:20,166 INFO L226 Difference]: Without dead ends: 176383 [2019-09-10 08:41:20,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176383 states. [2019-09-10 08:41:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176383 to 175741. [2019-09-10 08:41:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175741 states. [2019-09-10 08:41:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175741 states to 175741 states and 268468 transitions. [2019-09-10 08:41:21,941 INFO L78 Accepts]: Start accepts. Automaton has 175741 states and 268468 transitions. Word has length 173 [2019-09-10 08:41:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:21,942 INFO L475 AbstractCegarLoop]: Abstraction has 175741 states and 268468 transitions. [2019-09-10 08:41:21,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 175741 states and 268468 transitions. [2019-09-10 08:41:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:41:21,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:21,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:21,960 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1681094410, now seen corresponding path program 1 times [2019-09-10 08:41:21,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:21,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:21,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:21,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:22,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:22,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:22,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:22,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:22,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:22,191 INFO L87 Difference]: Start difference. First operand 175741 states and 268468 transitions. Second operand 9 states. [2019-09-10 08:41:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:25,354 INFO L93 Difference]: Finished difference Result 730224 states and 1096611 transitions. [2019-09-10 08:41:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:41:25,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-09-10 08:41:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:32,506 INFO L225 Difference]: With dead ends: 730224 [2019-09-10 08:41:32,507 INFO L226 Difference]: Without dead ends: 730224 [2019-09-10 08:41:32,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:41:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730224 states. [2019-09-10 08:41:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730224 to 411304. [2019-09-10 08:41:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411304 states. [2019-09-10 08:41:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411304 states to 411304 states and 622305 transitions. [2019-09-10 08:41:42,605 INFO L78 Accepts]: Start accepts. Automaton has 411304 states and 622305 transitions. Word has length 173 [2019-09-10 08:41:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:42,606 INFO L475 AbstractCegarLoop]: Abstraction has 411304 states and 622305 transitions. [2019-09-10 08:41:42,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 411304 states and 622305 transitions. [2019-09-10 08:41:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:41:42,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:42,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:42,627 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:42,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash 23432477, now seen corresponding path program 1 times [2019-09-10 08:41:42,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:42,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:42,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:42,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:42,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:47,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:47,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:47,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:47,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:47,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:47,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:47,682 INFO L87 Difference]: Start difference. First operand 411304 states and 622305 transitions. Second operand 4 states. [2019-09-10 08:41:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:48,446 INFO L93 Difference]: Finished difference Result 265682 states and 399746 transitions. [2019-09-10 08:41:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:48,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:41:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:48,776 INFO L225 Difference]: With dead ends: 265682 [2019-09-10 08:41:48,776 INFO L226 Difference]: Without dead ends: 265682 [2019-09-10 08:41:48,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265682 states. [2019-09-10 08:41:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265682 to 265680. [2019-09-10 08:41:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265680 states. [2019-09-10 08:41:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265680 states to 265680 states and 399745 transitions. [2019-09-10 08:41:52,996 INFO L78 Accepts]: Start accepts. Automaton has 265680 states and 399745 transitions. Word has length 173 [2019-09-10 08:41:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:52,997 INFO L475 AbstractCegarLoop]: Abstraction has 265680 states and 399745 transitions. [2019-09-10 08:41:52,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 265680 states and 399745 transitions. [2019-09-10 08:41:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:41:53,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:53,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:53,012 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -174420710, now seen corresponding path program 1 times [2019-09-10 08:41:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:53,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:53,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:53,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:41:53,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:53,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:41:53,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:41:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:41:53,196 INFO L87 Difference]: Start difference. First operand 265680 states and 399745 transitions. Second operand 6 states. [2019-09-10 08:41:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:55,276 INFO L93 Difference]: Finished difference Result 459162 states and 692792 transitions. [2019-09-10 08:41:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:55,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-09-10 08:41:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:55,988 INFO L225 Difference]: With dead ends: 459162 [2019-09-10 08:41:55,988 INFO L226 Difference]: Without dead ends: 459162 [2019-09-10 08:41:55,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:41:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459162 states. [2019-09-10 08:42:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459162 to 398160. [2019-09-10 08:42:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398160 states. [2019-09-10 08:42:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398160 states to 398160 states and 600739 transitions. [2019-09-10 08:42:06,435 INFO L78 Accepts]: Start accepts. Automaton has 398160 states and 600739 transitions. Word has length 173 [2019-09-10 08:42:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:06,435 INFO L475 AbstractCegarLoop]: Abstraction has 398160 states and 600739 transitions. [2019-09-10 08:42:06,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:42:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 398160 states and 600739 transitions. [2019-09-10 08:42:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:42:06,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:06,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:06,453 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash -420368598, now seen corresponding path program 1 times [2019-09-10 08:42:06,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:06,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:06,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:06,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:06,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:06,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:06,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:42:06,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:06,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:42:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:42:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:42:06,614 INFO L87 Difference]: Start difference. First operand 398160 states and 600739 transitions. Second operand 4 states. [2019-09-10 08:42:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:14,945 INFO L93 Difference]: Finished difference Result 707520 states and 1052876 transitions. [2019-09-10 08:42:14,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:42:14,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:42:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:16,073 INFO L225 Difference]: With dead ends: 707520 [2019-09-10 08:42:16,073 INFO L226 Difference]: Without dead ends: 707520 [2019-09-10 08:42:16,073 INFO L628 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-09-10 08:42:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707520 states. [2019-09-10 08:42:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707520 to 707518. [2019-09-10 08:42:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707518 states. [2019-09-10 08:42:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707518 states to 707518 states and 1052875 transitions. [2019-09-10 08:42:35,861 INFO L78 Accepts]: Start accepts. Automaton has 707518 states and 1052875 transitions. Word has length 173 [2019-09-10 08:42:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:35,862 INFO L475 AbstractCegarLoop]: Abstraction has 707518 states and 1052875 transitions. [2019-09-10 08:42:35,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:42:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 707518 states and 1052875 transitions. [2019-09-10 08:42:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:42:35,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:35,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:35,897 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1327227970, now seen corresponding path program 1 times [2019-09-10 08:42:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:35,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:35,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:35,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:35,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:35,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:35,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:35,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:35,960 INFO L87 Difference]: Start difference. First operand 707518 states and 1052875 transitions. Second operand 3 states. [2019-09-10 08:42:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:53,409 INFO L93 Difference]: Finished difference Result 1414942 states and 2105629 transitions. [2019-09-10 08:42:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:53,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 08:42:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:55,516 INFO L225 Difference]: With dead ends: 1414942 [2019-09-10 08:42:55,516 INFO L226 Difference]: Without dead ends: 1414942 [2019-09-10 08:42:55,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414942 states. [2019-09-10 08:43:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414942 to 707524. [2019-09-10 08:43:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707524 states. [2019-09-10 08:43:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707524 states to 707524 states and 1052881 transitions. [2019-09-10 08:43:26,217 INFO L78 Accepts]: Start accepts. Automaton has 707524 states and 1052881 transitions. Word has length 174 [2019-09-10 08:43:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:26,218 INFO L475 AbstractCegarLoop]: Abstraction has 707524 states and 1052881 transitions. [2019-09-10 08:43:26,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 707524 states and 1052881 transitions. [2019-09-10 08:43:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:43:26,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:26,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:26,253 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2059264649, now seen corresponding path program 1 times [2019-09-10 08:43:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:26,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:26,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:26,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:26,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:26,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:26,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:26,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:26,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:26,390 INFO L87 Difference]: Start difference. First operand 707524 states and 1052881 transitions. Second operand 4 states. [2019-09-10 08:43:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:29,966 INFO L93 Difference]: Finished difference Result 707676 states and 1053050 transitions. [2019-09-10 08:43:29,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:29,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:43:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:31,089 INFO L225 Difference]: With dead ends: 707676 [2019-09-10 08:43:31,089 INFO L226 Difference]: Without dead ends: 707524 [2019-09-10 08:43:31,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707524 states. [2019-09-10 08:43:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707524 to 707521. [2019-09-10 08:43:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707521 states. [2019-09-10 08:43:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707521 states to 707521 states and 1052874 transitions. [2019-09-10 08:43:49,478 INFO L78 Accepts]: Start accepts. Automaton has 707521 states and 1052874 transitions. Word has length 175 [2019-09-10 08:43:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:49,478 INFO L475 AbstractCegarLoop]: Abstraction has 707521 states and 1052874 transitions. [2019-09-10 08:43:49,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 707521 states and 1052874 transitions. [2019-09-10 08:43:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:43:49,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:49,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:49,501 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1914429036, now seen corresponding path program 1 times [2019-09-10 08:43:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:49,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:49,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:49,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:49,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:49,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:49,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:49,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:49,637 INFO L87 Difference]: Start difference. First operand 707521 states and 1052874 transitions. Second operand 4 states. [2019-09-10 08:44:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:00,198 INFO L93 Difference]: Finished difference Result 707702 states and 1053080 transitions. [2019-09-10 08:44:00,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:00,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:44:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:01,410 INFO L225 Difference]: With dead ends: 707702 [2019-09-10 08:44:01,410 INFO L226 Difference]: Without dead ends: 707515 [2019-09-10 08:44:01,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707515 states. [2019-09-10 08:44:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707515 to 707515. [2019-09-10 08:44:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707515 states. [2019-09-10 08:44:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707515 states to 707515 states and 1052862 transitions. [2019-09-10 08:44:22,886 INFO L78 Accepts]: Start accepts. Automaton has 707515 states and 1052862 transitions. Word has length 175 [2019-09-10 08:44:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:22,886 INFO L475 AbstractCegarLoop]: Abstraction has 707515 states and 1052862 transitions. [2019-09-10 08:44:22,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 707515 states and 1052862 transitions. [2019-09-10 08:44:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:44:22,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:22,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:22,911 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1166593833, now seen corresponding path program 1 times [2019-09-10 08:44:22,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:22,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:23,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:23,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:23,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:23,011 INFO L87 Difference]: Start difference. First operand 707515 states and 1052862 transitions. Second operand 3 states. [2019-09-10 08:44:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:33,568 INFO L93 Difference]: Finished difference Result 1030802 states and 1514290 transitions. [2019-09-10 08:44:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:33,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 08:44:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:36,284 INFO L225 Difference]: With dead ends: 1030802 [2019-09-10 08:44:36,284 INFO L226 Difference]: Without dead ends: 1030802 [2019-09-10 08:44:36,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:36,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030802 states. [2019-09-10 08:44:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030802 to 1030800. [2019-09-10 08:44:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030800 states. [2019-09-10 08:44:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030800 states to 1030800 states and 1514289 transitions. [2019-09-10 08:44:58,578 INFO L78 Accepts]: Start accepts. Automaton has 1030800 states and 1514289 transitions. Word has length 175 [2019-09-10 08:44:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:58,579 INFO L475 AbstractCegarLoop]: Abstraction has 1030800 states and 1514289 transitions. [2019-09-10 08:44:58,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1030800 states and 1514289 transitions. [2019-09-10 08:44:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:44:58,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:58,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:58,619 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -425393913, now seen corresponding path program 1 times [2019-09-10 08:44:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:58,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:58,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:58,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:58,738 INFO L87 Difference]: Start difference. First operand 1030800 states and 1514289 transitions. Second operand 4 states. [2019-09-10 08:45:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:13,282 INFO L93 Difference]: Finished difference Result 1500480 states and 2206331 transitions. [2019-09-10 08:45:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:13,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-10 08:45:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:17,601 INFO L225 Difference]: With dead ends: 1500480 [2019-09-10 08:45:17,601 INFO L226 Difference]: Without dead ends: 1500480 [2019-09-10 08:45:17,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500480 states. [2019-09-10 08:45:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500480 to 1030538. [2019-09-10 08:45:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030538 states. [2019-09-10 08:46:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030538 states to 1030538 states and 1513650 transitions. [2019-09-10 08:46:03,560 INFO L78 Accepts]: Start accepts. Automaton has 1030538 states and 1513650 transitions. Word has length 180 [2019-09-10 08:46:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:03,560 INFO L475 AbstractCegarLoop]: Abstraction has 1030538 states and 1513650 transitions. [2019-09-10 08:46:03,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1030538 states and 1513650 transitions. [2019-09-10 08:46:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:03,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:03,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:03,594 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1892388804, now seen corresponding path program 1 times [2019-09-10 08:46:03,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:03,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:03,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:46:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:03,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:46:03,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:03,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:46:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:46:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:46:03,811 INFO L87 Difference]: Start difference. First operand 1030538 states and 1513650 transitions. Second operand 8 states. [2019-09-10 08:46:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:22,325 INFO L93 Difference]: Finished difference Result 2171094 states and 3142990 transitions. [2019-09-10 08:46:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:46:22,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2019-09-10 08:46:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:26,509 INFO L225 Difference]: With dead ends: 2171094 [2019-09-10 08:46:26,510 INFO L226 Difference]: Without dead ends: 2171094 [2019-09-10 08:46:26,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:46:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171094 states. [2019-09-10 08:46:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171094 to 619545. [2019-09-10 08:46:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619545 states. [2019-09-10 08:46:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619545 states to 619545 states and 907935 transitions. [2019-09-10 08:46:46,027 INFO L78 Accepts]: Start accepts. Automaton has 619545 states and 907935 transitions. Word has length 180 [2019-09-10 08:46:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:46,028 INFO L475 AbstractCegarLoop]: Abstraction has 619545 states and 907935 transitions. [2019-09-10 08:46:46,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:46:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 619545 states and 907935 transitions. [2019-09-10 08:46:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:46,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:46,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:46,050 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash -221768406, now seen corresponding path program 1 times [2019-09-10 08:46:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:46,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:46,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:46,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:46,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:46:46,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:46,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:46,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:46,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:46,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:46,238 INFO L87 Difference]: Start difference. First operand 619545 states and 907935 transitions. Second operand 4 states. [2019-09-10 08:46:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:49,975 INFO L93 Difference]: Finished difference Result 578035 states and 846784 transitions. [2019-09-10 08:46:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:49,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-10 08:46:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:50,924 INFO L225 Difference]: With dead ends: 578035 [2019-09-10 08:46:50,924 INFO L226 Difference]: Without dead ends: 578035 [2019-09-10 08:46:50,924 INFO L628 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-09-10 08:46:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578035 states. [2019-09-10 08:47:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578035 to 577993. [2019-09-10 08:47:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577993 states. [2019-09-10 08:47:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577993 states to 577993 states and 846735 transitions. [2019-09-10 08:47:07,944 INFO L78 Accepts]: Start accepts. Automaton has 577993 states and 846735 transitions. Word has length 180 [2019-09-10 08:47:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:07,945 INFO L475 AbstractCegarLoop]: Abstraction has 577993 states and 846735 transitions. [2019-09-10 08:47:07,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 577993 states and 846735 transitions. [2019-09-10 08:47:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:07,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:07,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:07,964 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash 990094056, now seen corresponding path program 1 times [2019-09-10 08:47:07,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:07,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:07,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:09,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:09,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:09,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:09,530 INFO L87 Difference]: Start difference. First operand 577993 states and 846735 transitions. Second operand 4 states. [2019-09-10 08:47:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:11,071 INFO L93 Difference]: Finished difference Result 578157 states and 846915 transitions. [2019-09-10 08:47:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:11,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:47:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:20,147 INFO L225 Difference]: With dead ends: 578157 [2019-09-10 08:47:20,148 INFO L226 Difference]: Without dead ends: 578157 [2019-09-10 08:47:20,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578157 states. [2019-09-10 08:47:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578157 to 578095. [2019-09-10 08:47:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578095 states. [2019-09-10 08:47:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578095 states to 578095 states and 846838 transitions. [2019-09-10 08:47:27,541 INFO L78 Accepts]: Start accepts. Automaton has 578095 states and 846838 transitions. Word has length 182 [2019-09-10 08:47:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:27,541 INFO L475 AbstractCegarLoop]: Abstraction has 578095 states and 846838 transitions. [2019-09-10 08:47:27,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 578095 states and 846838 transitions. [2019-09-10 08:47:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:47:27,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:27,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:27,562 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash -599847148, now seen corresponding path program 1 times [2019-09-10 08:47:27,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:27,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:27,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:27,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:27,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:27,620 INFO L87 Difference]: Start difference. First operand 578095 states and 846838 transitions. Second operand 3 states. [2019-09-10 08:47:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:42,232 INFO L93 Difference]: Finished difference Result 1155979 states and 1693427 transitions. [2019-09-10 08:47:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:42,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 08:47:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:44,101 INFO L225 Difference]: With dead ends: 1155979 [2019-09-10 08:47:44,101 INFO L226 Difference]: Without dead ends: 1155979 [2019-09-10 08:47:44,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155979 states. [2019-09-10 08:47:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155979 to 578105. [2019-09-10 08:47:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578105 states. [2019-09-10 08:47:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578105 states to 578105 states and 846848 transitions. [2019-09-10 08:47:56,421 INFO L78 Accepts]: Start accepts. Automaton has 578105 states and 846848 transitions. Word has length 183 [2019-09-10 08:47:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:56,421 INFO L475 AbstractCegarLoop]: Abstraction has 578105 states and 846848 transitions. [2019-09-10 08:47:56,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 578105 states and 846848 transitions. [2019-09-10 08:47:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:47:56,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:56,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:56,441 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -870643364, now seen corresponding path program 1 times [2019-09-10 08:47:56,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:56,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:56,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:56,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:56,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:56,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:56,605 INFO L87 Difference]: Start difference. First operand 578105 states and 846848 transitions. Second operand 4 states. [2019-09-10 08:47:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:58,140 INFO L93 Difference]: Finished difference Result 578508 states and 847287 transitions. [2019-09-10 08:47:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:58,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:47:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:01,301 INFO L225 Difference]: With dead ends: 578508 [2019-09-10 08:48:01,301 INFO L226 Difference]: Without dead ends: 578508 [2019-09-10 08:48:01,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:48:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578508 states. [2019-09-10 08:48:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578508 to 578351. [2019-09-10 08:48:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578351 states. [2019-09-10 08:48:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578351 states to 578351 states and 847099 transitions. [2019-09-10 08:48:18,843 INFO L78 Accepts]: Start accepts. Automaton has 578351 states and 847099 transitions. Word has length 184 [2019-09-10 08:48:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:18,844 INFO L475 AbstractCegarLoop]: Abstraction has 578351 states and 847099 transitions. [2019-09-10 08:48:18,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 578351 states and 847099 transitions. [2019-09-10 08:48:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:18,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:18,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:18,866 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1353705385, now seen corresponding path program 1 times [2019-09-10 08:48:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:18,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:18,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:18,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:18,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:18,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:18,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:18,996 INFO L87 Difference]: Start difference. First operand 578351 states and 847099 transitions. Second operand 4 states. [2019-09-10 08:48:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:21,808 INFO L93 Difference]: Finished difference Result 526308 states and 770002 transitions. [2019-09-10 08:48:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:21,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:48:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:22,600 INFO L225 Difference]: With dead ends: 526308 [2019-09-10 08:48:22,601 INFO L226 Difference]: Without dead ends: 526206 [2019-09-10 08:48:22,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:48:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526206 states. [2019-09-10 08:48:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526206 to 526206. [2019-09-10 08:48:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526206 states. [2019-09-10 08:48:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526206 states to 526206 states and 769900 transitions. [2019-09-10 08:48:38,086 INFO L78 Accepts]: Start accepts. Automaton has 526206 states and 769900 transitions. Word has length 184 [2019-09-10 08:48:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:38,087 INFO L475 AbstractCegarLoop]: Abstraction has 526206 states and 769900 transitions. [2019-09-10 08:48:38,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 526206 states and 769900 transitions. [2019-09-10 08:48:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:48:38,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:38,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:38,104 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1215724845, now seen corresponding path program 1 times [2019-09-10 08:48:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:38,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:39,340 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 08:48:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:41,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:41,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:48:41,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:41,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:48:41,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:48:41,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:48:41,175 INFO L87 Difference]: Start difference. First operand 526206 states and 769900 transitions. Second operand 21 states. [2019-09-10 08:48:41,718 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-10 08:48:42,004 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:48:42,186 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:48:42,386 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:48:42,595 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 08:48:42,794 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:48:42,957 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:48:43,145 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:48:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:48,453 INFO L93 Difference]: Finished difference Result 570556 states and 834108 transitions. [2019-09-10 08:48:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:48:48,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 08:48:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:49,391 INFO L225 Difference]: With dead ends: 570556 [2019-09-10 08:48:49,391 INFO L226 Difference]: Without dead ends: 570556 [2019-09-10 08:48:49,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:48:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570556 states. [2019-09-10 08:48:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570556 to 554456. [2019-09-10 08:48:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554456 states. [2019-09-10 08:48:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554456 states to 554456 states and 811072 transitions. [2019-09-10 08:48:58,110 INFO L78 Accepts]: Start accepts. Automaton has 554456 states and 811072 transitions. Word has length 186 [2019-09-10 08:48:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:58,111 INFO L475 AbstractCegarLoop]: Abstraction has 554456 states and 811072 transitions. [2019-09-10 08:48:58,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:48:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 554456 states and 811072 transitions. [2019-09-10 08:48:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:48:58,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:58,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:58,133 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1193659445, now seen corresponding path program 1 times [2019-09-10 08:48:58,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:58,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:58,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:58,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:58,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:58,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:58,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:58,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:58,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:58,240 INFO L87 Difference]: Start difference. First operand 554456 states and 811072 transitions. Second operand 4 states. [2019-09-10 08:49:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:12,160 INFO L93 Difference]: Finished difference Result 831161 states and 1216414 transitions. [2019-09-10 08:49:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:12,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 08:49:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:13,433 INFO L225 Difference]: With dead ends: 831161 [2019-09-10 08:49:13,433 INFO L226 Difference]: Without dead ends: 831161 [2019-09-10 08:49:13,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:49:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831161 states. [2019-09-10 08:49:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831161 to 554239. [2019-09-10 08:49:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554239 states. [2019-09-10 08:49:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554239 states to 554239 states and 810533 transitions. [2019-09-10 08:49:22,765 INFO L78 Accepts]: Start accepts. Automaton has 554239 states and 810533 transitions. Word has length 186 [2019-09-10 08:49:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:22,765 INFO L475 AbstractCegarLoop]: Abstraction has 554239 states and 810533 transitions. [2019-09-10 08:49:22,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 554239 states and 810533 transitions. [2019-09-10 08:49:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:49:22,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:22,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:22,786 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1575696709, now seen corresponding path program 1 times [2019-09-10 08:49:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:22,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:22,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:22,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:22,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:22,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:22,880 INFO L87 Difference]: Start difference. First operand 554239 states and 810533 transitions. Second operand 4 states. [2019-09-10 08:49:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:28,883 INFO L93 Difference]: Finished difference Result 1060906 states and 1557105 transitions. [2019-09-10 08:49:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:28,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 08:49:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:30,609 INFO L225 Difference]: With dead ends: 1060906 [2019-09-10 08:49:30,609 INFO L226 Difference]: Without dead ends: 1060906 [2019-09-10 08:49:30,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:49:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060906 states. [2019-09-10 08:49:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060906 to 552785. [2019-09-10 08:49:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552785 states. [2019-09-10 08:49:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552785 states to 552785 states and 808730 transitions. [2019-09-10 08:49:51,861 INFO L78 Accepts]: Start accepts. Automaton has 552785 states and 808730 transitions. Word has length 186 [2019-09-10 08:49:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:51,861 INFO L475 AbstractCegarLoop]: Abstraction has 552785 states and 808730 transitions. [2019-09-10 08:49:51,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 552785 states and 808730 transitions. [2019-09-10 08:49:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:49:51,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:51,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:51,878 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1970868392, now seen corresponding path program 1 times [2019-09-10 08:49:51,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:51,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:51,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:52,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:52,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:49:52,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:52,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:49:52,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:49:52,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:49:52,019 INFO L87 Difference]: Start difference. First operand 552785 states and 808730 transitions. Second operand 5 states. [2019-09-10 08:49:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:55,091 INFO L93 Difference]: Finished difference Result 552787 states and 804025 transitions. [2019-09-10 08:49:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:49:55,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-10 08:49:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:56,002 INFO L225 Difference]: With dead ends: 552787 [2019-09-10 08:49:56,002 INFO L226 Difference]: Without dead ends: 552787 [2019-09-10 08:49:56,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:49:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552787 states. [2019-09-10 08:50:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552787 to 524626. [2019-09-10 08:50:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524626 states. [2019-09-10 08:50:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524626 states to 524626 states and 763519 transitions. [2019-09-10 08:50:04,136 INFO L78 Accepts]: Start accepts. Automaton has 524626 states and 763519 transitions. Word has length 186 [2019-09-10 08:50:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:04,136 INFO L475 AbstractCegarLoop]: Abstraction has 524626 states and 763519 transitions. [2019-09-10 08:50:04,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:50:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 524626 states and 763519 transitions. [2019-09-10 08:50:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:50:04,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:04,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:04,153 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:04,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -3741525, now seen corresponding path program 1 times [2019-09-10 08:50:04,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:04,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:04,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:04,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:04,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:05,157 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 08:50:14,413 WARN L188 SmtUtils]: Spent 9.23 s on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-09-10 08:50:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:15,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:15,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:50:15,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:15,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:50:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:50:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:50:15,144 INFO L87 Difference]: Start difference. First operand 524626 states and 763519 transitions. Second operand 21 states. [2019-09-10 08:50:15,931 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:50:16,148 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:50:16,572 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:50:16,843 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:50:17,010 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:50:17,157 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:50:17,345 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:50:17,519 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:50:17,835 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41