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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:45:31,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:45:31,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:45:31,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:45:31,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:45:31,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:45:31,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:45:31,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:45:31,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:45:31,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:45:31,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:45:31,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:45:31,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:45:31,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:45:31,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:45:31,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:45:31,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:45:31,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:45:31,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:45:31,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:45:31,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:45:31,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:45:31,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:45:31,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:45:31,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:45:31,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:45:31,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:45:31,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:45:31,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:45:31,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:45:31,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:45:31,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:45:31,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:45:31,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:45:31,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:45:31,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:45:31,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:45:31,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:45:31,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:45:31,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:45:31,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:45:31,275 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:45:31,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:45:31,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:45:31,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:45:31,292 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:45:31,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:45:31,293 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:45:31,293 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:45:31,294 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:45:31,294 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:45:31,294 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:45:31,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:45:31,295 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:45:31,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:45:31,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:45:31,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:45:31,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:45:31,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:45:31,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:45:31,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:45:31,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:45:31,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:45:31,297 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:45:31,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:45:31,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:45:31,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:45:31,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:45:31,298 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:45:31,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:45:31,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:45:31,299 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:45:31,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:45:31,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:45:31,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:45:31,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:45:31,351 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:45:31,352 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:45:31,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335f5cf7e/3257cf3ecb6b45e28d5b6efd0f5b906b/FLAG461ba772b [2019-09-10 08:45:32,036 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:45:32,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:45:32,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335f5cf7e/3257cf3ecb6b45e28d5b6efd0f5b906b/FLAG461ba772b [2019-09-10 08:45:32,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335f5cf7e/3257cf3ecb6b45e28d5b6efd0f5b906b [2019-09-10 08:45:32,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:45:32,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:45:32,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:45:32,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:45:32,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:45:32,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:45:32" (1/1) ... [2019-09-10 08:45:32,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3383e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:32, skipping insertion in model container [2019-09-10 08:45:32,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:45:32" (1/1) ... [2019-09-10 08:45:32,292 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:45:32,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:45:32,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:45:32,975 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:45:33,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:45:33,172 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:45:33,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33 WrapperNode [2019-09-10 08:45:33,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:45:33,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:45:33,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:45:33,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:45:33,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (1/1) ... [2019-09-10 08:45:33,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:45:33,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:45:33,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:45:33,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:45:33,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (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:45:33,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:45:33,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:45:33,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:45:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:45:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:45:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:45:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:45:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:45:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:45:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:45:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:45:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:45:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:45:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:45:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:45:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:45:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:45:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:45:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:45:35,011 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:45:35,012 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:45:35,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:45:35 BoogieIcfgContainer [2019-09-10 08:45:35,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:45:35,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:45:35,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:45:35,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:45:35,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:45:32" (1/3) ... [2019-09-10 08:45:35,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8735e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:45:35, skipping insertion in model container [2019-09-10 08:45:35,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:33" (2/3) ... [2019-09-10 08:45:35,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8735e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:45:35, skipping insertion in model container [2019-09-10 08:45:35,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:45:35" (3/3) ... [2019-09-10 08:45:35,022 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:45:35,035 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:45:35,046 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:45:35,066 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:45:35,098 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:45:35,099 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:45:35,099 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:45:35,099 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:45:35,099 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:45:35,099 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:45:35,100 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:45:35,100 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:45:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2019-09-10 08:45:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:45:35,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:35,153 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:45:35,155 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:35,161 INFO L82 PathProgramCache]: Analyzing trace with hash -680724110, now seen corresponding path program 1 times [2019-09-10 08:45:35,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:35,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:35,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:35,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:35,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:36,092 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:45:36,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:36,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:36,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:36,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:36,120 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 4 states. [2019-09-10 08:45:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:36,349 INFO L93 Difference]: Finished difference Result 670 states and 1166 transitions. [2019-09-10 08:45:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:45:36,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-10 08:45:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:36,374 INFO L225 Difference]: With dead ends: 670 [2019-09-10 08:45:36,374 INFO L226 Difference]: Without dead ends: 662 [2019-09-10 08:45:36,376 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:45:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-10 08:45:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2019-09-10 08:45:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 08:45:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 961 transitions. [2019-09-10 08:45:36,478 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 961 transitions. Word has length 159 [2019-09-10 08:45:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:36,479 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 961 transitions. [2019-09-10 08:45:36,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 961 transitions. [2019-09-10 08:45:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:45:36,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:36,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] [2019-09-10 08:45:36,487 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1230031220, now seen corresponding path program 1 times [2019-09-10 08:45:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:36,606 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:45:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:36,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:36,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:36,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:36,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:36,617 INFO L87 Difference]: Start difference. First operand 660 states and 961 transitions. Second operand 3 states. [2019-09-10 08:45:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:36,652 INFO L93 Difference]: Finished difference Result 1306 states and 1901 transitions. [2019-09-10 08:45:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:36,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:45:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:36,662 INFO L225 Difference]: With dead ends: 1306 [2019-09-10 08:45:36,662 INFO L226 Difference]: Without dead ends: 1306 [2019-09-10 08:45:36,663 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:45:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-10 08:45:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 662. [2019-09-10 08:45:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-10 08:45:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 963 transitions. [2019-09-10 08:45:36,726 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 963 transitions. Word has length 160 [2019-09-10 08:45:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:36,729 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 963 transitions. [2019-09-10 08:45:36,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 963 transitions. [2019-09-10 08:45:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:36,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:36,740 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:45:36,741 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 230722581, now seen corresponding path program 1 times [2019-09-10 08:45:36,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:36,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:36,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:37,011 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:45:37,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:37,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:37,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:37,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:37,014 INFO L87 Difference]: Start difference. First operand 662 states and 963 transitions. Second operand 3 states. [2019-09-10 08:45:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:37,097 INFO L93 Difference]: Finished difference Result 1274 states and 1836 transitions. [2019-09-10 08:45:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:37,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:45:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,106 INFO L225 Difference]: With dead ends: 1274 [2019-09-10 08:45:37,107 INFO L226 Difference]: Without dead ends: 1274 [2019-09-10 08:45:37,108 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:45:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-10 08:45:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-10 08:45:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-10 08:45:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1835 transitions. [2019-09-10 08:45:37,151 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1835 transitions. Word has length 161 [2019-09-10 08:45:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:37,151 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1835 transitions. [2019-09-10 08:45:37,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1835 transitions. [2019-09-10 08:45:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:37,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:37,157 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:45:37,157 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1877064936, now seen corresponding path program 1 times [2019-09-10 08:45:37,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:37,337 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:45:37,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:37,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:37,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:37,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:37,339 INFO L87 Difference]: Start difference. First operand 1272 states and 1835 transitions. Second operand 4 states. [2019-09-10 08:45:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:37,384 INFO L93 Difference]: Finished difference Result 1033 states and 1485 transitions. [2019-09-10 08:45:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:37,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 08:45:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,391 INFO L225 Difference]: With dead ends: 1033 [2019-09-10 08:45:37,391 INFO L226 Difference]: Without dead ends: 973 [2019-09-10 08:45:37,392 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:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-10 08:45:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2019-09-10 08:45:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-10 08:45:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1399 transitions. [2019-09-10 08:45:37,421 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1399 transitions. Word has length 161 [2019-09-10 08:45:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:37,422 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1399 transitions. [2019-09-10 08:45:37,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1399 transitions. [2019-09-10 08:45:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:45:37,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:37,426 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:45:37,426 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 916510918, now seen corresponding path program 1 times [2019-09-10 08:45:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:37,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:37,572 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:45:37,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:37,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:37,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:37,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:37,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:37,574 INFO L87 Difference]: Start difference. First operand 973 states and 1399 transitions. Second operand 3 states. [2019-09-10 08:45:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:37,629 INFO L93 Difference]: Finished difference Result 1359 states and 1991 transitions. [2019-09-10 08:45:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:37,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 08:45:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,637 INFO L225 Difference]: With dead ends: 1359 [2019-09-10 08:45:37,637 INFO L226 Difference]: Without dead ends: 1359 [2019-09-10 08:45:37,638 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:45:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-09-10 08:45:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1194. [2019-09-10 08:45:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-09-10 08:45:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1757 transitions. [2019-09-10 08:45:37,671 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1757 transitions. Word has length 163 [2019-09-10 08:45:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:37,671 INFO L475 AbstractCegarLoop]: Abstraction has 1194 states and 1757 transitions. [2019-09-10 08:45:37,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1757 transitions. [2019-09-10 08:45:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:45:37,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:37,675 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:45:37,675 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash -575678253, now seen corresponding path program 1 times [2019-09-10 08:45:37,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:37,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:37,774 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:45:37,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:37,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:37,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:37,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:37,776 INFO L87 Difference]: Start difference. First operand 1194 states and 1757 transitions. Second operand 3 states. [2019-09-10 08:45:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:37,835 INFO L93 Difference]: Finished difference Result 1742 states and 2610 transitions. [2019-09-10 08:45:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:37,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 08:45:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,846 INFO L225 Difference]: With dead ends: 1742 [2019-09-10 08:45:37,847 INFO L226 Difference]: Without dead ends: 1742 [2019-09-10 08:45:37,848 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:45:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-10 08:45:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1583. [2019-09-10 08:45:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2019-09-10 08:45:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2386 transitions. [2019-09-10 08:45:37,912 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2386 transitions. Word has length 165 [2019-09-10 08:45:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:37,912 INFO L475 AbstractCegarLoop]: Abstraction has 1583 states and 2386 transitions. [2019-09-10 08:45:37,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2386 transitions. [2019-09-10 08:45:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:45:37,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:37,918 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:45:37,918 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:37,919 INFO L82 PathProgramCache]: Analyzing trace with hash 866582975, now seen corresponding path program 1 times [2019-09-10 08:45:37,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:37,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:37,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:37,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:38,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:45:38,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:38,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:38,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:38,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:38,144 INFO L87 Difference]: Start difference. First operand 1583 states and 2386 transitions. Second operand 4 states. [2019-09-10 08:45:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:38,347 INFO L93 Difference]: Finished difference Result 2810 states and 4293 transitions. [2019-09-10 08:45:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:38,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 08:45:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:38,362 INFO L225 Difference]: With dead ends: 2810 [2019-09-10 08:45:38,362 INFO L226 Difference]: Without dead ends: 2810 [2019-09-10 08:45:38,363 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:45:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-09-10 08:45:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2019-09-10 08:45:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-10 08:45:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4292 transitions. [2019-09-10 08:45:38,441 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4292 transitions. Word has length 166 [2019-09-10 08:45:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:38,442 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 4292 transitions. [2019-09-10 08:45:38,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4292 transitions. [2019-09-10 08:45:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:45:38,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:38,447 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:45:38,447 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash 604906342, now seen corresponding path program 1 times [2019-09-10 08:45:38,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:38,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:38,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:38,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:38,651 INFO L87 Difference]: Start difference. First operand 2808 states and 4292 transitions. Second operand 4 states. [2019-09-10 08:45:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:38,764 INFO L93 Difference]: Finished difference Result 4491 states and 6807 transitions. [2019-09-10 08:45:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:38,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 08:45:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:38,787 INFO L225 Difference]: With dead ends: 4491 [2019-09-10 08:45:38,788 INFO L226 Difference]: Without dead ends: 4491 [2019-09-10 08:45:38,788 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:45:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2019-09-10 08:45:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2019-09-10 08:45:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4489 states. [2019-09-10 08:45:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6806 transitions. [2019-09-10 08:45:38,912 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6806 transitions. Word has length 166 [2019-09-10 08:45:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:38,913 INFO L475 AbstractCegarLoop]: Abstraction has 4489 states and 6806 transitions. [2019-09-10 08:45:38,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6806 transitions. [2019-09-10 08:45:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:45:38,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:38,918 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:45:38,919 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 108069717, now seen corresponding path program 1 times [2019-09-10 08:45:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:39,074 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:45:39,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:39,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:39,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:39,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:39,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:39,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:39,076 INFO L87 Difference]: Start difference. First operand 4489 states and 6806 transitions. Second operand 3 states. [2019-09-10 08:45:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:39,178 INFO L93 Difference]: Finished difference Result 8522 states and 12826 transitions. [2019-09-10 08:45:39,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:39,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:45:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:39,219 INFO L225 Difference]: With dead ends: 8522 [2019-09-10 08:45:39,219 INFO L226 Difference]: Without dead ends: 8522 [2019-09-10 08:45:39,220 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:45:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2019-09-10 08:45:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 8520. [2019-09-10 08:45:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8520 states. [2019-09-10 08:45:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8520 states to 8520 states and 12825 transitions. [2019-09-10 08:45:39,511 INFO L78 Accepts]: Start accepts. Automaton has 8520 states and 12825 transitions. Word has length 168 [2019-09-10 08:45:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:39,511 INFO L475 AbstractCegarLoop]: Abstraction has 8520 states and 12825 transitions. [2019-09-10 08:45:39,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 8520 states and 12825 transitions. [2019-09-10 08:45:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:45:39,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:39,529 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:45:39,529 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1037289934, now seen corresponding path program 1 times [2019-09-10 08:45:39,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:39,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:39,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:39,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:39,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:39,728 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:45:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:39,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:39,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:39,732 INFO L87 Difference]: Start difference. First operand 8520 states and 12825 transitions. Second operand 4 states. [2019-09-10 08:45:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:39,802 INFO L93 Difference]: Finished difference Result 6990 states and 10478 transitions. [2019-09-10 08:45:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:39,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-10 08:45:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:39,844 INFO L225 Difference]: With dead ends: 6990 [2019-09-10 08:45:39,844 INFO L226 Difference]: Without dead ends: 6942 [2019-09-10 08:45:39,844 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:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2019-09-10 08:45:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6942. [2019-09-10 08:45:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6942 states. [2019-09-10 08:45:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 10415 transitions. [2019-09-10 08:45:40,114 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 10415 transitions. Word has length 168 [2019-09-10 08:45:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:40,114 INFO L475 AbstractCegarLoop]: Abstraction has 6942 states and 10415 transitions. [2019-09-10 08:45:40,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 10415 transitions. [2019-09-10 08:45:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:45:40,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:40,125 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:45:40,126 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -859201449, now seen corresponding path program 1 times [2019-09-10 08:45:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:40,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:40,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:40,264 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:45:40,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:40,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:40,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:40,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:40,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:40,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:40,266 INFO L87 Difference]: Start difference. First operand 6942 states and 10415 transitions. Second operand 3 states. [2019-09-10 08:45:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:40,386 INFO L93 Difference]: Finished difference Result 11504 states and 17491 transitions. [2019-09-10 08:45:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:40,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:45:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:40,414 INFO L225 Difference]: With dead ends: 11504 [2019-09-10 08:45:40,414 INFO L226 Difference]: Without dead ends: 11504 [2019-09-10 08:45:40,416 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:45:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2019-09-10 08:45:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 10404. [2019-09-10 08:45:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10404 states. [2019-09-10 08:45:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10404 states to 10404 states and 15982 transitions. [2019-09-10 08:45:40,671 INFO L78 Accepts]: Start accepts. Automaton has 10404 states and 15982 transitions. Word has length 172 [2019-09-10 08:45:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:40,671 INFO L475 AbstractCegarLoop]: Abstraction has 10404 states and 15982 transitions. [2019-09-10 08:45:40,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10404 states and 15982 transitions. [2019-09-10 08:45:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:40,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:40,679 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:45:40,679 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -830615246, now seen corresponding path program 1 times [2019-09-10 08:45:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:40,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:40,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:40,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:40,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:40,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:40,864 INFO L87 Difference]: Start difference. First operand 10404 states and 15982 transitions. Second operand 3 states. [2019-09-10 08:45:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:41,252 INFO L93 Difference]: Finished difference Result 20423 states and 31283 transitions. [2019-09-10 08:45:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:41,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:45:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:41,299 INFO L225 Difference]: With dead ends: 20423 [2019-09-10 08:45:41,299 INFO L226 Difference]: Without dead ends: 20423 [2019-09-10 08:45:41,299 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:45:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20423 states. [2019-09-10 08:45:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20423 to 20421. [2019-09-10 08:45:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20421 states. [2019-09-10 08:45:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20421 states to 20421 states and 31282 transitions. [2019-09-10 08:45:41,770 INFO L78 Accepts]: Start accepts. Automaton has 20421 states and 31282 transitions. Word has length 173 [2019-09-10 08:45:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:41,770 INFO L475 AbstractCegarLoop]: Abstraction has 20421 states and 31282 transitions. [2019-09-10 08:45:41,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20421 states and 31282 transitions. [2019-09-10 08:45:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:41,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:41,784 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:45:41,784 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1665080627, now seen corresponding path program 1 times [2019-09-10 08:45:41,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:41,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:41,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:41,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:41,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:42,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:42,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:45:42,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:42,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:45:42,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:45:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:42,170 INFO L87 Difference]: Start difference. First operand 20421 states and 31282 transitions. Second operand 9 states. [2019-09-10 08:45:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:43,439 INFO L93 Difference]: Finished difference Result 87621 states and 133654 transitions. [2019-09-10 08:45:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:45:43,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-09-10 08:45:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:43,714 INFO L225 Difference]: With dead ends: 87621 [2019-09-10 08:45:43,714 INFO L226 Difference]: Without dead ends: 87621 [2019-09-10 08:45:43,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:45:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87621 states. [2019-09-10 08:45:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87621 to 57133. [2019-09-10 08:45:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57133 states. [2019-09-10 08:45:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57133 states to 57133 states and 87258 transitions. [2019-09-10 08:45:46,187 INFO L78 Accepts]: Start accepts. Automaton has 57133 states and 87258 transitions. Word has length 173 [2019-09-10 08:45:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:46,188 INFO L475 AbstractCegarLoop]: Abstraction has 57133 states and 87258 transitions. [2019-09-10 08:45:46,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:45:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 57133 states and 87258 transitions. [2019-09-10 08:45:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:46,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:46,223 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:45:46,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 972224736, now seen corresponding path program 1 times [2019-09-10 08:45:46,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:46,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:46,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:46,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:46,472 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:45:46,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:46,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:46,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:46,474 INFO L87 Difference]: Start difference. First operand 57133 states and 87258 transitions. Second operand 4 states. [2019-09-10 08:45:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:46,810 INFO L93 Difference]: Finished difference Result 73231 states and 112331 transitions. [2019-09-10 08:45:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:46,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:45:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:47,059 INFO L225 Difference]: With dead ends: 73231 [2019-09-10 08:45:47,059 INFO L226 Difference]: Without dead ends: 73231 [2019-09-10 08:45:47,060 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:45:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73231 states. [2019-09-10 08:45:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73231 to 73229. [2019-09-10 08:45:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73229 states. [2019-09-10 08:45:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73229 states to 73229 states and 112330 transitions. [2019-09-10 08:45:49,758 INFO L78 Accepts]: Start accepts. Automaton has 73229 states and 112330 transitions. Word has length 173 [2019-09-10 08:45:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:49,758 INFO L475 AbstractCegarLoop]: Abstraction has 73229 states and 112330 transitions. [2019-09-10 08:45:49,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 73229 states and 112330 transitions. [2019-09-10 08:45:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:49,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:49,783 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:45:49,783 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash 774371549, now seen corresponding path program 1 times [2019-09-10 08:45:49,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:49,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:49,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:49,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:49,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:49,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:45:49,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:49,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:45:49,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:49,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:45:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:45:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:49,997 INFO L87 Difference]: Start difference. First operand 73229 states and 112330 transitions. Second operand 5 states. [2019-09-10 08:45:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:50,660 INFO L93 Difference]: Finished difference Result 153197 states and 236711 transitions. [2019-09-10 08:45:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:45:50,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-10 08:45:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:51,041 INFO L225 Difference]: With dead ends: 153197 [2019-09-10 08:45:51,041 INFO L226 Difference]: Without dead ends: 153197 [2019-09-10 08:45:51,043 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:45:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153197 states. [2019-09-10 08:45:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153197 to 121935. [2019-09-10 08:45:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121935 states. [2019-09-10 08:45:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121935 states to 121935 states and 187660 transitions. [2019-09-10 08:45:54,571 INFO L78 Accepts]: Start accepts. Automaton has 121935 states and 187660 transitions. Word has length 173 [2019-09-10 08:45:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:54,572 INFO L475 AbstractCegarLoop]: Abstraction has 121935 states and 187660 transitions. [2019-09-10 08:45:54,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:45:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 121935 states and 187660 transitions. [2019-09-10 08:45:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:54,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:54,598 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:45:54,599 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1442256878, now seen corresponding path program 1 times [2019-09-10 08:45:54,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:54,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:54,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:54,716 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:45:54,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:54,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:54,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:54,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:54,719 INFO L87 Difference]: Start difference. First operand 121935 states and 187660 transitions. Second operand 3 states. [2019-09-10 08:45:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:55,388 INFO L93 Difference]: Finished difference Result 214191 states and 329953 transitions. [2019-09-10 08:45:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:55,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:45:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:58,318 INFO L225 Difference]: With dead ends: 214191 [2019-09-10 08:45:58,318 INFO L226 Difference]: Without dead ends: 214191 [2019-09-10 08:45:58,319 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:45:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214191 states. [2019-09-10 08:46:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214191 to 214189. [2019-09-10 08:46:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214189 states. [2019-09-10 08:46:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214189 states to 214189 states and 329952 transitions. [2019-09-10 08:46:00,737 INFO L78 Accepts]: Start accepts. Automaton has 214189 states and 329952 transitions. Word has length 173 [2019-09-10 08:46:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:00,737 INFO L475 AbstractCegarLoop]: Abstraction has 214189 states and 329952 transitions. [2019-09-10 08:46:00,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 214189 states and 329952 transitions. [2019-09-10 08:46:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:46:00,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:00,759 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:46:00,760 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash 528423661, now seen corresponding path program 1 times [2019-09-10 08:46:00,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:00,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:00,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:00,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:00,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:00,941 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:00,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:00,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:00,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:00,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:00,943 INFO L87 Difference]: Start difference. First operand 214189 states and 329952 transitions. Second operand 4 states. [2019-09-10 08:46:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:05,133 INFO L93 Difference]: Finished difference Result 383054 states and 582722 transitions. [2019-09-10 08:46:05,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:05,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:46:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:05,670 INFO L225 Difference]: With dead ends: 383054 [2019-09-10 08:46:05,670 INFO L226 Difference]: Without dead ends: 383054 [2019-09-10 08:46:05,671 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:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383054 states. [2019-09-10 08:46:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383054 to 383052. [2019-09-10 08:46:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383052 states. [2019-09-10 08:46:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383052 states to 383052 states and 582721 transitions. [2019-09-10 08:46:10,616 INFO L78 Accepts]: Start accepts. Automaton has 383052 states and 582721 transitions. Word has length 173 [2019-09-10 08:46:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:10,617 INFO L475 AbstractCegarLoop]: Abstraction has 383052 states and 582721 transitions. [2019-09-10 08:46:10,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 383052 states and 582721 transitions. [2019-09-10 08:46:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:46:10,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:10,648 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:46:10,648 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2018947067, now seen corresponding path program 1 times [2019-09-10 08:46:10,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:10,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:10,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:16,424 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:16,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:16,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:16,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:16,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:16,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:16,426 INFO L87 Difference]: Start difference. First operand 383052 states and 582721 transitions. Second operand 3 states. [2019-09-10 08:46:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:18,243 INFO L93 Difference]: Finished difference Result 766010 states and 1165321 transitions. [2019-09-10 08:46:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:18,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 08:46:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:20,922 INFO L225 Difference]: With dead ends: 766010 [2019-09-10 08:46:20,922 INFO L226 Difference]: Without dead ends: 766010 [2019-09-10 08:46:20,923 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:46:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766010 states. [2019-09-10 08:46:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766010 to 383058. [2019-09-10 08:46:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383058 states. [2019-09-10 08:46:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383058 states to 383058 states and 582727 transitions. [2019-09-10 08:46:35,897 INFO L78 Accepts]: Start accepts. Automaton has 383058 states and 582727 transitions. Word has length 174 [2019-09-10 08:46:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:35,897 INFO L475 AbstractCegarLoop]: Abstraction has 383058 states and 582727 transitions. [2019-09-10 08:46:35,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 383058 states and 582727 transitions. [2019-09-10 08:46:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:46:35,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:35,933 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:46:35,933 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1286910388, now seen corresponding path program 1 times [2019-09-10 08:46:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:35,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:35,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:35,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:35,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:36,092 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:36,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:36,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:36,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:36,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:36,095 INFO L87 Difference]: Start difference. First operand 383058 states and 582727 transitions. Second operand 4 states. [2019-09-10 08:46:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:37,539 INFO L93 Difference]: Finished difference Result 383210 states and 582896 transitions. [2019-09-10 08:46:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:37,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:46:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:38,210 INFO L225 Difference]: With dead ends: 383210 [2019-09-10 08:46:38,210 INFO L226 Difference]: Without dead ends: 383058 [2019-09-10 08:46:38,211 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:46:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383058 states. [2019-09-10 08:46:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383058 to 383055. [2019-09-10 08:46:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383055 states. [2019-09-10 08:46:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383055 states to 383055 states and 582720 transitions. [2019-09-10 08:46:48,910 INFO L78 Accepts]: Start accepts. Automaton has 383055 states and 582720 transitions. Word has length 175 [2019-09-10 08:46:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:48,911 INFO L475 AbstractCegarLoop]: Abstraction has 383055 states and 582720 transitions. [2019-09-10 08:46:48,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 383055 states and 582720 transitions. [2019-09-10 08:46:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:46:48,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:48,939 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:46:48,940 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1431746001, now seen corresponding path program 1 times [2019-09-10 08:46:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:48,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:49,091 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:49,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:49,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:49,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:49,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:49,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:49,094 INFO L87 Difference]: Start difference. First operand 383055 states and 582720 transitions. Second operand 4 states. [2019-09-10 08:46:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:51,490 INFO L93 Difference]: Finished difference Result 383236 states and 582926 transitions. [2019-09-10 08:46:51,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:51,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:46:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:51,989 INFO L225 Difference]: With dead ends: 383236 [2019-09-10 08:46:51,990 INFO L226 Difference]: Without dead ends: 383049 [2019-09-10 08:46:51,990 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:46:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383049 states. [2019-09-10 08:47:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383049 to 383049. [2019-09-10 08:47:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383049 states. [2019-09-10 08:47:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383049 states to 383049 states and 582708 transitions. [2019-09-10 08:47:02,117 INFO L78 Accepts]: Start accepts. Automaton has 383049 states and 582708 transitions. Word has length 175 [2019-09-10 08:47:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:02,117 INFO L475 AbstractCegarLoop]: Abstraction has 383049 states and 582708 transitions. [2019-09-10 08:47:02,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 383049 states and 582708 transitions. [2019-09-10 08:47:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:47:02,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:02,144 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:47:02,144 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2115386092, now seen corresponding path program 1 times [2019-09-10 08:47:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:02,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:02,238 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:02,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:02,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:02,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:02,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:02,240 INFO L87 Difference]: Start difference. First operand 383049 states and 582708 transitions. Second operand 3 states. [2019-09-10 08:47:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:04,865 INFO L93 Difference]: Finished difference Result 557779 states and 838357 transitions. [2019-09-10 08:47:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:04,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 08:47:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:05,892 INFO L225 Difference]: With dead ends: 557779 [2019-09-10 08:47:05,893 INFO L226 Difference]: Without dead ends: 557779 [2019-09-10 08:47:05,895 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:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557779 states. [2019-09-10 08:47:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557779 to 557777. [2019-09-10 08:47:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557777 states. [2019-09-10 08:47:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557777 states to 557777 states and 838356 transitions. [2019-09-10 08:47:19,910 INFO L78 Accepts]: Start accepts. Automaton has 557777 states and 838356 transitions. Word has length 175 [2019-09-10 08:47:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:19,911 INFO L475 AbstractCegarLoop]: Abstraction has 557777 states and 838356 transitions. [2019-09-10 08:47:19,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 557777 states and 838356 transitions. [2019-09-10 08:47:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:47:19,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:19,954 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:47:19,955 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash -425393913, now seen corresponding path program 1 times [2019-09-10 08:47:19,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:19,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:20,083 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:20,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:20,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:20,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:20,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:20,085 INFO L87 Difference]: Start difference. First operand 557777 states and 838356 transitions. Second operand 3 states. [2019-09-10 08:47:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:23,877 INFO L93 Difference]: Finished difference Result 840683 states and 1238775 transitions. [2019-09-10 08:47:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:34,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:47:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:35,486 INFO L225 Difference]: With dead ends: 840683 [2019-09-10 08:47:35,486 INFO L226 Difference]: Without dead ends: 840683 [2019-09-10 08:47:35,487 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:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840683 states. [2019-09-10 08:47:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840683 to 764107. [2019-09-10 08:47:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764107 states. [2019-09-10 08:47:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764107 states to 764107 states and 1125358 transitions. [2019-09-10 08:47:57,712 INFO L78 Accepts]: Start accepts. Automaton has 764107 states and 1125358 transitions. Word has length 180 [2019-09-10 08:47:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:57,713 INFO L475 AbstractCegarLoop]: Abstraction has 764107 states and 1125358 transitions. [2019-09-10 08:47:57,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 764107 states and 1125358 transitions. [2019-09-10 08:47:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:47:57,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:57,749 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:47:57,749 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2108470470, now seen corresponding path program 1 times [2019-09-10 08:47:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:57,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:57,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:57,846 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:57,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:57,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:57,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:57,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:57,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:57,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:57,848 INFO L87 Difference]: Start difference. First operand 764107 states and 1125358 transitions. Second operand 4 states. [2019-09-10 08:48:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:08,985 INFO L93 Difference]: Finished difference Result 1187715 states and 1753984 transitions. [2019-09-10 08:48:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:08,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-10 08:48:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:11,824 INFO L225 Difference]: With dead ends: 1187715 [2019-09-10 08:48:11,824 INFO L226 Difference]: Without dead ends: 1187715 [2019-09-10 08:48:11,825 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:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187715 states. [2019-09-10 08:48:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187715 to 763845. [2019-09-10 08:48:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763845 states. [2019-09-10 08:48:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763845 states to 763845 states and 1124719 transitions. [2019-09-10 08:48:31,426 INFO L78 Accepts]: Start accepts. Automaton has 763845 states and 1124719 transitions. Word has length 180 [2019-09-10 08:48:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:31,426 INFO L475 AbstractCegarLoop]: Abstraction has 763845 states and 1124719 transitions. [2019-09-10 08:48:31,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 763845 states and 1124719 transitions. [2019-09-10 08:48:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:48:31,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:31,468 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:48:31,468 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:31,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1224503475, now seen corresponding path program 1 times [2019-09-10 08:48:31,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:31,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:31,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:31,662 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:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:31,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:48:31,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:31,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:48:31,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:48:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:48:31,666 INFO L87 Difference]: Start difference. First operand 763845 states and 1124719 transitions. Second operand 8 states. [2019-09-10 08:48:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:44,590 INFO L93 Difference]: Finished difference Result 1628922 states and 2367569 transitions. [2019-09-10 08:48:44,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:48:44,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2019-09-10 08:48:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:48,848 INFO L225 Difference]: With dead ends: 1628922 [2019-09-10 08:48:48,848 INFO L226 Difference]: Without dead ends: 1628922 [2019-09-10 08:48:48,849 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:48:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628922 states. [2019-09-10 08:49:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628922 to 459559. [2019-09-10 08:49:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459559 states. [2019-09-10 08:49:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459559 states to 459559 states and 675123 transitions. [2019-09-10 08:49:13,502 INFO L78 Accepts]: Start accepts. Automaton has 459559 states and 675123 transitions. Word has length 180 [2019-09-10 08:49:13,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:13,502 INFO L475 AbstractCegarLoop]: Abstraction has 459559 states and 675123 transitions. [2019-09-10 08:49:13,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:49:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 459559 states and 675123 transitions. [2019-09-10 08:49:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:49:13,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:13,528 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:49:13,529 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 871449178, now seen corresponding path program 1 times [2019-09-10 08:49:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:13,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:13,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:13,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:49:13,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:13,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:13,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:13,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:13,727 INFO L87 Difference]: Start difference. First operand 459559 states and 675123 transitions. Second operand 4 states. [2019-09-10 08:49:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:16,849 INFO L93 Difference]: Finished difference Result 428802 states and 629828 transitions. [2019-09-10 08:49:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:16,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-10 08:49:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:17,578 INFO L225 Difference]: With dead ends: 428802 [2019-09-10 08:49:17,578 INFO L226 Difference]: Without dead ends: 428802 [2019-09-10 08:49:17,578 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:49:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428802 states. [2019-09-10 08:49:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428802 to 428760. [2019-09-10 08:49:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428760 states. [2019-09-10 08:49:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428760 states to 428760 states and 629779 transitions. [2019-09-10 08:49:38,436 INFO L78 Accepts]: Start accepts. Automaton has 428760 states and 629779 transitions. Word has length 180 [2019-09-10 08:49:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:38,436 INFO L475 AbstractCegarLoop]: Abstraction has 428760 states and 629779 transitions. [2019-09-10 08:49:38,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 428760 states and 629779 transitions. [2019-09-10 08:49:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:49:38,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:38,457 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:49:38,458 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:38,458 INFO L82 PathProgramCache]: Analyzing trace with hash 990094056, now seen corresponding path program 1 times [2019-09-10 08:49:38,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:38,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:38,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:38,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:38,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:38,632 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:38,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:38,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:38,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:38,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:38,634 INFO L87 Difference]: Start difference. First operand 428760 states and 629779 transitions. Second operand 4 states. [2019-09-10 08:49:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:39,878 INFO L93 Difference]: Finished difference Result 428924 states and 629959 transitions. [2019-09-10 08:49:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:39,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:49:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:40,506 INFO L225 Difference]: With dead ends: 428924 [2019-09-10 08:49:40,506 INFO L226 Difference]: Without dead ends: 428924 [2019-09-10 08:49:40,506 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:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428924 states. [2019-09-10 08:49:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428924 to 428862. [2019-09-10 08:49:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428862 states. [2019-09-10 08:49:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428862 states to 428862 states and 629882 transitions. [2019-09-10 08:49:48,687 INFO L78 Accepts]: Start accepts. Automaton has 428862 states and 629882 transitions. Word has length 182 [2019-09-10 08:49:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:48,688 INFO L475 AbstractCegarLoop]: Abstraction has 428862 states and 629882 transitions. [2019-09-10 08:49:48,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 428862 states and 629882 transitions. [2019-09-10 08:49:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:49:48,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:48,707 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:49:48,707 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -599847148, now seen corresponding path program 1 times [2019-09-10 08:49:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:48,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:48,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:48,762 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:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:48,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:48,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:48,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:48,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:48,764 INFO L87 Difference]: Start difference. First operand 428862 states and 629882 transitions. Second operand 3 states. [2019-09-10 08:49:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:58,243 INFO L93 Difference]: Finished difference Result 857513 states and 1259515 transitions. [2019-09-10 08:49:58,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:58,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 08:49:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:59,644 INFO L225 Difference]: With dead ends: 857513 [2019-09-10 08:49:59,644 INFO L226 Difference]: Without dead ends: 857513 [2019-09-10 08:49:59,645 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:50:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857513 states. [2019-09-10 08:50:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857513 to 428872. [2019-09-10 08:50:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428872 states. [2019-09-10 08:50:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428872 states to 428872 states and 629892 transitions. [2019-09-10 08:50:09,099 INFO L78 Accepts]: Start accepts. Automaton has 428872 states and 629892 transitions. Word has length 183 [2019-09-10 08:50:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:09,100 INFO L475 AbstractCegarLoop]: Abstraction has 428872 states and 629892 transitions. [2019-09-10 08:50:09,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 428872 states and 629892 transitions. [2019-09-10 08:50:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:50:09,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:09,120 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:50:09,121 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:09,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:09,121 INFO L82 PathProgramCache]: Analyzing trace with hash -870643364, now seen corresponding path program 1 times [2019-09-10 08:50:09,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:09,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:09,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:09,296 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:09,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:09,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:09,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:09,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:09,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:09,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:09,298 INFO L87 Difference]: Start difference. First operand 428872 states and 629892 transitions. Second operand 4 states. [2019-09-10 08:50:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:10,467 INFO L93 Difference]: Finished difference Result 429275 states and 630331 transitions. [2019-09-10 08:50:10,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:10,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:50:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:17,586 INFO L225 Difference]: With dead ends: 429275 [2019-09-10 08:50:17,587 INFO L226 Difference]: Without dead ends: 429275 [2019-09-10 08:50:17,587 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:50:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429275 states. [2019-09-10 08:50:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429275 to 429118. [2019-09-10 08:50:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429118 states. [2019-09-10 08:50:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429118 states to 429118 states and 630143 transitions. [2019-09-10 08:50:23,494 INFO L78 Accepts]: Start accepts. Automaton has 429118 states and 630143 transitions. Word has length 184 [2019-09-10 08:50:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:23,495 INFO L475 AbstractCegarLoop]: Abstraction has 429118 states and 630143 transitions. [2019-09-10 08:50:23,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 429118 states and 630143 transitions. [2019-09-10 08:50:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:50:23,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:23,516 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:50:23,517 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1353705385, now seen corresponding path program 1 times [2019-09-10 08:50:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:23,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:23,684 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:23,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:23,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:23,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:23,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:23,685 INFO L87 Difference]: Start difference. First operand 429118 states and 630143 transitions. Second operand 4 states. [2019-09-10 08:50:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:24,817 INFO L93 Difference]: Finished difference Result 390316 states and 572504 transitions. [2019-09-10 08:50:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:24,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:50:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:25,451 INFO L225 Difference]: With dead ends: 390316 [2019-09-10 08:50:25,451 INFO L226 Difference]: Without dead ends: 390268 [2019-09-10 08:50:25,451 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:50:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390268 states. [2019-09-10 08:50:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390268 to 390265. [2019-09-10 08:50:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390265 states. [2019-09-10 08:50:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390265 states to 390265 states and 572453 transitions. [2019-09-10 08:50:36,635 INFO L78 Accepts]: Start accepts. Automaton has 390265 states and 572453 transitions. Word has length 184 [2019-09-10 08:50:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:36,635 INFO L475 AbstractCegarLoop]: Abstraction has 390265 states and 572453 transitions. [2019-09-10 08:50:36,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 390265 states and 572453 transitions. [2019-09-10 08:50:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:50:36,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:36,650 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:36,651 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1215724845, now seen corresponding path program 1 times [2019-09-10 08:50:36,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:36,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:38,627 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:38,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:50:38,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:38,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:50:38,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:50:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:50:38,629 INFO L87 Difference]: Start difference. First operand 390265 states and 572453 transitions. Second operand 21 states. [2019-09-10 08:50:39,172 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-10 08:50:39,446 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:50:39,621 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:50:39,817 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:50:41,011 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 08:50:41,365 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:50:41,543 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:50:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:47,212 INFO L93 Difference]: Finished difference Result 440405 states and 644809 transitions. [2019-09-10 08:50:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:50:47,212 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 08:50:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:47,864 INFO L225 Difference]: With dead ends: 440405 [2019-09-10 08:50:47,864 INFO L226 Difference]: Without dead ends: 440405 [2019-09-10 08:50:47,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:50:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440405 states. [2019-09-10 08:50:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440405 to 424125. [2019-09-10 08:50:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424125 states. [2019-09-10 08:50:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424125 states to 424125 states and 621593 transitions. [2019-09-10 08:50:59,417 INFO L78 Accepts]: Start accepts. Automaton has 424125 states and 621593 transitions. Word has length 186 [2019-09-10 08:50:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:59,418 INFO L475 AbstractCegarLoop]: Abstraction has 424125 states and 621593 transitions. [2019-09-10 08:50:59,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:50:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 424125 states and 621593 transitions. [2019-09-10 08:50:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:50:59,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:59,445 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:59,445 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 406993288, now seen corresponding path program 1 times [2019-09-10 08:50:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:59,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:59,548 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:59,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:59,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:59,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:59,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:59,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:59,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:59,551 INFO L87 Difference]: Start difference. First operand 424125 states and 621593 transitions. Second operand 4 states. [2019-09-10 08:51:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:01,473 INFO L93 Difference]: Finished difference Result 596000 states and 873789 transitions. [2019-09-10 08:51:01,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:01,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 08:51:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:04,468 INFO L225 Difference]: With dead ends: 596000 [2019-09-10 08:51:04,469 INFO L226 Difference]: Without dead ends: 596000 [2019-09-10 08:51:04,469 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:51:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596000 states. [2019-09-10 08:51:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596000 to 423908. [2019-09-10 08:51:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423908 states. [2019-09-10 08:51:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423908 states to 423908 states and 621054 transitions. [2019-09-10 08:51:18,157 INFO L78 Accepts]: Start accepts. Automaton has 423908 states and 621054 transitions. Word has length 186 [2019-09-10 08:51:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:18,157 INFO L475 AbstractCegarLoop]: Abstraction has 423908 states and 621054 transitions. [2019-09-10 08:51:18,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 423908 states and 621054 transitions. [2019-09-10 08:51:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:51:18,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:18,178 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:51:18,178 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1575696709, now seen corresponding path program 1 times [2019-09-10 08:51:18,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:18,268 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:51:18,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:18,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:18,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:18,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:18,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:18,270 INFO L87 Difference]: Start difference. First operand 423908 states and 621054 transitions. Second operand 4 states. [2019-09-10 08:51:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:21,596 INFO L93 Difference]: Finished difference Result 794628 states and 1170170 transitions. [2019-09-10 08:51:21,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:21,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 08:51:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:24,553 INFO L225 Difference]: With dead ends: 794628 [2019-09-10 08:51:24,553 INFO L226 Difference]: Without dead ends: 794628 [2019-09-10 08:51:24,554 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:51:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794628 states. [2019-09-10 08:51:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794628 to 422454. [2019-09-10 08:51:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422454 states. [2019-09-10 08:51:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422454 states to 422454 states and 619251 transitions. [2019-09-10 08:51:39,901 INFO L78 Accepts]: Start accepts. Automaton has 422454 states and 619251 transitions. Word has length 186 [2019-09-10 08:51:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:39,902 INFO L475 AbstractCegarLoop]: Abstraction has 422454 states and 619251 transitions. [2019-09-10 08:51:39,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 422454 states and 619251 transitions. [2019-09-10 08:51:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:51:39,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:39,918 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:51:39,919 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1970868392, now seen corresponding path program 1 times [2019-09-10 08:51:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:39,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:39,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:40,047 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:51:40,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:40,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:51:40,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:40,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:51:40,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:51:40,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:40,049 INFO L87 Difference]: Start difference. First operand 422454 states and 619251 transitions. Second operand 5 states. [2019-09-10 08:51:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:42,974 INFO L93 Difference]: Finished difference Result 422456 states and 614622 transitions. [2019-09-10 08:51:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:51:42,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-10 08:51:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:43,660 INFO L225 Difference]: With dead ends: 422456 [2019-09-10 08:51:43,660 INFO L226 Difference]: Without dead ends: 422456 [2019-09-10 08:51:43,661 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:51:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422456 states. [2019-09-10 08:51:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422456 to 407943. [2019-09-10 08:51:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407943 states. [2019-09-10 08:51:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407943 states to 407943 states and 594434 transitions. [2019-09-10 08:51:49,304 INFO L78 Accepts]: Start accepts. Automaton has 407943 states and 594434 transitions. Word has length 186 [2019-09-10 08:51:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:49,304 INFO L475 AbstractCegarLoop]: Abstraction has 407943 states and 594434 transitions. [2019-09-10 08:51:49,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:51:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 407943 states and 594434 transitions. [2019-09-10 08:51:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:51:49,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:49,320 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:51:49,320 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash 114414194, now seen corresponding path program 1 times [2019-09-10 08:51:49,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:49,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:49,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:49,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:56,679 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:51:56,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:56,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:51:56,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:56,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:51:56,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:51:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:51:56,681 INFO L87 Difference]: Start difference. First operand 407943 states and 594434 transitions. Second operand 8 states. [2019-09-10 08:52:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:00,613 INFO L93 Difference]: Finished difference Result 1023331 states and 1463606 transitions. [2019-09-10 08:52:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:52:00,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2019-09-10 08:52:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:02,521 INFO L225 Difference]: With dead ends: 1023331 [2019-09-10 08:52:02,521 INFO L226 Difference]: Without dead ends: 1023331 [2019-09-10 08:52:02,522 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:52:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023331 states. [2019-09-10 08:52:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023331 to 479425. [2019-09-10 08:52:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479425 states. [2019-09-10 08:52:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479425 states to 479425 states and 696961 transitions. [2019-09-10 08:52:15,407 INFO L78 Accepts]: Start accepts. Automaton has 479425 states and 696961 transitions. Word has length 186 [2019-09-10 08:52:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:15,407 INFO L475 AbstractCegarLoop]: Abstraction has 479425 states and 696961 transitions. [2019-09-10 08:52:15,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:52:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 479425 states and 696961 transitions. [2019-09-10 08:52:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:52:15,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:15,427 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:52:15,428 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1456067221, now seen corresponding path program 1 times [2019-09-10 08:52:15,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:15,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:15,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:15,578 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:52:15,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:15,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:52:15,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:15,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:52:15,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:52:15,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:52:15,580 INFO L87 Difference]: Start difference. First operand 479425 states and 696961 transitions. Second operand 8 states. [2019-09-10 08:52:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:20,793 INFO L93 Difference]: Finished difference Result 1217188 states and 1735686 transitions. [2019-09-10 08:52:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:52:20,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2019-09-10 08:52:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:33,170 INFO L225 Difference]: With dead ends: 1217188 [2019-09-10 08:52:33,170 INFO L226 Difference]: Without dead ends: 1217188 [2019-09-10 08:52:33,170 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:52:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217188 states. [2019-09-10 08:52:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217188 to 430573. [2019-09-10 08:52:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430573 states. [2019-09-10 08:52:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430573 states to 430573 states and 616807 transitions. [2019-09-10 08:52:45,375 INFO L78 Accepts]: Start accepts. Automaton has 430573 states and 616807 transitions. Word has length 186 [2019-09-10 08:52:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:45,375 INFO L475 AbstractCegarLoop]: Abstraction has 430573 states and 616807 transitions. [2019-09-10 08:52:45,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:52:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 430573 states and 616807 transitions. [2019-09-10 08:52:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:52:45,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:45,395 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:52:45,395 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash -3741525, now seen corresponding path program 1 times [2019-09-10 08:52:45,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:45,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:46,952 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:52:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:52:46,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:46,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:52:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:52:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:52:46,959 INFO L87 Difference]: Start difference. First operand 430573 states and 616807 transitions. Second operand 21 states. [2019-09-10 08:52:48,018 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:52:48,373 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:52:48,612 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:52:48,899 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 08:52:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:53,754 INFO L93 Difference]: Finished difference Result 469466 states and 671253 transitions. [2019-09-10 08:52:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:52:53,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 08:52:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:54,474 INFO L225 Difference]: With dead ends: 469466 [2019-09-10 08:52:54,474 INFO L226 Difference]: Without dead ends: 469466 [2019-09-10 08:52:54,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:52:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469466 states. [2019-09-10 08:53:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469466 to 431180. [2019-09-10 08:53:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431180 states. [2019-09-10 08:53:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431180 states to 431180 states and 617508 transitions. [2019-09-10 08:53:03,115 INFO L78 Accepts]: Start accepts. Automaton has 431180 states and 617508 transitions. Word has length 186 [2019-09-10 08:53:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:03,116 INFO L475 AbstractCegarLoop]: Abstraction has 431180 states and 617508 transitions. [2019-09-10 08:53:03,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 431180 states and 617508 transitions. [2019-09-10 08:53:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:53:03,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:03,147 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, 1] [2019-09-10 08:53:03,147 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1243154087, now seen corresponding path program 1 times [2019-09-10 08:53:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:03,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:03,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:03,211 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:53:03,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:03,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:03,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:03,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:03,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:03,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:03,213 INFO L87 Difference]: Start difference. First operand 431180 states and 617508 transitions. Second operand 3 states. [2019-09-10 08:53:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:04,624 INFO L93 Difference]: Finished difference Result 481177 states and 683192 transitions. [2019-09-10 08:53:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:04,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:53:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:05,360 INFO L225 Difference]: With dead ends: 481177 [2019-09-10 08:53:05,360 INFO L226 Difference]: Without dead ends: 481177 [2019-09-10 08:53:05,360 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:53:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481177 states. [2019-09-10 08:53:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481177 to 428578. [2019-09-10 08:53:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428578 states. [2019-09-10 08:53:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428578 states to 428578 states and 612536 transitions. [2019-09-10 08:53:18,038 INFO L78 Accepts]: Start accepts. Automaton has 428578 states and 612536 transitions. Word has length 187 [2019-09-10 08:53:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:18,038 INFO L475 AbstractCegarLoop]: Abstraction has 428578 states and 612536 transitions. [2019-09-10 08:53:18,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 428578 states and 612536 transitions. [2019-09-10 08:53:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:53:18,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:18,062 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, 1] [2019-09-10 08:53:18,062 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1833146807, now seen corresponding path program 1 times [2019-09-10 08:53:18,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:18,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:18,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:18,140 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:53:18,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:18,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:18,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:18,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:18,142 INFO L87 Difference]: Start difference. First operand 428578 states and 612536 transitions. Second operand 3 states. [2019-09-10 08:53:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:20,558 INFO L93 Difference]: Finished difference Result 435179 states and 618302 transitions. [2019-09-10 08:53:20,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:20,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:53:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:21,334 INFO L225 Difference]: With dead ends: 435179 [2019-09-10 08:53:21,334 INFO L226 Difference]: Without dead ends: 435179 [2019-09-10 08:53:21,335 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:53:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435179 states. [2019-09-10 08:53:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435179 to 426535. [2019-09-10 08:53:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426535 states. [2019-09-10 08:53:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426535 states to 426535 states and 608440 transitions. [2019-09-10 08:53:27,862 INFO L78 Accepts]: Start accepts. Automaton has 426535 states and 608440 transitions. Word has length 187 [2019-09-10 08:53:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:27,863 INFO L475 AbstractCegarLoop]: Abstraction has 426535 states and 608440 transitions. [2019-09-10 08:53:27,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 426535 states and 608440 transitions. [2019-09-10 08:53:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:53:27,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:27,884 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, 1] [2019-09-10 08:53:27,884 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash 824620170, now seen corresponding path program 1 times [2019-09-10 08:53:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:27,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:29,050 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:53:29,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:29,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:29,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:29,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:29,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:29,052 INFO L87 Difference]: Start difference. First operand 426535 states and 608440 transitions. Second operand 3 states. [2019-09-10 08:53:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:30,145 INFO L93 Difference]: Finished difference Result 447803 states and 633498 transitions. [2019-09-10 08:53:30,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:30,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:53:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:30,848 INFO L225 Difference]: With dead ends: 447803 [2019-09-10 08:53:30,848 INFO L226 Difference]: Without dead ends: 447803 [2019-09-10 08:53:30,849 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:53:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447803 states. [2019-09-10 08:53:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447803 to 417101. [2019-09-10 08:53:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417101 states. [2019-09-10 08:53:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417101 states to 417101 states and 592811 transitions. [2019-09-10 08:53:43,656 INFO L78 Accepts]: Start accepts. Automaton has 417101 states and 592811 transitions. Word has length 187 [2019-09-10 08:53:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:43,656 INFO L475 AbstractCegarLoop]: Abstraction has 417101 states and 592811 transitions. [2019-09-10 08:53:43,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 417101 states and 592811 transitions. [2019-09-10 08:53:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:53:43,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:43,678 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, 1] [2019-09-10 08:53:43,678 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -887127955, now seen corresponding path program 1 times [2019-09-10 08:53:43,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:43,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:43,732 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:53:43,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:43,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:43,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:43,734 INFO L87 Difference]: Start difference. First operand 417101 states and 592811 transitions. Second operand 3 states. [2019-09-10 08:53:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:44,868 INFO L93 Difference]: Finished difference Result 414313 states and 587225 transitions. [2019-09-10 08:53:44,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:44,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:53:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:45,592 INFO L225 Difference]: With dead ends: 414313 [2019-09-10 08:53:45,592 INFO L226 Difference]: Without dead ends: 414313 [2019-09-10 08:53:45,592 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:53:47,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414313 states. [2019-09-10 08:53:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414313 to 414313. [2019-09-10 08:53:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414313 states. [2019-09-10 08:53:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414313 states to 414313 states and 587225 transitions. [2019-09-10 08:53:53,690 INFO L78 Accepts]: Start accepts. Automaton has 414313 states and 587225 transitions. Word has length 187 [2019-09-10 08:53:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:53,691 INFO L475 AbstractCegarLoop]: Abstraction has 414313 states and 587225 transitions. [2019-09-10 08:53:53,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 414313 states and 587225 transitions. [2019-09-10 08:53:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:53:53,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:53,716 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, 1] [2019-09-10 08:53:53,716 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1634669496, now seen corresponding path program 1 times [2019-09-10 08:53:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:53,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:53,773 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:53:53,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:53,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:53,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:53,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:53,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:53,775 INFO L87 Difference]: Start difference. First operand 414313 states and 587225 transitions. Second operand 3 states. [2019-09-10 08:53:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:54,848 INFO L93 Difference]: Finished difference Result 412109 states and 582809 transitions. [2019-09-10 08:53:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:54,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:53:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:01,604 INFO L225 Difference]: With dead ends: 412109 [2019-09-10 08:54:01,605 INFO L226 Difference]: Without dead ends: 412109 [2019-09-10 08:54:01,605 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:54:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412109 states. [2019-09-10 08:54:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412109 to 412109. [2019-09-10 08:54:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412109 states. [2019-09-10 08:54:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412109 states to 412109 states and 582809 transitions. [2019-09-10 08:54:06,703 INFO L78 Accepts]: Start accepts. Automaton has 412109 states and 582809 transitions. Word has length 187 [2019-09-10 08:54:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:06,703 INFO L475 AbstractCegarLoop]: Abstraction has 412109 states and 582809 transitions. [2019-09-10 08:54:06,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 412109 states and 582809 transitions. [2019-09-10 08:54:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:54:06,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:06,725 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, 1] [2019-09-10 08:54:06,725 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1488276300, now seen corresponding path program 1 times [2019-09-10 08:54:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:06,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:06,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:06,782 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:54:06,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:06,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:06,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:06,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:06,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:06,784 INFO L87 Difference]: Start difference. First operand 412109 states and 582809 transitions. Second operand 3 states. [2019-09-10 08:54:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:09,517 INFO L93 Difference]: Finished difference Result 396773 states and 559663 transitions. [2019-09-10 08:54:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:09,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:54:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:10,191 INFO L225 Difference]: With dead ends: 396773 [2019-09-10 08:54:10,191 INFO L226 Difference]: Without dead ends: 396773 [2019-09-10 08:54:10,191 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:54:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396773 states. [2019-09-10 08:54:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396773 to 396773. [2019-09-10 08:54:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396773 states. [2019-09-10 08:54:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396773 states to 396773 states and 559663 transitions. [2019-09-10 08:54:16,381 INFO L78 Accepts]: Start accepts. Automaton has 396773 states and 559663 transitions. Word has length 187 [2019-09-10 08:54:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:16,381 INFO L475 AbstractCegarLoop]: Abstraction has 396773 states and 559663 transitions. [2019-09-10 08:54:16,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 396773 states and 559663 transitions. [2019-09-10 08:54:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:54:16,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:16,396 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, 1, 1, 1] [2019-09-10 08:54:16,396 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2031085770, now seen corresponding path program 1 times [2019-09-10 08:54:16,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:16,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:16,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:17,234 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-09-10 08:54:18,108 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:54:18,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:54:18,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:18,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:54:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:54:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:54:18,109 INFO L87 Difference]: Start difference. First operand 396773 states and 559663 transitions. Second operand 26 states. [2019-09-10 08:54:18,721 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:54:19,015 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:54:19,207 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:54:19,514 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 08:54:20,695 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 08:54:21,584 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:54:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:32,782 INFO L93 Difference]: Finished difference Result 491565 states and 693959 transitions. [2019-09-10 08:54:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:54:32,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 189 [2019-09-10 08:54:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:33,617 INFO L225 Difference]: With dead ends: 491565 [2019-09-10 08:54:33,618 INFO L226 Difference]: Without dead ends: 491565 [2019-09-10 08:54:33,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=404, Invalid=2046, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:54:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491565 states. [2019-09-10 08:54:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491565 to 397939. [2019-09-10 08:54:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397939 states. [2019-09-10 08:54:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397939 states to 397939 states and 561002 transitions. [2019-09-10 08:54:40,100 INFO L78 Accepts]: Start accepts. Automaton has 397939 states and 561002 transitions. Word has length 189 [2019-09-10 08:54:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:40,101 INFO L475 AbstractCegarLoop]: Abstraction has 397939 states and 561002 transitions. [2019-09-10 08:54:40,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:54:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 397939 states and 561002 transitions. [2019-09-10 08:54:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:54:40,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:40,119 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, 1, 1, 1] [2019-09-10 08:54:40,119 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1244964279, now seen corresponding path program 1 times [2019-09-10 08:54:40,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:40,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:40,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:40,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:41,183 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:54:41,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:41,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:54:41,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:41,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:54:41,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:54:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:54:41,185 INFO L87 Difference]: Start difference. First operand 397939 states and 561002 transitions. Second operand 22 states. [2019-09-10 08:54:41,944 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 08:54:42,129 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 08:54:42,469 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:54:42,758 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:54:43,044 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:54:43,352 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:54:43,587 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:54:43,894 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:54:45,101 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:54:45,250 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-09-10 08:54:45,475 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:54:45,754 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:54:46,327 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:54:46,597 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:54:46,843 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:54:47,126 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:54:47,355 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:54:47,648 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:54:47,894 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:54:48,217 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:54:48,554 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:54:49,104 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:54:49,385 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 08:54:49,911 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:54:50,230 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:54:50,465 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:54:50,739 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:54:50,984 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:54:51,213 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:54:52,111 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:54:52,809 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:54:53,145 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:54:53,461 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:54:53,744 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:54:54,051 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:54:54,255 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 08:54:55,258 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:54:56,040 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:54:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:56,754 INFO L93 Difference]: Finished difference Result 476095 states and 668788 transitions. [2019-09-10 08:54:56,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 08:54:56,754 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 189 [2019-09-10 08:54:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:57,562 INFO L225 Difference]: With dead ends: 476095 [2019-09-10 08:54:57,562 INFO L226 Difference]: Without dead ends: 476095 [2019-09-10 08:54:57,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1014, Invalid=3146, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:54:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476095 states. [2019-09-10 08:55:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476095 to 398589. [2019-09-10 08:55:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398589 states. [2019-09-10 08:55:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398589 states to 398589 states and 561706 transitions. [2019-09-10 08:55:05,263 INFO L78 Accepts]: Start accepts. Automaton has 398589 states and 561706 transitions. Word has length 189 [2019-09-10 08:55:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:05,264 INFO L475 AbstractCegarLoop]: Abstraction has 398589 states and 561706 transitions. [2019-09-10 08:55:05,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:55:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 398589 states and 561706 transitions. [2019-09-10 08:55:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:55:05,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:05,290 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, 1, 1, 1] [2019-09-10 08:55:05,290 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1126183451, now seen corresponding path program 1 times [2019-09-10 08:55:05,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:05,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:05,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:05,494 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:55:05,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:05,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:55:05,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:05,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:55:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:55:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:55:05,498 INFO L87 Difference]: Start difference. First operand 398589 states and 561706 transitions. Second operand 8 states. [2019-09-10 08:55:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:07,117 INFO L93 Difference]: Finished difference Result 351149 states and 492245 transitions. [2019-09-10 08:55:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:07,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 189 [2019-09-10 08:55:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:08,009 INFO L225 Difference]: With dead ends: 351149 [2019-09-10 08:55:08,009 INFO L226 Difference]: Without dead ends: 351149 [2019-09-10 08:55:08,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:55:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351149 states.