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_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:23:50,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:23:50,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:23:50,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:23:50,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:23:50,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:23:50,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:23:50,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:23:50,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:23:50,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:23:50,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:23:50,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:23:50,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:23:50,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:23:50,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:23:50,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:23:50,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:23:50,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:23:50,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:23:50,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:23:50,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:23:50,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:23:50,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:23:50,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:23:50,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:23:50,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:23:50,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:23:50,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:23:50,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:23:50,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:23:50,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:23:50,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:23:50,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:23:50,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:23:50,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:23:50,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:23:50,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:23:50,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:23:50,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:23:50,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:23:50,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:23:50,165 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:23:50,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:23:50,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:23:50,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:23:50,180 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:23:50,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:23:50,181 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:23:50,181 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:23:50,182 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:23:50,182 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:23:50,182 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:23:50,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:23:50,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:23:50,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:23:50,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:23:50,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:23:50,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:23:50,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:23:50,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:23:50,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:23:50,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:23:50,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:23:50,185 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:23:50,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:23:50,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:23:50,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:23:50,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:23:50,186 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:23:50,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:23:50,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:23:50,186 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:23:50,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:23:50,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:23:50,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:23:50,233 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:23:50,234 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:23:50,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-10 08:23:50,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9cae88a/af5e1f4ce8a5497ebeab566091ff02e4/FLAG5cd0f5742 [2019-09-10 08:23:50,775 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:23:50,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-10 08:23:50,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9cae88a/af5e1f4ce8a5497ebeab566091ff02e4/FLAG5cd0f5742 [2019-09-10 08:23:51,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9cae88a/af5e1f4ce8a5497ebeab566091ff02e4 [2019-09-10 08:23:51,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:23:51,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:23:51,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:23:51,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:23:51,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:23:51,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1beffccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51, skipping insertion in model container [2019-09-10 08:23:51,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,101 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:23:51,175 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:23:51,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:23:51,737 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:23:51,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:23:51,878 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:23:51,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51 WrapperNode [2019-09-10 08:23:51,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:23:51,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:23:51,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:23:51,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:23:51,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (1/1) ... [2019-09-10 08:23:51,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:23:51,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:23:51,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:23:51,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:23:51,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (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:23:52,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:23:52,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:23:52,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:23:52,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:23:52,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:23:52,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:23:52,050 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:23:52,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:23:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:23:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:23:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:23:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:23:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:23:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:23:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:23:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:23:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:23:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:23:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:23:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:23:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:23:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:23:53,259 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:23:53,260 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:23:53,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:23:53 BoogieIcfgContainer [2019-09-10 08:23:53,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:23:53,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:23:53,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:23:53,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:23:53,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:23:51" (1/3) ... [2019-09-10 08:23:53,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0353ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:23:53, skipping insertion in model container [2019-09-10 08:23:53,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:23:51" (2/3) ... [2019-09-10 08:23:53,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0353ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:23:53, skipping insertion in model container [2019-09-10 08:23:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:23:53" (3/3) ... [2019-09-10 08:23:53,287 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-10 08:23:53,298 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:23:53,321 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:23:53,340 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:23:53,371 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:23:53,372 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:23:53,372 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:23:53,372 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:23:53,372 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:23:53,373 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:23:53,373 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:23:53,373 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:23:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-09-10 08:23:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:23:53,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:53,438 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] [2019-09-10 08:23:53,440 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1051248920, now seen corresponding path program 1 times [2019-09-10 08:23:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:53,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:53,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:53,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:54,084 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:23:54,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:54,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:54,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:54,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:54,116 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-09-10 08:23:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:54,287 INFO L93 Difference]: Finished difference Result 314 states and 526 transitions. [2019-09-10 08:23:54,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:54,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 08:23:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:54,306 INFO L225 Difference]: With dead ends: 314 [2019-09-10 08:23:54,306 INFO L226 Difference]: Without dead ends: 306 [2019-09-10 08:23:54,308 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:23:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-10 08:23:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-10 08:23:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:23:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 434 transitions. [2019-09-10 08:23:54,380 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 434 transitions. Word has length 112 [2019-09-10 08:23:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:54,381 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 434 transitions. [2019-09-10 08:23:54,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 434 transitions. [2019-09-10 08:23:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:54,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:54,384 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] [2019-09-10 08:23:54,385 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash -458569337, now seen corresponding path program 1 times [2019-09-10 08:23:54,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:54,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:54,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:54,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:54,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:54,694 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:23:54,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:54,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:54,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:54,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:54,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:54,698 INFO L87 Difference]: Start difference. First operand 304 states and 434 transitions. Second operand 5 states. [2019-09-10 08:23:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:55,190 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2019-09-10 08:23:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:55,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 08:23:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:55,195 INFO L225 Difference]: With dead ends: 507 [2019-09-10 08:23:55,196 INFO L226 Difference]: Without dead ends: 507 [2019-09-10 08:23:55,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-10 08:23:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2019-09-10 08:23:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 750 transitions. [2019-09-10 08:23:55,226 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 750 transitions. Word has length 114 [2019-09-10 08:23:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:55,227 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 750 transitions. [2019-09-10 08:23:55,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 750 transitions. [2019-09-10 08:23:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:23:55,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:55,231 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] [2019-09-10 08:23:55,231 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash 140292373, now seen corresponding path program 1 times [2019-09-10 08:23:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:55,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:55,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:55,449 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:23:55,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:55,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:55,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:55,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:55,457 INFO L87 Difference]: Start difference. First operand 505 states and 750 transitions. Second operand 5 states. [2019-09-10 08:23:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:55,700 INFO L93 Difference]: Finished difference Result 505 states and 745 transitions. [2019-09-10 08:23:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:55,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-10 08:23:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:55,707 INFO L225 Difference]: With dead ends: 505 [2019-09-10 08:23:55,707 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:23:55,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:23:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:23:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 745 transitions. [2019-09-10 08:23:55,742 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 745 transitions. Word has length 115 [2019-09-10 08:23:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 745 transitions. [2019-09-10 08:23:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 745 transitions. [2019-09-10 08:23:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:55,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:55,747 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] [2019-09-10 08:23:55,747 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1606063222, now seen corresponding path program 1 times [2019-09-10 08:23:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:55,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:55,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:55,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:23:55,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:55,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:55,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:55,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:55,943 INFO L87 Difference]: Start difference. First operand 505 states and 745 transitions. Second operand 5 states. [2019-09-10 08:23:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:56,144 INFO L93 Difference]: Finished difference Result 505 states and 740 transitions. [2019-09-10 08:23:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:56,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-10 08:23:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:56,148 INFO L225 Difference]: With dead ends: 505 [2019-09-10 08:23:56,148 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:23:56,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:23:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:23:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 740 transitions. [2019-09-10 08:23:56,165 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 740 transitions. Word has length 116 [2019-09-10 08:23:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:56,166 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 740 transitions. [2019-09-10 08:23:56,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 740 transitions. [2019-09-10 08:23:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:23:56,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:56,168 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] [2019-09-10 08:23:56,168 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1122053542, now seen corresponding path program 1 times [2019-09-10 08:23:56,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:56,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:56,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:56,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:56,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:56,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:56,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:56,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:56,295 INFO L87 Difference]: Start difference. First operand 505 states and 740 transitions. Second operand 5 states. [2019-09-10 08:23:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:56,495 INFO L93 Difference]: Finished difference Result 505 states and 735 transitions. [2019-09-10 08:23:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:56,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-10 08:23:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:56,500 INFO L225 Difference]: With dead ends: 505 [2019-09-10 08:23:56,500 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:23:56,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:23:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:23:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 735 transitions. [2019-09-10 08:23:56,516 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 735 transitions. Word has length 117 [2019-09-10 08:23:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:56,516 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 735 transitions. [2019-09-10 08:23:56,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 735 transitions. [2019-09-10 08:23:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:23:56,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:56,518 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] [2019-09-10 08:23:56,519 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1734849881, now seen corresponding path program 1 times [2019-09-10 08:23:56,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:56,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:56,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:56,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:56,695 INFO L87 Difference]: Start difference. First operand 505 states and 735 transitions. Second operand 5 states. [2019-09-10 08:23:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:56,898 INFO L93 Difference]: Finished difference Result 505 states and 730 transitions. [2019-09-10 08:23:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:56,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-10 08:23:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:56,902 INFO L225 Difference]: With dead ends: 505 [2019-09-10 08:23:56,902 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:23:56,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:23:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:23:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 730 transitions. [2019-09-10 08:23:56,920 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 730 transitions. Word has length 118 [2019-09-10 08:23:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:56,927 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 730 transitions. [2019-09-10 08:23:56,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 730 transitions. [2019-09-10 08:23:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:23:56,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:56,936 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] [2019-09-10 08:23:56,939 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1494263947, now seen corresponding path program 1 times [2019-09-10 08:23:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:57,077 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:23:57,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:57,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:57,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:57,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:57,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:57,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:57,080 INFO L87 Difference]: Start difference. First operand 505 states and 730 transitions. Second operand 5 states. [2019-09-10 08:23:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:57,253 INFO L93 Difference]: Finished difference Result 505 states and 725 transitions. [2019-09-10 08:23:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:57,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-10 08:23:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:57,256 INFO L225 Difference]: With dead ends: 505 [2019-09-10 08:23:57,257 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:23:57,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:23:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:23:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 725 transitions. [2019-09-10 08:23:57,272 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 725 transitions. Word has length 119 [2019-09-10 08:23:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:57,272 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 725 transitions. [2019-09-10 08:23:57,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 725 transitions. [2019-09-10 08:23:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:23:57,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:57,274 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] [2019-09-10 08:23:57,274 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash 776973317, now seen corresponding path program 1 times [2019-09-10 08:23:57,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:57,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:57,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:57,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:23:57,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:57,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:23:57,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:23:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:23:57,404 INFO L87 Difference]: Start difference. First operand 505 states and 725 transitions. Second operand 5 states. [2019-09-10 08:23:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:57,667 INFO L93 Difference]: Finished difference Result 505 states and 720 transitions. [2019-09-10 08:23:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:57,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:23:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:57,671 INFO L225 Difference]: With dead ends: 505 [2019-09-10 08:23:57,671 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:23:57,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:23:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:23:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:23:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 720 transitions. [2019-09-10 08:23:57,685 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 720 transitions. Word has length 120 [2019-09-10 08:23:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:57,685 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 720 transitions. [2019-09-10 08:23:57,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 720 transitions. [2019-09-10 08:23:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:23:57,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:57,687 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] [2019-09-10 08:23:57,687 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -510022136, now seen corresponding path program 1 times [2019-09-10 08:23:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:57,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:57,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:57,936 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:23:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:57,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:57,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:57,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:57,939 INFO L87 Difference]: Start difference. First operand 505 states and 720 transitions. Second operand 9 states. [2019-09-10 08:23:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:58,275 INFO L93 Difference]: Finished difference Result 2572 states and 3820 transitions. [2019-09-10 08:23:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:58,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:23:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:58,288 INFO L225 Difference]: With dead ends: 2572 [2019-09-10 08:23:58,288 INFO L226 Difference]: Without dead ends: 2572 [2019-09-10 08:23:58,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:23:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-09-10 08:23:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 658. [2019-09-10 08:23:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-10 08:23:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 951 transitions. [2019-09-10 08:23:58,324 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 951 transitions. Word has length 121 [2019-09-10 08:23:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:58,324 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 951 transitions. [2019-09-10 08:23:58,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 951 transitions. [2019-09-10 08:23:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:23:58,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:58,326 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] [2019-09-10 08:23:58,327 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 780943061, now seen corresponding path program 1 times [2019-09-10 08:23:58,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:58,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:58,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:58,587 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:23:58,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:58,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:58,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:58,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:58,589 INFO L87 Difference]: Start difference. First operand 658 states and 951 transitions. Second operand 9 states. [2019-09-10 08:23:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:58,877 INFO L93 Difference]: Finished difference Result 2742 states and 4079 transitions. [2019-09-10 08:23:58,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:58,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:23:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:58,892 INFO L225 Difference]: With dead ends: 2742 [2019-09-10 08:23:58,892 INFO L226 Difference]: Without dead ends: 2742 [2019-09-10 08:23:58,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-09-10 08:23:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1048. [2019-09-10 08:23:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-10 08:23:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1545 transitions. [2019-09-10 08:23:58,948 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1545 transitions. Word has length 121 [2019-09-10 08:23:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:58,949 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1545 transitions. [2019-09-10 08:23:58,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1545 transitions. [2019-09-10 08:23:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:23:58,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:58,952 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] [2019-09-10 08:23:58,952 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:58,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -909475221, now seen corresponding path program 1 times [2019-09-10 08:23:58,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:58,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:58,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:59,169 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:23:59,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:59,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:59,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:59,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:59,171 INFO L87 Difference]: Start difference. First operand 1048 states and 1545 transitions. Second operand 9 states. [2019-09-10 08:23:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:59,420 INFO L93 Difference]: Finished difference Result 2882 states and 4292 transitions. [2019-09-10 08:23:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:59,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:23:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:59,435 INFO L225 Difference]: With dead ends: 2882 [2019-09-10 08:23:59,435 INFO L226 Difference]: Without dead ends: 2882 [2019-09-10 08:23:59,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2019-09-10 08:23:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1218. [2019-09-10 08:23:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-10 08:23:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1802 transitions. [2019-09-10 08:23:59,489 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1802 transitions. Word has length 121 [2019-09-10 08:23:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:59,490 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1802 transitions. [2019-09-10 08:23:59,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1802 transitions. [2019-09-10 08:23:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:23:59,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:59,493 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] [2019-09-10 08:23:59,494 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1121640156, now seen corresponding path program 1 times [2019-09-10 08:23:59,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:59,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:59,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:59,857 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:23:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:59,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:59,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:59,860 INFO L87 Difference]: Start difference. First operand 1218 states and 1802 transitions. Second operand 9 states. [2019-09-10 08:24:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:00,151 INFO L93 Difference]: Finished difference Result 3022 states and 4503 transitions. [2019-09-10 08:24:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:24:00,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:24:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:00,168 INFO L225 Difference]: With dead ends: 3022 [2019-09-10 08:24:00,168 INFO L226 Difference]: Without dead ends: 3022 [2019-09-10 08:24:00,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:24:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-10 08:24:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1378. [2019-09-10 08:24:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-09-10 08:24:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2043 transitions. [2019-09-10 08:24:00,222 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2043 transitions. Word has length 121 [2019-09-10 08:24:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:00,223 INFO L475 AbstractCegarLoop]: Abstraction has 1378 states and 2043 transitions. [2019-09-10 08:24:00,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2043 transitions. [2019-09-10 08:24:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:24:00,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:00,225 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] [2019-09-10 08:24:00,225 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2117519461, now seen corresponding path program 1 times [2019-09-10 08:24:00,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:00,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:00,311 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:24:00,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:00,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:00,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:00,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:00,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:00,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:00,314 INFO L87 Difference]: Start difference. First operand 1378 states and 2043 transitions. Second operand 3 states. [2019-09-10 08:24:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:00,379 INFO L93 Difference]: Finished difference Result 2170 states and 3215 transitions. [2019-09-10 08:24:00,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:00,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:24:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:00,392 INFO L225 Difference]: With dead ends: 2170 [2019-09-10 08:24:00,392 INFO L226 Difference]: Without dead ends: 2170 [2019-09-10 08:24:00,393 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:24:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-09-10 08:24:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2168. [2019-09-10 08:24:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-09-10 08:24:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3214 transitions. [2019-09-10 08:24:00,460 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3214 transitions. Word has length 121 [2019-09-10 08:24:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:00,461 INFO L475 AbstractCegarLoop]: Abstraction has 2168 states and 3214 transitions. [2019-09-10 08:24:00,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3214 transitions. [2019-09-10 08:24:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:24:00,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:00,464 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] [2019-09-10 08:24:00,464 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1936230108, now seen corresponding path program 1 times [2019-09-10 08:24:00,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:00,540 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:24:00,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:00,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:00,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:00,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:00,542 INFO L87 Difference]: Start difference. First operand 2168 states and 3214 transitions. Second operand 3 states. [2019-09-10 08:24:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:00,583 INFO L93 Difference]: Finished difference Result 3908 states and 5749 transitions. [2019-09-10 08:24:00,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:00,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:24:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:00,604 INFO L225 Difference]: With dead ends: 3908 [2019-09-10 08:24:00,604 INFO L226 Difference]: Without dead ends: 3908 [2019-09-10 08:24:00,604 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:24:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-09-10 08:24:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3906. [2019-09-10 08:24:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2019-09-10 08:24:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 5748 transitions. [2019-09-10 08:24:00,699 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 5748 transitions. Word has length 121 [2019-09-10 08:24:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:00,700 INFO L475 AbstractCegarLoop]: Abstraction has 3906 states and 5748 transitions. [2019-09-10 08:24:00,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 5748 transitions. [2019-09-10 08:24:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:24:00,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:00,703 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] [2019-09-10 08:24:00,703 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1496063070, now seen corresponding path program 1 times [2019-09-10 08:24:00,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:00,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:00,901 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:24:00,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:00,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:00,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:00,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:00,903 INFO L87 Difference]: Start difference. First operand 3906 states and 5748 transitions. Second operand 5 states. [2019-09-10 08:24:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:01,003 INFO L93 Difference]: Finished difference Result 4528 states and 6658 transitions. [2019-09-10 08:24:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:24:01,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:24:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:01,043 INFO L225 Difference]: With dead ends: 4528 [2019-09-10 08:24:01,043 INFO L226 Difference]: Without dead ends: 4528 [2019-09-10 08:24:01,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2019-09-10 08:24:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4208. [2019-09-10 08:24:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4208 states. [2019-09-10 08:24:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 6196 transitions. [2019-09-10 08:24:01,163 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 6196 transitions. Word has length 121 [2019-09-10 08:24:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:01,164 INFO L475 AbstractCegarLoop]: Abstraction has 4208 states and 6196 transitions. [2019-09-10 08:24:01,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 6196 transitions. [2019-09-10 08:24:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:24:01,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:01,168 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] [2019-09-10 08:24:01,168 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash -222165262, now seen corresponding path program 1 times [2019-09-10 08:24:01,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:01,348 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:24:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:01,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:01,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:01,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:01,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:01,352 INFO L87 Difference]: Start difference. First operand 4208 states and 6196 transitions. Second operand 5 states. [2019-09-10 08:24:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:01,464 INFO L93 Difference]: Finished difference Result 4976 states and 7324 transitions. [2019-09-10 08:24:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:24:01,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:24:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:01,477 INFO L225 Difference]: With dead ends: 4976 [2019-09-10 08:24:01,477 INFO L226 Difference]: Without dead ends: 4976 [2019-09-10 08:24:01,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-09-10 08:24:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4532. [2019-09-10 08:24:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4532 states. [2019-09-10 08:24:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6678 transitions. [2019-09-10 08:24:01,570 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6678 transitions. Word has length 121 [2019-09-10 08:24:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:01,571 INFO L475 AbstractCegarLoop]: Abstraction has 4532 states and 6678 transitions. [2019-09-10 08:24:01,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6678 transitions. [2019-09-10 08:24:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:24:01,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:01,573 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] [2019-09-10 08:24:01,573 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash -684921793, now seen corresponding path program 1 times [2019-09-10 08:24:01,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:01,786 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:24:01,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:01,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:01,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:01,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:01,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:01,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:01,789 INFO L87 Difference]: Start difference. First operand 4532 states and 6678 transitions. Second operand 9 states. [2019-09-10 08:24:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:02,249 INFO L93 Difference]: Finished difference Result 11957 states and 17677 transitions. [2019-09-10 08:24:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:24:02,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:24:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:02,282 INFO L225 Difference]: With dead ends: 11957 [2019-09-10 08:24:02,282 INFO L226 Difference]: Without dead ends: 11957 [2019-09-10 08:24:02,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:24:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11957 states. [2019-09-10 08:24:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11957 to 5159. [2019-09-10 08:24:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-09-10 08:24:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 7607 transitions. [2019-09-10 08:24:02,516 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 7607 transitions. Word has length 121 [2019-09-10 08:24:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:02,516 INFO L475 AbstractCegarLoop]: Abstraction has 5159 states and 7607 transitions. [2019-09-10 08:24:02,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 7607 transitions. [2019-09-10 08:24:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:24:02,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:02,520 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] [2019-09-10 08:24:02,520 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1220503032, now seen corresponding path program 1 times [2019-09-10 08:24:02,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:02,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:02,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:02,639 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:24:02,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:02,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:02,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:02,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:02,641 INFO L87 Difference]: Start difference. First operand 5159 states and 7607 transitions. Second operand 5 states. [2019-09-10 08:24:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:02,719 INFO L93 Difference]: Finished difference Result 8771 states and 12905 transitions. [2019-09-10 08:24:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:24:02,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-10 08:24:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:02,737 INFO L225 Difference]: With dead ends: 8771 [2019-09-10 08:24:02,737 INFO L226 Difference]: Without dead ends: 8771 [2019-09-10 08:24:02,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8771 states. [2019-09-10 08:24:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8771 to 5191. [2019-09-10 08:24:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5191 states. [2019-09-10 08:24:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7625 transitions. [2019-09-10 08:24:02,878 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7625 transitions. Word has length 122 [2019-09-10 08:24:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:02,879 INFO L475 AbstractCegarLoop]: Abstraction has 5191 states and 7625 transitions. [2019-09-10 08:24:02,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7625 transitions. [2019-09-10 08:24:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:24:02,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:02,882 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] [2019-09-10 08:24:02,882 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash 124379524, now seen corresponding path program 1 times [2019-09-10 08:24:02,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:02,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:02,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:03,030 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:24:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:24:03,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:03,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:24:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:24:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:24:03,032 INFO L87 Difference]: Start difference. First operand 5191 states and 7625 transitions. Second operand 4 states. [2019-09-10 08:24:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:03,096 INFO L93 Difference]: Finished difference Result 7392 states and 10833 transitions. [2019-09-10 08:24:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:24:03,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-10 08:24:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:03,112 INFO L225 Difference]: With dead ends: 7392 [2019-09-10 08:24:03,112 INFO L226 Difference]: Without dead ends: 7392 [2019-09-10 08:24:03,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:24:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-09-10 08:24:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7390. [2019-09-10 08:24:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-09-10 08:24:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10832 transitions. [2019-09-10 08:24:03,300 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10832 transitions. Word has length 122 [2019-09-10 08:24:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:03,301 INFO L475 AbstractCegarLoop]: Abstraction has 7390 states and 10832 transitions. [2019-09-10 08:24:03,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:24:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10832 transitions. [2019-09-10 08:24:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:24:03,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:03,307 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] [2019-09-10 08:24:03,307 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash -605502652, now seen corresponding path program 1 times [2019-09-10 08:24:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:03,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:03,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:03,601 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:24:03,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:03,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:03,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:03,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:03,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:03,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:03,603 INFO L87 Difference]: Start difference. First operand 7390 states and 10832 transitions. Second operand 9 states. [2019-09-10 08:24:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:04,267 INFO L93 Difference]: Finished difference Result 14459 states and 21213 transitions. [2019-09-10 08:24:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:24:04,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:24:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:04,296 INFO L225 Difference]: With dead ends: 14459 [2019-09-10 08:24:04,297 INFO L226 Difference]: Without dead ends: 14459 [2019-09-10 08:24:04,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:24:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14459 states. [2019-09-10 08:24:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14459 to 7390. [2019-09-10 08:24:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-09-10 08:24:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10831 transitions. [2019-09-10 08:24:04,498 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10831 transitions. Word has length 123 [2019-09-10 08:24:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:04,499 INFO L475 AbstractCegarLoop]: Abstraction has 7390 states and 10831 transitions. [2019-09-10 08:24:04,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10831 transitions. [2019-09-10 08:24:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:24:04,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:04,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:04,502 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1823653614, now seen corresponding path program 1 times [2019-09-10 08:24:04,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:04,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:04,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:04,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:04,822 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:24:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:04,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:04,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:04,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:04,825 INFO L87 Difference]: Start difference. First operand 7390 states and 10831 transitions. Second operand 10 states. [2019-09-10 08:24:05,150 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-09-10 08:24:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:06,197 INFO L93 Difference]: Finished difference Result 27706 states and 40202 transitions. [2019-09-10 08:24:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:24:06,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-10 08:24:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:06,245 INFO L225 Difference]: With dead ends: 27706 [2019-09-10 08:24:06,245 INFO L226 Difference]: Without dead ends: 27706 [2019-09-10 08:24:06,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:24:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27706 states. [2019-09-10 08:24:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27706 to 7435. [2019-09-10 08:24:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-09-10 08:24:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 10891 transitions. [2019-09-10 08:24:06,485 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 10891 transitions. Word has length 123 [2019-09-10 08:24:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:06,486 INFO L475 AbstractCegarLoop]: Abstraction has 7435 states and 10891 transitions. [2019-09-10 08:24:06,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 10891 transitions. [2019-09-10 08:24:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:24:06,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:06,489 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] [2019-09-10 08:24:06,489 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash 837612680, now seen corresponding path program 1 times [2019-09-10 08:24:06,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:06,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:06,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:06,784 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:24:06,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:06,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:06,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:06,786 INFO L87 Difference]: Start difference. First operand 7435 states and 10891 transitions. Second operand 10 states. [2019-09-10 08:24:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:08,284 INFO L93 Difference]: Finished difference Result 12549 states and 18324 transitions. [2019-09-10 08:24:08,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:24:08,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-10 08:24:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:08,309 INFO L225 Difference]: With dead ends: 12549 [2019-09-10 08:24:08,309 INFO L226 Difference]: Without dead ends: 12549 [2019-09-10 08:24:08,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:24:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12549 states. [2019-09-10 08:24:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12549 to 7435. [2019-09-10 08:24:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-09-10 08:24:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 10888 transitions. [2019-09-10 08:24:08,476 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 10888 transitions. Word has length 123 [2019-09-10 08:24:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:08,477 INFO L475 AbstractCegarLoop]: Abstraction has 7435 states and 10888 transitions. [2019-09-10 08:24:08,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 10888 transitions. [2019-09-10 08:24:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:24:08,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:08,479 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] [2019-09-10 08:24:08,480 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash 641176039, now seen corresponding path program 1 times [2019-09-10 08:24:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:08,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:08,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:08,577 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:24:08,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:08,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:08,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:08,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:08,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:08,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:08,579 INFO L87 Difference]: Start difference. First operand 7435 states and 10888 transitions. Second operand 3 states. [2019-09-10 08:24:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:08,631 INFO L93 Difference]: Finished difference Result 14128 states and 20691 transitions. [2019-09-10 08:24:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:08,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:24:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:08,652 INFO L225 Difference]: With dead ends: 14128 [2019-09-10 08:24:08,652 INFO L226 Difference]: Without dead ends: 14128 [2019-09-10 08:24:08,653 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:24:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14128 states. [2019-09-10 08:24:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14128 to 13750. [2019-09-10 08:24:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-10 08:24:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20032 transitions. [2019-09-10 08:24:08,913 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20032 transitions. Word has length 124 [2019-09-10 08:24:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:08,914 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20032 transitions. [2019-09-10 08:24:08,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20032 transitions. [2019-09-10 08:24:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:24:08,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:08,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] [2019-09-10 08:24:08,918 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1077053863, now seen corresponding path program 1 times [2019-09-10 08:24:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:08,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:08,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:08,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:09,282 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:24:09,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:09,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:09,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:09,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:09,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:09,289 INFO L87 Difference]: Start difference. First operand 13750 states and 20032 transitions. Second operand 10 states. [2019-09-10 08:24:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:10,837 INFO L93 Difference]: Finished difference Result 27707 states and 40224 transitions. [2019-09-10 08:24:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:24:10,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-10 08:24:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:10,880 INFO L225 Difference]: With dead ends: 27707 [2019-09-10 08:24:10,880 INFO L226 Difference]: Without dead ends: 27707 [2019-09-10 08:24:10,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27707 states. [2019-09-10 08:24:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27707 to 13750. [2019-09-10 08:24:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-10 08:24:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20026 transitions. [2019-09-10 08:24:11,147 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20026 transitions. Word has length 124 [2019-09-10 08:24:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:11,147 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20026 transitions. [2019-09-10 08:24:11,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20026 transitions. [2019-09-10 08:24:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:24:11,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:11,149 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] [2019-09-10 08:24:11,150 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash -442373075, now seen corresponding path program 1 times [2019-09-10 08:24:11,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:11,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:11,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:11,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:24:11,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:11,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:11,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:11,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:11,580 INFO L87 Difference]: Start difference. First operand 13750 states and 20026 transitions. Second operand 10 states. [2019-09-10 08:24:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:12,813 INFO L93 Difference]: Finished difference Result 27692 states and 40188 transitions. [2019-09-10 08:24:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:24:12,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-10 08:24:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:12,846 INFO L225 Difference]: With dead ends: 27692 [2019-09-10 08:24:12,846 INFO L226 Difference]: Without dead ends: 27692 [2019-09-10 08:24:12,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27692 states. [2019-09-10 08:24:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27692 to 13750. [2019-09-10 08:24:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-10 08:24:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20017 transitions. [2019-09-10 08:24:13,234 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20017 transitions. Word has length 125 [2019-09-10 08:24:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:13,234 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20017 transitions. [2019-09-10 08:24:13,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20017 transitions. [2019-09-10 08:24:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:24:13,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:13,237 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] [2019-09-10 08:24:13,237 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1061976015, now seen corresponding path program 1 times [2019-09-10 08:24:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:13,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:13,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:13,565 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:24:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:13,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:13,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:13,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:13,567 INFO L87 Difference]: Start difference. First operand 13750 states and 20017 transitions. Second operand 10 states. [2019-09-10 08:24:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:14,577 INFO L93 Difference]: Finished difference Result 27662 states and 40126 transitions. [2019-09-10 08:24:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:24:14,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-10 08:24:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:14,605 INFO L225 Difference]: With dead ends: 27662 [2019-09-10 08:24:14,605 INFO L226 Difference]: Without dead ends: 27662 [2019-09-10 08:24:14,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27662 states. [2019-09-10 08:24:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27662 to 13750. [2019-09-10 08:24:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-10 08:24:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 20006 transitions. [2019-09-10 08:24:14,882 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 20006 transitions. Word has length 126 [2019-09-10 08:24:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:14,882 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 20006 transitions. [2019-09-10 08:24:14,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 20006 transitions. [2019-09-10 08:24:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:24:14,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:14,885 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] [2019-09-10 08:24:14,885 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1763158621, now seen corresponding path program 1 times [2019-09-10 08:24:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:14,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:14,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:15,241 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:24:15,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:15,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:15,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:15,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:15,243 INFO L87 Difference]: Start difference. First operand 13750 states and 20006 transitions. Second operand 10 states. [2019-09-10 08:24:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:16,387 INFO L93 Difference]: Finished difference Result 27617 states and 40039 transitions. [2019-09-10 08:24:16,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:24:16,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-10 08:24:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:16,410 INFO L225 Difference]: With dead ends: 27617 [2019-09-10 08:24:16,410 INFO L226 Difference]: Without dead ends: 27617 [2019-09-10 08:24:16,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27617 states. [2019-09-10 08:24:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27617 to 13750. [2019-09-10 08:24:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13750 states. [2019-09-10 08:24:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 19993 transitions. [2019-09-10 08:24:16,612 INFO L78 Accepts]: Start accepts. Automaton has 13750 states and 19993 transitions. Word has length 127 [2019-09-10 08:24:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:16,612 INFO L475 AbstractCegarLoop]: Abstraction has 13750 states and 19993 transitions. [2019-09-10 08:24:16,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 13750 states and 19993 transitions. [2019-09-10 08:24:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:24:16,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:16,614 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] [2019-09-10 08:24:16,615 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1669775685, now seen corresponding path program 1 times [2019-09-10 08:24:16,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:16,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:18,277 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:24:18,502 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:24:18,683 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:24:18,900 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:24:19,099 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:24:19,343 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 08:24:19,545 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 08:24:19,787 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 08:24:19,992 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 08:24:20,240 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:24:20,423 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:24:20,658 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 08:24:21,045 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:24:23,243 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:24:23,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-10 08:24:23,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:23,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 08:24:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 08:24:23,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:24:23,251 INFO L87 Difference]: Start difference. First operand 13750 states and 19993 transitions. Second operand 46 states. [2019-09-10 08:24:23,495 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:24:24,940 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:24:25,155 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:24:25,375 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:24:25,690 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:24:26,746 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 08:24:27,187 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:24:27,773 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 139 [2019-09-10 08:24:28,544 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 153 [2019-09-10 08:24:29,260 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 138 [2019-09-10 08:24:30,112 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 153 [2019-09-10 08:24:30,976 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 160 [2019-09-10 08:24:32,018 WARN L188 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 175 [2019-09-10 08:24:33,105 WARN L188 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 182 [2019-09-10 08:24:34,366 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 237 DAG size of output: 193 [2019-09-10 08:24:35,729 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 247 DAG size of output: 200 [2019-09-10 08:24:37,741 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 272 DAG size of output: 223 [2019-09-10 08:24:39,930 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 286 DAG size of output: 233 [2019-09-10 08:24:40,519 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-09-10 08:24:40,964 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:24:41,477 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:24:41,980 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 101 [2019-09-10 08:24:42,406 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-09-10 08:24:42,815 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-09-10 08:24:43,463 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 08:24:44,138 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:24:44,771 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:24:45,376 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:24:45,654 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:24:46,714 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:24:47,458 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:24:48,712 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:24:49,568 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:24:50,742 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 08:24:51,643 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 08:24:52,181 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:24:52,933 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:25:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:04,003 INFO L93 Difference]: Finished difference Result 34917 states and 50817 transitions. [2019-09-10 08:25:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 08:25:04,005 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-10 08:25:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:04,045 INFO L225 Difference]: With dead ends: 34917 [2019-09-10 08:25:04,045 INFO L226 Difference]: Without dead ends: 34917 [2019-09-10 08:25:04,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=1630, Invalid=8270, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 08:25:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34917 states. [2019-09-10 08:25:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34917 to 13825. [2019-09-10 08:25:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-09-10 08:25:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 20086 transitions. [2019-09-10 08:25:04,386 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 20086 transitions. Word has length 128 [2019-09-10 08:25:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:04,387 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 20086 transitions. [2019-09-10 08:25:04,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 08:25:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 20086 transitions. [2019-09-10 08:25:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:25:04,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:04,390 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] [2019-09-10 08:25:04,390 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1390990270, now seen corresponding path program 1 times [2019-09-10 08:25:04,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:04,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:04,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:05,396 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:25:06,154 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:25:06,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:06,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:25:06,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:06,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:25:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:25:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:25:06,156 INFO L87 Difference]: Start difference. First operand 13825 states and 20086 transitions. Second operand 25 states. [2019-09-10 08:25:07,442 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:25:07,715 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 08:25:08,074 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:25:08,460 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 08:25:09,175 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-09-10 08:25:09,879 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-09-10 08:25:10,113 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:25:10,268 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 08:25:10,638 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 08:25:11,073 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 08:25:11,349 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:25:11,722 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:25:12,278 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:25:12,848 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:25:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:16,227 INFO L93 Difference]: Finished difference Result 58589 states and 85369 transitions. [2019-09-10 08:25:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:25:16,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-10 08:25:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:16,274 INFO L225 Difference]: With dead ends: 58589 [2019-09-10 08:25:16,274 INFO L226 Difference]: Without dead ends: 58589 [2019-09-10 08:25:16,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:25:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58589 states. [2019-09-10 08:25:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58589 to 13843. [2019-09-10 08:25:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13843 states. [2019-09-10 08:25:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13843 states to 13843 states and 20104 transitions. [2019-09-10 08:25:16,600 INFO L78 Accepts]: Start accepts. Automaton has 13843 states and 20104 transitions. Word has length 128 [2019-09-10 08:25:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:16,600 INFO L475 AbstractCegarLoop]: Abstraction has 13843 states and 20104 transitions. [2019-09-10 08:25:16,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:25:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13843 states and 20104 transitions. [2019-09-10 08:25:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:25:16,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:16,602 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] [2019-09-10 08:25:16,603 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash 970646882, now seen corresponding path program 1 times [2019-09-10 08:25:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:16,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:16,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:16,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:17,552 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 08:25:17,722 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:25:17,924 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:25:18,105 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:25:18,326 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 08:25:18,521 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 08:25:18,765 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:25:18,954 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 08:25:19,176 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:25:19,363 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:25:19,592 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-10 08:25:19,781 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 08:25:19,993 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:25:21,678 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:25:21,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:21,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-10 08:25:21,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:21,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 08:25:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 08:25:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:25:21,680 INFO L87 Difference]: Start difference. First operand 13843 states and 20104 transitions. Second operand 41 states. [2019-09-10 08:25:21,933 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-10 08:25:23,500 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 08:25:23,722 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-09-10 08:25:23,968 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-10 08:25:24,412 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-10 08:25:25,230 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-10 08:25:25,631 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2019-09-10 08:25:26,160 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 103 [2019-09-10 08:25:26,731 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 111 [2019-09-10 08:25:27,477 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 129 [2019-09-10 08:25:28,305 WARN L188 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 138 [2019-09-10 08:25:29,330 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 157 [2019-09-10 08:25:30,440 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 166 [2019-09-10 08:25:31,656 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 240 DAG size of output: 185 [2019-09-10 08:25:32,988 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 252 DAG size of output: 193 [2019-09-10 08:25:34,500 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 273 DAG size of output: 208 [2019-09-10 08:25:34,952 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-09-10 08:25:35,367 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-09-10 08:25:35,775 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-09-10 08:25:35,997 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 08:25:36,567 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-10 08:25:37,054 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-10 08:25:37,714 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-10 08:25:38,182 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-10 08:25:39,317 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-10 08:25:39,911 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-10 08:25:40,931 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-10 08:25:41,654 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-10 08:25:42,608 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-10 08:25:43,176 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-10 08:25:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:53,384 INFO L93 Difference]: Finished difference Result 40293 states and 58677 transitions. [2019-09-10 08:25:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 08:25:53,385 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 128 [2019-09-10 08:25:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:53,417 INFO L225 Difference]: With dead ends: 40293 [2019-09-10 08:25:53,417 INFO L226 Difference]: Without dead ends: 40293 [2019-09-10 08:25:53,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=1320, Invalid=5160, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 08:25:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40293 states. [2019-09-10 08:25:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40293 to 13878. [2019-09-10 08:25:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13878 states. [2019-09-10 08:25:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13878 states to 13878 states and 20149 transitions. [2019-09-10 08:25:53,658 INFO L78 Accepts]: Start accepts. Automaton has 13878 states and 20149 transitions. Word has length 128 [2019-09-10 08:25:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:53,659 INFO L475 AbstractCegarLoop]: Abstraction has 13878 states and 20149 transitions. [2019-09-10 08:25:53,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 08:25:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13878 states and 20149 transitions. [2019-09-10 08:25:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:25:53,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:53,660 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] [2019-09-10 08:25:53,660 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1768753698, now seen corresponding path program 1 times [2019-09-10 08:25:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:53,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:53,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:55,228 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:25:55,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:55,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:25:55,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:55,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:25:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:25:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:25:55,230 INFO L87 Difference]: Start difference. First operand 13878 states and 20149 transitions. Second operand 24 states. [2019-09-10 08:25:56,492 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:25:56,750 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 08:25:57,193 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:25:59,692 WARN L188 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-09-10 08:26:00,333 WARN L188 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-09-10 08:26:00,601 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:26:00,837 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:26:01,079 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:26:01,398 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 08:26:01,794 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:26:02,158 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:26:02,447 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:26:02,800 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:26:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:04,699 INFO L93 Difference]: Finished difference Result 56130 states and 81764 transitions. [2019-09-10 08:26:04,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:26:04,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-10 08:26:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:04,747 INFO L225 Difference]: With dead ends: 56130 [2019-09-10 08:26:04,747 INFO L226 Difference]: Without dead ends: 56130 [2019-09-10 08:26:04,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=490, Invalid=1960, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:26:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56130 states. [2019-09-10 08:26:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56130 to 13875. [2019-09-10 08:26:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13875 states. [2019-09-10 08:26:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13875 states to 13875 states and 20144 transitions. [2019-09-10 08:26:05,076 INFO L78 Accepts]: Start accepts. Automaton has 13875 states and 20144 transitions. Word has length 128 [2019-09-10 08:26:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:05,076 INFO L475 AbstractCegarLoop]: Abstraction has 13875 states and 20144 transitions. [2019-09-10 08:26:05,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:26:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13875 states and 20144 transitions. [2019-09-10 08:26:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:26:05,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:05,078 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] [2019-09-10 08:26:05,078 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash 859171391, now seen corresponding path program 1 times [2019-09-10 08:26:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:05,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:05,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:06,335 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:26:06,934 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:26:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:06,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:26:06,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:06,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:26:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:26:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:26:06,936 INFO L87 Difference]: Start difference. First operand 13875 states and 20144 transitions. Second operand 25 states. [2019-09-10 08:26:08,115 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 08:26:08,385 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 08:26:08,766 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:26:09,246 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-10 08:26:09,793 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-09-10 08:26:10,376 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-09-10 08:26:10,621 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 08:26:11,153 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:26:11,643 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:26:11,871 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:26:12,248 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:26:12,751 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:26:13,201 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:26:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:16,294 INFO L93 Difference]: Finished difference Result 53909 states and 78535 transitions. [2019-09-10 08:26:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:26:16,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-10 08:26:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:16,343 INFO L225 Difference]: With dead ends: 53909 [2019-09-10 08:26:16,344 INFO L226 Difference]: Without dead ends: 53909 [2019-09-10 08:26:16,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:26:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53909 states. [2019-09-10 08:26:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53909 to 13890. [2019-09-10 08:26:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13890 states. [2019-09-10 08:26:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13890 states to 13890 states and 20156 transitions. [2019-09-10 08:26:16,667 INFO L78 Accepts]: Start accepts. Automaton has 13890 states and 20156 transitions. Word has length 128 [2019-09-10 08:26:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:16,668 INFO L475 AbstractCegarLoop]: Abstraction has 13890 states and 20156 transitions. [2019-09-10 08:26:16,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:26:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 13890 states and 20156 transitions. [2019-09-10 08:26:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:26:16,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:16,669 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] [2019-09-10 08:26:16,669 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 759484704, now seen corresponding path program 1 times [2019-09-10 08:26:16,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:16,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:17,354 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:26:18,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:26:18,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:26:18,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:18,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:26:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:26:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:26:18,496 INFO L87 Difference]: Start difference. First operand 13890 states and 20156 transitions. Second operand 24 states. [2019-09-10 08:26:19,726 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:26:19,951 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:26:20,279 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-10 08:26:20,663 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-10 08:26:21,171 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2019-09-10 08:26:21,400 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:26:21,646 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:26:22,106 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:26:22,454 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:26:22,858 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:26:23,766 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:26:24,362 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:26:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:27,081 INFO L93 Difference]: Finished difference Result 54468 states and 79180 transitions. [2019-09-10 08:26:27,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:26:27,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-10 08:26:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:27,130 INFO L225 Difference]: With dead ends: 54468 [2019-09-10 08:26:27,130 INFO L226 Difference]: Without dead ends: 54468 [2019-09-10 08:26:27,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=516, Invalid=2240, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:26:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54468 states. [2019-09-10 08:26:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54468 to 14024. [2019-09-10 08:26:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14024 states. [2019-09-10 08:26:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14024 states to 14024 states and 20332 transitions. [2019-09-10 08:26:27,539 INFO L78 Accepts]: Start accepts. Automaton has 14024 states and 20332 transitions. Word has length 128 [2019-09-10 08:26:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:27,540 INFO L475 AbstractCegarLoop]: Abstraction has 14024 states and 20332 transitions. [2019-09-10 08:26:27,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:26:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14024 states and 20332 transitions. [2019-09-10 08:26:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:26:27,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:27,543 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] [2019-09-10 08:26:27,543 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 568996734, now seen corresponding path program 1 times [2019-09-10 08:26:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:27,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:28,664 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:26:28,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:26:28,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:28,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:26:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:26:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:26:28,666 INFO L87 Difference]: Start difference. First operand 14024 states and 20332 transitions. Second operand 19 states. [2019-09-10 08:26:29,506 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 08:26:29,722 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:26:30,034 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:26:30,359 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-10 08:26:30,543 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 08:26:30,917 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:26:31,186 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:26:31,401 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:26:31,658 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:26:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:32,863 INFO L93 Difference]: Finished difference Result 43701 states and 63574 transitions. [2019-09-10 08:26:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:26:32,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-10 08:26:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:32,905 INFO L225 Difference]: With dead ends: 43701 [2019-09-10 08:26:32,905 INFO L226 Difference]: Without dead ends: 43701 [2019-09-10 08:26:32,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:26:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43701 states. [2019-09-10 08:26:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43701 to 14021. [2019-09-10 08:26:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2019-09-10 08:26:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 20327 transitions. [2019-09-10 08:26:33,160 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 20327 transitions. Word has length 129 [2019-09-10 08:26:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:33,161 INFO L475 AbstractCegarLoop]: Abstraction has 14021 states and 20327 transitions. [2019-09-10 08:26:33,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:26:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 20327 transitions. [2019-09-10 08:26:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:26:33,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:33,162 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] [2019-09-10 08:26:33,163 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1197732160, now seen corresponding path program 1 times [2019-09-10 08:26:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:33,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:33,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:34,415 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 08:26:34,557 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:26:34,735 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:26:34,893 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:26:35,067 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:26:36,132 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:26:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:26:36,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:36,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:26:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:26:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:26:36,134 INFO L87 Difference]: Start difference. First operand 14021 states and 20327 transitions. Second operand 31 states. [2019-09-10 08:26:37,133 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 08:26:37,479 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-09-10 08:26:38,023 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-10 08:26:38,347 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-10 08:26:38,785 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 87 [2019-09-10 08:26:39,280 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-09-10 08:26:39,946 WARN L188 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-09-10 08:26:40,725 WARN L188 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 136 [2019-09-10 08:26:41,634 WARN L188 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 163 [2019-09-10 08:26:42,617 WARN L188 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 178 [2019-09-10 08:26:42,913 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 08:26:43,138 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 08:26:43,564 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-09-10 08:26:44,027 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-10 08:26:44,429 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 08:26:44,861 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 08:26:45,556 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 08:26:46,042 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 08:26:46,760 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 08:26:47,262 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 08:26:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:52,367 INFO L93 Difference]: Finished difference Result 55938 states and 81428 transitions. [2019-09-10 08:26:52,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:26:52,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2019-09-10 08:26:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:52,416 INFO L225 Difference]: With dead ends: 55938 [2019-09-10 08:26:52,416 INFO L226 Difference]: Without dead ends: 55938 [2019-09-10 08:26:52,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:26:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55938 states. [2019-09-10 08:26:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55938 to 14039. [2019-09-10 08:26:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14039 states. [2019-09-10 08:26:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14039 states to 14039 states and 20348 transitions. [2019-09-10 08:26:52,743 INFO L78 Accepts]: Start accepts. Automaton has 14039 states and 20348 transitions. Word has length 129 [2019-09-10 08:26:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:52,743 INFO L475 AbstractCegarLoop]: Abstraction has 14039 states and 20348 transitions. [2019-09-10 08:26:52,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:26:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14039 states and 20348 transitions. [2019-09-10 08:26:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:26:52,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:52,746 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] [2019-09-10 08:26:52,746 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2046136579, now seen corresponding path program 1 times [2019-09-10 08:26:52,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:52,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:52,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:52,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:54,460 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:26:54,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:54,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:26:54,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:54,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:26:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:26:54,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:26:54,461 INFO L87 Difference]: Start difference. First operand 14039 states and 20348 transitions. Second operand 25 states. [2019-09-10 08:26:55,647 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:26:55,929 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 08:26:56,279 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:26:56,652 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-10 08:26:57,141 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2019-09-10 08:26:57,648 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2019-09-10 08:26:57,872 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 08:26:58,035 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 08:26:58,374 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:26:58,714 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:26:59,038 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:26:59,378 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:26:59,895 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:00,270 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:02,368 INFO L93 Difference]: Finished difference Result 42894 states and 62408 transitions. [2019-09-10 08:27:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:27:02,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-09-10 08:27:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:02,405 INFO L225 Difference]: With dead ends: 42894 [2019-09-10 08:27:02,406 INFO L226 Difference]: Without dead ends: 42894 [2019-09-10 08:27:02,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:27:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42894 states. [2019-09-10 08:27:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42894 to 14019. [2019-09-10 08:27:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14019 states. [2019-09-10 08:27:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14019 states to 14019 states and 20320 transitions. [2019-09-10 08:27:02,651 INFO L78 Accepts]: Start accepts. Automaton has 14019 states and 20320 transitions. Word has length 129 [2019-09-10 08:27:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:02,651 INFO L475 AbstractCegarLoop]: Abstraction has 14019 states and 20320 transitions. [2019-09-10 08:27:02,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:27:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14019 states and 20320 transitions. [2019-09-10 08:27:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:02,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:02,653 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] [2019-09-10 08:27:02,653 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 167813244, now seen corresponding path program 1 times [2019-09-10 08:27:02,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:03,681 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:27:03,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:03,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:27:03,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:03,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:27:03,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:27:03,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:27:03,682 INFO L87 Difference]: Start difference. First operand 14019 states and 20320 transitions. Second operand 19 states. [2019-09-10 08:27:04,342 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 08:27:04,536 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:27:04,814 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 08:27:05,116 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 08:27:05,288 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:27:05,650 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:27:05,896 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 08:27:06,125 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:27:06,353 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:27:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:07,000 INFO L93 Difference]: Finished difference Result 44384 states and 64624 transitions. [2019-09-10 08:27:07,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:27:07,001 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-10 08:27:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:07,041 INFO L225 Difference]: With dead ends: 44384 [2019-09-10 08:27:07,041 INFO L226 Difference]: Without dead ends: 44384 [2019-09-10 08:27:07,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:27:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44384 states. [2019-09-10 08:27:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44384 to 13994. [2019-09-10 08:27:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13994 states. [2019-09-10 08:27:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 20287 transitions. [2019-09-10 08:27:07,322 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 20287 transitions. Word has length 129 [2019-09-10 08:27:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:07,323 INFO L475 AbstractCegarLoop]: Abstraction has 13994 states and 20287 transitions. [2019-09-10 08:27:07,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:27:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 20287 transitions. [2019-09-10 08:27:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:07,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:07,325 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] [2019-09-10 08:27:07,325 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash -675788165, now seen corresponding path program 1 times [2019-09-10 08:27:07,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:07,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:07,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:07,782 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:27:08,159 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:27:08,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:08,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:27:08,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:08,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:27:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:27:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:27:08,161 INFO L87 Difference]: Start difference. First operand 13994 states and 20287 transitions. Second operand 13 states. [2019-09-10 08:27:08,505 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:27:08,658 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:27:08,829 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:27:09,166 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:27:09,396 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:27:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:09,659 INFO L93 Difference]: Finished difference Result 32922 states and 47869 transitions. [2019-09-10 08:27:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:09,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:27:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:09,686 INFO L225 Difference]: With dead ends: 32922 [2019-09-10 08:27:09,687 INFO L226 Difference]: Without dead ends: 32922 [2019-09-10 08:27:09,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:27:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32922 states. [2019-09-10 08:27:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32922 to 13935. [2019-09-10 08:27:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13935 states. [2019-09-10 08:27:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13935 states to 13935 states and 20211 transitions. [2019-09-10 08:27:09,877 INFO L78 Accepts]: Start accepts. Automaton has 13935 states and 20211 transitions. Word has length 129 [2019-09-10 08:27:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:09,877 INFO L475 AbstractCegarLoop]: Abstraction has 13935 states and 20211 transitions. [2019-09-10 08:27:09,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:27:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 13935 states and 20211 transitions. [2019-09-10 08:27:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:09,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:09,879 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] [2019-09-10 08:27:09,879 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash -59208219, now seen corresponding path program 1 times [2019-09-10 08:27:09,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:09,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:09,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:09,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:09,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:10,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:27:10,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:10,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:27:10,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:10,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:27:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:27:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:27:10,497 INFO L87 Difference]: Start difference. First operand 13935 states and 20211 transitions. Second operand 16 states. [2019-09-10 08:27:11,179 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:27:11,393 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:27:11,609 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:27:11,846 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:27:12,250 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:27:12,439 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:27:12,696 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:27:12,851 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:27:13,039 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:27:13,478 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:27:13,635 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:27:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:13,957 INFO L93 Difference]: Finished difference Result 70141 states and 102090 transitions. [2019-09-10 08:27:13,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:27:13,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-10 08:27:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:14,020 INFO L225 Difference]: With dead ends: 70141 [2019-09-10 08:27:14,020 INFO L226 Difference]: Without dead ends: 70141 [2019-09-10 08:27:14,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:27:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70141 states. [2019-09-10 08:27:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70141 to 13809. [2019-09-10 08:27:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-09-10 08:27:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 20052 transitions. [2019-09-10 08:27:14,380 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 20052 transitions. Word has length 129 [2019-09-10 08:27:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:14,380 INFO L475 AbstractCegarLoop]: Abstraction has 13809 states and 20052 transitions. [2019-09-10 08:27:14,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:27:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 20052 transitions. [2019-09-10 08:27:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:14,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:14,382 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] [2019-09-10 08:27:14,382 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash -829357733, now seen corresponding path program 1 times [2019-09-10 08:27:14,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:14,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:15,143 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:27:15,434 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 08:27:15,604 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:27:15,834 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:27:16,962 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:27:16,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 08:27:16,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:16,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:27:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:27:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:27:16,963 INFO L87 Difference]: Start difference. First operand 13809 states and 20052 transitions. Second operand 29 states. [2019-09-10 08:27:18,203 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-09-10 08:27:18,684 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-09-10 08:27:18,916 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2019-09-10 08:27:19,226 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2019-09-10 08:27:19,574 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 72 [2019-09-10 08:27:20,076 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 94 [2019-09-10 08:27:20,608 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 102 [2019-09-10 08:27:21,232 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 117 [2019-09-10 08:27:21,555 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-10 08:27:21,864 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-10 08:27:22,157 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-09-10 08:27:22,703 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-10 08:27:23,012 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-10 08:27:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:26,033 INFO L93 Difference]: Finished difference Result 35238 states and 51278 transitions. [2019-09-10 08:27:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:27:26,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2019-09-10 08:27:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:26,062 INFO L225 Difference]: With dead ends: 35238 [2019-09-10 08:27:26,062 INFO L226 Difference]: Without dead ends: 35238 [2019-09-10 08:27:26,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=544, Invalid=2108, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:27:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35238 states. [2019-09-10 08:27:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35238 to 13806. [2019-09-10 08:27:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2019-09-10 08:27:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 20047 transitions. [2019-09-10 08:27:26,271 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 20047 transitions. Word has length 129 [2019-09-10 08:27:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:26,271 INFO L475 AbstractCegarLoop]: Abstraction has 13806 states and 20047 transitions. [2019-09-10 08:27:26,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:27:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 20047 transitions. [2019-09-10 08:27:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:26,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:26,272 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] [2019-09-10 08:27:26,273 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1635491301, now seen corresponding path program 1 times [2019-09-10 08:27:26,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:26,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:27,150 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:27:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:27,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:27:27,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:27,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:27:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:27:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:27,151 INFO L87 Difference]: Start difference. First operand 13806 states and 20047 transitions. Second operand 17 states. [2019-09-10 08:27:28,023 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-09-10 08:27:28,187 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 08:27:28,357 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:27:28,496 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:27:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:29,656 INFO L93 Difference]: Finished difference Result 38647 states and 56363 transitions. [2019-09-10 08:27:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:27:29,657 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-10 08:27:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:29,688 INFO L225 Difference]: With dead ends: 38647 [2019-09-10 08:27:29,688 INFO L226 Difference]: Without dead ends: 38647 [2019-09-10 08:27:29,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:27:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38647 states. [2019-09-10 08:27:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38647 to 13791. [2019-09-10 08:27:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13791 states. [2019-09-10 08:27:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13791 states to 13791 states and 20029 transitions. [2019-09-10 08:27:29,999 INFO L78 Accepts]: Start accepts. Automaton has 13791 states and 20029 transitions. Word has length 129 [2019-09-10 08:27:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:29,999 INFO L475 AbstractCegarLoop]: Abstraction has 13791 states and 20029 transitions. [2019-09-10 08:27:29,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:27:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 13791 states and 20029 transitions. [2019-09-10 08:27:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:30,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:30,001 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] [2019-09-10 08:27:30,001 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash 899729637, now seen corresponding path program 1 times [2019-09-10 08:27:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:30,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:30,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:30,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:30,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:30,580 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:27:30,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:30,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:27:30,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:30,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:27:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:27:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:27:30,582 INFO L87 Difference]: Start difference. First operand 13791 states and 20029 transitions. Second operand 13 states. [2019-09-10 08:27:31,020 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 08:27:31,166 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:27:31,325 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:27:31,636 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:27:31,848 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 08:27:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:32,165 INFO L93 Difference]: Finished difference Result 54191 states and 78935 transitions. [2019-09-10 08:27:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:32,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:27:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:32,215 INFO L225 Difference]: With dead ends: 54191 [2019-09-10 08:27:32,215 INFO L226 Difference]: Without dead ends: 54191 [2019-09-10 08:27:32,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:27:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54191 states. [2019-09-10 08:27:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54191 to 13748. [2019-09-10 08:27:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13748 states. [2019-09-10 08:27:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13748 states to 13748 states and 19966 transitions. [2019-09-10 08:27:32,541 INFO L78 Accepts]: Start accepts. Automaton has 13748 states and 19966 transitions. Word has length 129 [2019-09-10 08:27:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:32,541 INFO L475 AbstractCegarLoop]: Abstraction has 13748 states and 19966 transitions. [2019-09-10 08:27:32,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:27:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13748 states and 19966 transitions. [2019-09-10 08:27:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:27:32,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:32,542 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] [2019-09-10 08:27:32,542 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:32,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1705847363, now seen corresponding path program 1 times [2019-09-10 08:27:32,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:32,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:32,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:32,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:33,545 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:27:33,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:33,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:27:33,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:33,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:27:33,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:27:33,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:27:33,546 INFO L87 Difference]: Start difference. First operand 13748 states and 19966 transitions. Second operand 16 states. [2019-09-10 08:27:33,708 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-09-10 08:27:34,210 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:27:34,440 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:27:34,627 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:27:34,976 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-09-10 08:27:35,205 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 08:27:35,450 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 08:27:35,620 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:27:35,780 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:27:36,015 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-10 08:27:36,238 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:27:36,425 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 08:27:36,638 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-10 08:27:37,555 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:27:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:38,110 INFO L93 Difference]: Finished difference Result 80954 states and 118005 transitions. [2019-09-10 08:27:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:27:38,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-10 08:27:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:38,174 INFO L225 Difference]: With dead ends: 80954 [2019-09-10 08:27:38,174 INFO L226 Difference]: Without dead ends: 80954 [2019-09-10 08:27:38,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:27:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80954 states. [2019-09-10 08:27:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80954 to 13659. [2019-09-10 08:27:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13659 states. [2019-09-10 08:27:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13659 states to 13659 states and 19853 transitions. [2019-09-10 08:27:38,604 INFO L78 Accepts]: Start accepts. Automaton has 13659 states and 19853 transitions. Word has length 129 [2019-09-10 08:27:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:38,604 INFO L475 AbstractCegarLoop]: Abstraction has 13659 states and 19853 transitions. [2019-09-10 08:27:38,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:27:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 13659 states and 19853 transitions. [2019-09-10 08:27:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:27:38,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:38,605 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] [2019-09-10 08:27:38,606 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1312996549, now seen corresponding path program 1 times [2019-09-10 08:27:38,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:38,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:38,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:39,508 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:27:39,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:27:39,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:39,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:27:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:27:39,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:39,509 INFO L87 Difference]: Start difference. First operand 13659 states and 19853 transitions. Second operand 17 states. [2019-09-10 08:27:40,288 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:27:40,447 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:27:40,817 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:27:40,993 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:27:41,160 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:27:41,317 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:27:41,765 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:27:41,933 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:27:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:42,350 INFO L93 Difference]: Finished difference Result 26440 states and 38535 transitions. [2019-09-10 08:27:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:27:42,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2019-09-10 08:27:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:42,376 INFO L225 Difference]: With dead ends: 26440 [2019-09-10 08:27:42,376 INFO L226 Difference]: Without dead ends: 26436 [2019-09-10 08:27:42,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:27:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26436 states. [2019-09-10 08:27:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26436 to 13330. [2019-09-10 08:27:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13330 states. [2019-09-10 08:27:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13330 states to 13330 states and 19390 transitions. [2019-09-10 08:27:42,523 INFO L78 Accepts]: Start accepts. Automaton has 13330 states and 19390 transitions. Word has length 130 [2019-09-10 08:27:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:42,524 INFO L475 AbstractCegarLoop]: Abstraction has 13330 states and 19390 transitions. [2019-09-10 08:27:42,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:27:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13330 states and 19390 transitions. [2019-09-10 08:27:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:27:42,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:42,524 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] [2019-09-10 08:27:42,525 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -695556671, now seen corresponding path program 1 times [2019-09-10 08:27:42,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:42,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:42,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:43,479 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:27:43,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:43,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:27:43,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:43,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:27:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:27:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:27:43,481 INFO L87 Difference]: Start difference. First operand 13330 states and 19390 transitions. Second operand 19 states. [2019-09-10 08:27:44,345 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 08:27:44,578 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 08:27:44,809 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:27:45,106 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-10 08:27:45,427 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 08:27:45,669 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:27:45,814 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 08:27:46,177 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:27:46,518 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 08:27:46,803 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:27:47,133 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:27:47,437 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:27:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:48,324 INFO L93 Difference]: Finished difference Result 52712 states and 76883 transitions. [2019-09-10 08:27:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:27:48,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-09-10 08:27:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:48,372 INFO L225 Difference]: With dead ends: 52712 [2019-09-10 08:27:48,372 INFO L226 Difference]: Without dead ends: 52682 [2019-09-10 08:27:48,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=325, Invalid=1235, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:27:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52682 states. [2019-09-10 08:27:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52682 to 13304. [2019-09-10 08:27:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-09-10 08:27:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 19360 transitions. [2019-09-10 08:27:48,683 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 19360 transitions. Word has length 130 [2019-09-10 08:27:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:48,683 INFO L475 AbstractCegarLoop]: Abstraction has 13304 states and 19360 transitions. [2019-09-10 08:27:48,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:27:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 19360 transitions. [2019-09-10 08:27:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:27:48,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:48,684 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] [2019-09-10 08:27:48,684 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:48,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash 554914331, now seen corresponding path program 1 times [2019-09-10 08:27:48,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:48,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:48,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:48,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:48,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:49,204 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:27:49,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:49,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:27:49,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:49,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:27:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:27:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:27:49,205 INFO L87 Difference]: Start difference. First operand 13304 states and 19360 transitions. Second operand 13 states. [2019-09-10 08:27:49,767 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:27:49,993 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:27:50,233 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:27:50,623 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:27:50,858 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:27:51,086 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:27:51,604 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:27:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:51,765 INFO L93 Difference]: Finished difference Result 65794 states and 96002 transitions. [2019-09-10 08:27:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:27:51,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2019-09-10 08:27:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:51,821 INFO L225 Difference]: With dead ends: 65794 [2019-09-10 08:27:51,822 INFO L226 Difference]: Without dead ends: 65794 [2019-09-10 08:27:51,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:27:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65794 states. [2019-09-10 08:27:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65794 to 13264. [2019-09-10 08:27:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13264 states. [2019-09-10 08:27:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13264 states to 13264 states and 19312 transitions. [2019-09-10 08:27:52,191 INFO L78 Accepts]: Start accepts. Automaton has 13264 states and 19312 transitions. Word has length 130 [2019-09-10 08:27:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:52,191 INFO L475 AbstractCegarLoop]: Abstraction has 13264 states and 19312 transitions. [2019-09-10 08:27:52,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:27:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13264 states and 19312 transitions. [2019-09-10 08:27:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:27:52,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:52,194 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:52,194 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash 892131988, now seen corresponding path program 1 times [2019-09-10 08:27:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:52,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:52,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:52,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:52,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:52,273 INFO L87 Difference]: Start difference. First operand 13264 states and 19312 transitions. Second operand 3 states. [2019-09-10 08:27:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:52,342 INFO L93 Difference]: Finished difference Result 25634 states and 36981 transitions. [2019-09-10 08:27:52,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:52,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 08:27:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:52,375 INFO L225 Difference]: With dead ends: 25634 [2019-09-10 08:27:52,375 INFO L226 Difference]: Without dead ends: 25634 [2019-09-10 08:27:52,375 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:27:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25634 states. [2019-09-10 08:27:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25634 to 24896. [2019-09-10 08:27:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24896 states. [2019-09-10 08:27:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24896 states to 24896 states and 36060 transitions. [2019-09-10 08:27:52,603 INFO L78 Accepts]: Start accepts. Automaton has 24896 states and 36060 transitions. Word has length 165 [2019-09-10 08:27:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:52,604 INFO L475 AbstractCegarLoop]: Abstraction has 24896 states and 36060 transitions. [2019-09-10 08:27:52,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 24896 states and 36060 transitions. [2019-09-10 08:27:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:27:52,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:52,606 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:52,607 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 113259421, now seen corresponding path program 1 times [2019-09-10 08:27:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:52,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:52,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:52,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:52,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:52,788 INFO L87 Difference]: Start difference. First operand 24896 states and 36060 transitions. Second operand 3 states. [2019-09-10 08:27:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:52,913 INFO L93 Difference]: Finished difference Result 48162 states and 69005 transitions. [2019-09-10 08:27:52,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:52,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:27:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:52,978 INFO L225 Difference]: With dead ends: 48162 [2019-09-10 08:27:52,978 INFO L226 Difference]: Without dead ends: 48162 [2019-09-10 08:27:52,978 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:27:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48162 states. [2019-09-10 08:27:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48162 to 46688. [2019-09-10 08:27:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46688 states. [2019-09-10 08:27:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46688 states to 46688 states and 67164 transitions. [2019-09-10 08:27:53,463 INFO L78 Accepts]: Start accepts. Automaton has 46688 states and 67164 transitions. Word has length 166 [2019-09-10 08:27:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:53,463 INFO L475 AbstractCegarLoop]: Abstraction has 46688 states and 67164 transitions. [2019-09-10 08:27:53,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 46688 states and 67164 transitions. [2019-09-10 08:27:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 08:27:53,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:53,465 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:53,465 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2110736483, now seen corresponding path program 1 times [2019-09-10 08:27:53,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:53,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:53,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:53,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:53,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:53,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:53,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:53,540 INFO L87 Difference]: Start difference. First operand 46688 states and 67164 transitions. Second operand 3 states. [2019-09-10 08:27:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:53,698 INFO L93 Difference]: Finished difference Result 90274 states and 128269 transitions. [2019-09-10 08:27:53,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:53,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 08:27:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:53,777 INFO L225 Difference]: With dead ends: 90274 [2019-09-10 08:27:53,777 INFO L226 Difference]: Without dead ends: 90274 [2019-09-10 08:27:53,777 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:27:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90274 states. [2019-09-10 08:27:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90274 to 87328. [2019-09-10 08:27:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87328 states. [2019-09-10 08:27:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87328 states to 87328 states and 124588 transitions. [2019-09-10 08:27:54,459 INFO L78 Accepts]: Start accepts. Automaton has 87328 states and 124588 transitions. Word has length 167 [2019-09-10 08:27:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:54,460 INFO L475 AbstractCegarLoop]: Abstraction has 87328 states and 124588 transitions. [2019-09-10 08:27:54,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 87328 states and 124588 transitions. [2019-09-10 08:27:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:27:54,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:54,462 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:54,462 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash -487620321, now seen corresponding path program 1 times [2019-09-10 08:27:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:54,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:54,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:54,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:54,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:54,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:54,551 INFO L87 Difference]: Start difference. First operand 87328 states and 124588 transitions. Second operand 3 states. [2019-09-10 08:27:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:54,713 INFO L93 Difference]: Finished difference Result 87330 states and 123853 transitions. [2019-09-10 08:27:54,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:54,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:27:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:54,788 INFO L225 Difference]: With dead ends: 87330 [2019-09-10 08:27:54,788 INFO L226 Difference]: Without dead ends: 87330 [2019-09-10 08:27:54,790 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:27:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87330 states. [2019-09-10 08:27:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87330 to 87328. [2019-09-10 08:27:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87328 states. [2019-09-10 08:27:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87328 states to 87328 states and 123852 transitions. [2019-09-10 08:27:57,138 INFO L78 Accepts]: Start accepts. Automaton has 87328 states and 123852 transitions. Word has length 168 [2019-09-10 08:27:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:57,138 INFO L475 AbstractCegarLoop]: Abstraction has 87328 states and 123852 transitions. [2019-09-10 08:27:57,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 87328 states and 123852 transitions. [2019-09-10 08:27:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 08:27:57,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:57,140 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:57,140 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1885501466, now seen corresponding path program 1 times [2019-09-10 08:27:57,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:57,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:57,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:57,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:57,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:57,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:57,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:27:57,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:57,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:27:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:27:57,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:27:57,225 INFO L87 Difference]: Start difference. First operand 87328 states and 123852 transitions. Second operand 3 states. [2019-09-10 08:27:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:57,449 INFO L93 Difference]: Finished difference Result 122014 states and 172028 transitions. [2019-09-10 08:27:57,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:27:57,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 08:27:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:57,557 INFO L225 Difference]: With dead ends: 122014 [2019-09-10 08:27:57,557 INFO L226 Difference]: Without dead ends: 122014 [2019-09-10 08:27:57,557 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:27:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122014 states. [2019-09-10 08:27:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122014 to 118036. [2019-09-10 08:27:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118036 states. [2019-09-10 08:27:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118036 states to 118036 states and 166560 transitions. [2019-09-10 08:27:58,641 INFO L78 Accepts]: Start accepts. Automaton has 118036 states and 166560 transitions. Word has length 169 [2019-09-10 08:27:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:58,641 INFO L475 AbstractCegarLoop]: Abstraction has 118036 states and 166560 transitions. [2019-09-10 08:27:58,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:27:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 118036 states and 166560 transitions. [2019-09-10 08:27:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:27:58,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:58,643 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:58,643 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1084255458, now seen corresponding path program 1 times [2019-09-10 08:27:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:58,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:58,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:58,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:27:58,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:58,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:27:58,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:27:58,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:27:58,762 INFO L87 Difference]: Start difference. First operand 118036 states and 166560 transitions. Second operand 7 states. [2019-09-10 08:28:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:02,303 INFO L93 Difference]: Finished difference Result 297402 states and 413283 transitions. [2019-09-10 08:28:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:28:02,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-09-10 08:28:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:02,600 INFO L225 Difference]: With dead ends: 297402 [2019-09-10 08:28:02,600 INFO L226 Difference]: Without dead ends: 297402 [2019-09-10 08:28:02,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:28:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297402 states. [2019-09-10 08:28:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297402 to 126964. [2019-09-10 08:28:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126964 states. [2019-09-10 08:28:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126964 states to 126964 states and 178464 transitions. [2019-09-10 08:28:04,251 INFO L78 Accepts]: Start accepts. Automaton has 126964 states and 178464 transitions. Word has length 171 [2019-09-10 08:28:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:04,251 INFO L475 AbstractCegarLoop]: Abstraction has 126964 states and 178464 transitions. [2019-09-10 08:28:04,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:28:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 126964 states and 178464 transitions. [2019-09-10 08:28:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:28:04,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:04,252 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,252 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash 880887167, now seen corresponding path program 1 times [2019-09-10 08:28:04,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:04,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:04,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:04,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:04,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:28:04,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:04,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:28:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:28:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:04,362 INFO L87 Difference]: Start difference. First operand 126964 states and 178464 transitions. Second operand 7 states. [2019-09-10 08:28:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:05,354 INFO L93 Difference]: Finished difference Result 271610 states and 373603 transitions. [2019-09-10 08:28:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:28:05,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-09-10 08:28:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:08,353 INFO L225 Difference]: With dead ends: 271610 [2019-09-10 08:28:08,354 INFO L226 Difference]: Without dead ends: 271610 [2019-09-10 08:28:08,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:28:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271610 states. [2019-09-10 08:28:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271610 to 135892. [2019-09-10 08:28:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135892 states. [2019-09-10 08:28:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135892 states to 135892 states and 190368 transitions. [2019-09-10 08:28:09,748 INFO L78 Accepts]: Start accepts. Automaton has 135892 states and 190368 transitions. Word has length 171 [2019-09-10 08:28:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:09,748 INFO L475 AbstractCegarLoop]: Abstraction has 135892 states and 190368 transitions. [2019-09-10 08:28:09,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:28:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 135892 states and 190368 transitions. [2019-09-10 08:28:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 08:28:09,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:09,757 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:09,757 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1412589508, now seen corresponding path program 1 times [2019-09-10 08:28:09,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:09,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:09,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:09,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:09,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:09,862 INFO L87 Difference]: Start difference. First operand 135892 states and 190368 transitions. Second operand 3 states. [2019-09-10 08:28:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:10,336 INFO L93 Difference]: Finished difference Result 260694 states and 359713 transitions. [2019-09-10 08:28:10,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:10,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-10 08:28:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:10,609 INFO L225 Difference]: With dead ends: 260694 [2019-09-10 08:28:10,610 INFO L226 Difference]: Without dead ends: 260694 [2019-09-10 08:28:10,610 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:28:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260694 states. [2019-09-10 08:28:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260694 to 246804. [2019-09-10 08:28:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246804 states. [2019-09-10 08:28:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246804 states to 246804 states and 342848 transitions. [2019-09-10 08:28:13,498 INFO L78 Accepts]: Start accepts. Automaton has 246804 states and 342848 transitions. Word has length 206 [2019-09-10 08:28:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:13,498 INFO L475 AbstractCegarLoop]: Abstraction has 246804 states and 342848 transitions. [2019-09-10 08:28:13,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 246804 states and 342848 transitions. [2019-09-10 08:28:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 08:28:13,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:13,509 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:13,510 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -618244518, now seen corresponding path program 1 times [2019-09-10 08:28:13,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:13,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:13,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:13,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:13,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:13,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:13,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:13,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:13,586 INFO L87 Difference]: Start difference. First operand 246804 states and 342848 transitions. Second operand 3 states. [2019-09-10 08:28:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:15,150 INFO L93 Difference]: Finished difference Result 471606 states and 643841 transitions. [2019-09-10 08:28:15,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:15,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-10 08:28:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:15,666 INFO L225 Difference]: With dead ends: 471606 [2019-09-10 08:28:15,666 INFO L226 Difference]: Without dead ends: 471606 [2019-09-10 08:28:15,666 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:28:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471606 states. [2019-09-10 08:28:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471606 to 443828. [2019-09-10 08:28:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443828 states. [2019-09-10 08:28:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443828 states to 443828 states and 610112 transitions. [2019-09-10 08:28:26,079 INFO L78 Accepts]: Start accepts. Automaton has 443828 states and 610112 transitions. Word has length 207 [2019-09-10 08:28:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:26,079 INFO L475 AbstractCegarLoop]: Abstraction has 443828 states and 610112 transitions. [2019-09-10 08:28:26,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 443828 states and 610112 transitions. [2019-09-10 08:28:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:28:26,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:26,098 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:26,098 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1520661203, now seen corresponding path program 1 times [2019-09-10 08:28:26,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:26,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:26,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:26,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:28:26,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:28:26,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2019-09-10 08:28:26,585 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [160], [163], [166], [168], [172], [175], [178], [180], [184], [187], [190], [192], [196], [199], [202], [204], [208], [211], [214], [216], [220], [223], [226], [228], [232], [235], [238], [240], [243], [247], [250], [253], [257], [260], [263], [266], [269], [271], [274], [277], [280], [282], [285], [288], [291], [293], [296], [299], [302], [304], [307], [310], [313], [315], [318], [321], [324], [326], [328], [331], [334], [337], [339], [341], [344], [347], [351], [353], [356], [357], [359], [362], [365], [373], [375], [378], [386], [388], [391], [399], [401], [404], [412], [414], [417], [425], [427], [430], [438], [440], [449], [451], [454], [457], [459], [474], [476], [479], [482], [484], [499], [501], [504], [507], [509], [524], [526], [529], [532], [534], [549], [551], [554], [557], [559], [574], [576], [579], [582], [584], [593], [598], [600], [603], [616], [618], [621], [624], [626], [772], [773], [777], [778], [779] [2019-09-10 08:28:26,666 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:28:26,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:28:26,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:28:29,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:28:29,023 INFO L272 AbstractInterpreter]: Visited 187 different actions 1894 times. Merged at 71 different actions 1446 times. Widened at 33 different actions 307 times. Performed 6687 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6687 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 257 fixpoints after 37 different actions. Largest state had 206 variables. [2019-09-10 08:28:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:29,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:28:29,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:28:29,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:28:29,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:29,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:28:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:29,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:28:29,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:28:29,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:29,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:31,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:28:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:34,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:28:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:28:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:28:34,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:28:34,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:28:34,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:28:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:28:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:28:34,457 INFO L87 Difference]: Start difference. First operand 443828 states and 610112 transitions. Second operand 21 states. [2019-09-10 08:28:34,687 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:28:35,763 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:28:36,751 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:28:37,225 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:28:37,954 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:28:38,219 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 08:28:39,519 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:28:39,886 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 08:28:40,601 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:28:43,080 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:28:43,472 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:28:43,835 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:28:46,948 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:28:47,340 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:28:47,826 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:28:48,201 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:28:48,608 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:28:49,052 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:28:49,461 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:28:49,824 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:28:50,122 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:28:50,381 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:28:50,739 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:28:51,141 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:28:51,524 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:28:52,122 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:28:52,762 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:28:53,283 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:28:53,615 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:28:54,050 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:28:55,266 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:28:55,813 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:28:56,277 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:28:56,613 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:28:56,957 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:28:57,211 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:28:57,866 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:28:58,245 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:28:59,069 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:28:59,489 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:28:59,844 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:29:00,166 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:29:00,651 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:29:01,058 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:29:01,655 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:02,307 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:02,672 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:29:03,025 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:29:03,606 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:03,993 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:04,527 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:29:05,010 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:29:05,591 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:29:06,881 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:29:07,205 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:29:07,557 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:29:08,050 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:29:08,492 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:29:08,860 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:29:09,299 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:29:09,777 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:29:10,266 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:29:10,641 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:29:10,975 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:29:11,334 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:29:11,685 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:29:12,201 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:29:12,660 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:29:13,055 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:13,503 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:29:14,001 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:14,379 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:29:14,863 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:29:15,410 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:29:15,864 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:29:16,324 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:29:16,691 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:29:21,233 WARN L188 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:29:21,898 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:22,343 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:29:22,884 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:29:23,216 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:29:23,620 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:29:24,062 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:29:24,399 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:29:24,710 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:29:25,545 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:29:25,935 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:29:36,588 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:29:37,142 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:29:37,954 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:29:38,601 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:29:39,526 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:29:40,111 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:29:40,694 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:29:41,253 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:29:41,682 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:29:42,276 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:29:42,692 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:29:43,107 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:29:43,611 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:29:44,215 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:29:44,675 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:29:45,065 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:29:45,411 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:29:47,128 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:29:47,771 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:29:48,260 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:29:48,968 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:29:49,481 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:29:49,859 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:29:50,277 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:29:50,712 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:29:51,115 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:29:52,174 WARN L188 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:29:52,634 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:29:53,105 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:29:53,497 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:29:53,858 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:29:54,236 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:29:54,886 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:29:55,470 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:29:55,959 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:29:56,448 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-09-10 08:29:56,920 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:29:57,304 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:29:57,908 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:29:58,464 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:29:58,900 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 08:29:59,290 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:29:59,696 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 08:30:00,300 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-09-10 08:30:04,480 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-09-10 08:30:08,763 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:30:09,198 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:30:09,642 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:30:10,105 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:30:10,516 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:30:21,044 WARN L188 SmtUtils]: Spent 10.43 s on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:30:21,566 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:30:21,992 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:30:22,559 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:30:23,010 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:30:23,524 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:30:24,054 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:30:24,389 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:30:24,838 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:30:25,427 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:30:25,894 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:30:26,262 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:30:26,908 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:30:27,190 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 08:30:27,631 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:30:28,199 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:30:28,769 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:30:29,204 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:30:29,666 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:30:30,104 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:30:31,126 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:30:33,542 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:30:34,044 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:30:34,399 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:30:34,740 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:30:35,299 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:30:35,799 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:30:36,213 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:30:36,597 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:30:37,099 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:30:37,416 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:30:37,919 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 08:30:38,307 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:30:38,709 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:30:39,020 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:30:39,575 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:30:39,942 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:30:40,440 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:30:40,876 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:41,279 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:41,665 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:30:42,231 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:30:42,609 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:30:43,436 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:30:44,001 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:30:44,620 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:30:45,060 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:45,496 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:30:45,941 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:30:46,375 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 08:30:46,693 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:30:47,123 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:30:47,682 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 08:30:48,010 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:30:48,330 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:30:48,829 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:49,383 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:30:49,829 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:50,288 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:30:50,705 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:51,160 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:30:51,554 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:30:52,054 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:30:54,574 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:30:55,054 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:30:56,725 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:30:57,376 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:31:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:36,623 INFO L93 Difference]: Finished difference Result 6990866 states and 9497025 transitions. [2019-09-10 08:31:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-09-10 08:31:36,623 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 208 [2019-09-10 08:31:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:07,964 INFO L225 Difference]: With dead ends: 6990866 [2019-09-10 08:32:07,964 INFO L226 Difference]: Without dead ends: 6990866 [2019-09-10 08:32:07,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 348 SyntacticMatches, 50 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21175 ImplicationChecksByTransitivity, 115.1s TimeCoverageRelationStatistics Valid=9601, Invalid=47281, Unknown=0, NotChecked=0, Total=56882 [2019-09-10 08:32:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990866 states.