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.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:29:44,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:29:44,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:29:44,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:29:44,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:29:44,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:29:44,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:29:44,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:29:44,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:29:44,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:29:44,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:29:44,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:29:44,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:29:44,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:29:44,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:29:44,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:29:44,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:29:44,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:29:44,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:29:44,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:29:44,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:29:44,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:29:44,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:29:44,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:29:44,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:29:44,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:29:44,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:29:44,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:29:44,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:29:44,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:29:44,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:29:44,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:29:44,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:29:44,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:29:44,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:29:44,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:29:44,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:29:44,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:29:44,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:29:44,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:29:44,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:29:44,257 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:29:44,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:29:44,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:29:44,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:29:44,297 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:29:44,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:29:44,297 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:29:44,298 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:29:44,298 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:29:44,298 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:29:44,298 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:29:44,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:29:44,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:29:44,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:29:44,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:29:44,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:29:44,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:29:44,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:29:44,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:29:44,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:29:44,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:29:44,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:29:44,303 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:29:44,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:29:44,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:29:44,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:29:44,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:29:44,304 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:29:44,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:29:44,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:29:44,305 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:29:44,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:29:44,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:29:44,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:29:44,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:29:44,370 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:29:44,371 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.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-10 08:29:44,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f79ff33/37c870c23a0e4b3e8a74c6b22816e946/FLAG28902b9d1 [2019-09-10 08:29:44,892 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:29:44,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-10 08:29:44,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f79ff33/37c870c23a0e4b3e8a74c6b22816e946/FLAG28902b9d1 [2019-09-10 08:29:45,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f79ff33/37c870c23a0e4b3e8a74c6b22816e946 [2019-09-10 08:29:45,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:29:45,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:29:45,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:29:45,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:29:45,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:29:45,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:45,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45, skipping insertion in model container [2019-09-10 08:29:45,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:45,283 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:29:45,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:29:45,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:29:45,823 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:29:45,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:29:45,985 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:29:45,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45 WrapperNode [2019-09-10 08:29:45,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:29:45,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:29:45,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:29:45,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:29:45,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:45,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:46,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:46,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:46,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:46,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:46,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (1/1) ... [2019-09-10 08:29:46,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:29:46,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:29:46,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:29:46,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:29:46,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (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:29:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:29:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:29:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:29:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:29:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:29:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:29:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:29:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:29:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:29:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:29:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:29:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:29:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:29:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:29:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:29:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:29:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:29:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:29:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:29:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:29:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:29:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:29:47,128 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:29:47,129 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:29:47,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:29:47 BoogieIcfgContainer [2019-09-10 08:29:47,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:29:47,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:29:47,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:29:47,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:29:47,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:29:45" (1/3) ... [2019-09-10 08:29:47,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c1b0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:29:47, skipping insertion in model container [2019-09-10 08:29:47,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:45" (2/3) ... [2019-09-10 08:29:47,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c1b0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:29:47, skipping insertion in model container [2019-09-10 08:29:47,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:29:47" (3/3) ... [2019-09-10 08:29:47,138 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+nlh-reducer.c [2019-09-10 08:29:47,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:29:47,156 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:29:47,173 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:29:47,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:29:47,201 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:29:47,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:29:47,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:29:47,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:29:47,201 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:29:47,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:29:47,202 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:29:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-09-10 08:29:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:29:47,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:47,240 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:29:47,242 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1051248920, now seen corresponding path program 1 times [2019-09-10 08:29:47,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:47,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:47,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:47,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:47,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:47,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:47,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:47,874 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-09-10 08:29:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:48,038 INFO L93 Difference]: Finished difference Result 314 states and 526 transitions. [2019-09-10 08:29:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:48,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 08:29:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:48,057 INFO L225 Difference]: With dead ends: 314 [2019-09-10 08:29:48,057 INFO L226 Difference]: Without dead ends: 306 [2019-09-10 08:29:48,059 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:29:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-10 08:29:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-10 08:29:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 434 transitions. [2019-09-10 08:29:48,151 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 434 transitions. Word has length 112 [2019-09-10 08:29:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:48,152 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 434 transitions. [2019-09-10 08:29:48,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 434 transitions. [2019-09-10 08:29:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:48,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:48,158 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:29:48,159 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash -458569337, now seen corresponding path program 1 times [2019-09-10 08:29:48,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:48,451 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:29:48,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:48,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:48,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:48,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:48,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:48,457 INFO L87 Difference]: Start difference. First operand 304 states and 434 transitions. Second operand 5 states. [2019-09-10 08:29:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:48,737 INFO L93 Difference]: Finished difference Result 304 states and 431 transitions. [2019-09-10 08:29:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:48,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 08:29:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:48,740 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:48,740 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:48,741 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:29:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 431 transitions. [2019-09-10 08:29:48,758 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 431 transitions. Word has length 114 [2019-09-10 08:29:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:48,759 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 431 transitions. [2019-09-10 08:29:48,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 431 transitions. [2019-09-10 08:29:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:29:48,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:48,763 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:29:48,764 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash 140292373, now seen corresponding path program 1 times [2019-09-10 08:29:48,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:48,977 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:29:48,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:48,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:48,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:48,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:48,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:48,984 INFO L87 Difference]: Start difference. First operand 304 states and 431 transitions. Second operand 5 states. [2019-09-10 08:29:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:49,261 INFO L93 Difference]: Finished difference Result 304 states and 428 transitions. [2019-09-10 08:29:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:49,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-10 08:29:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:49,265 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:49,265 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:49,266 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:29:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 428 transitions. [2019-09-10 08:29:49,278 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 428 transitions. Word has length 115 [2019-09-10 08:29:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:49,279 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 428 transitions. [2019-09-10 08:29:49,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 428 transitions. [2019-09-10 08:29:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:29:49,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:49,281 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:29:49,281 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1606063222, now seen corresponding path program 1 times [2019-09-10 08:29:49,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:49,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:49,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:49,474 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:29:49,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:49,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:49,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:49,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:49,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:49,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:49,477 INFO L87 Difference]: Start difference. First operand 304 states and 428 transitions. Second operand 5 states. [2019-09-10 08:29:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:49,694 INFO L93 Difference]: Finished difference Result 304 states and 425 transitions. [2019-09-10 08:29:49,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:49,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-10 08:29:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:49,697 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:49,697 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:49,699 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:29:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 425 transitions. [2019-09-10 08:29:49,714 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 425 transitions. Word has length 116 [2019-09-10 08:29:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:49,717 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 425 transitions. [2019-09-10 08:29:49,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 425 transitions. [2019-09-10 08:29:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:49,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:49,720 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:29:49,721 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1122053542, now seen corresponding path program 1 times [2019-09-10 08:29:49,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:49,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:49,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:49,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:49,907 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:29:49,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:49,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:49,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:49,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:49,910 INFO L87 Difference]: Start difference. First operand 304 states and 425 transitions. Second operand 5 states. [2019-09-10 08:29:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:50,113 INFO L93 Difference]: Finished difference Result 304 states and 422 transitions. [2019-09-10 08:29:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:50,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-10 08:29:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:50,116 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:50,117 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:50,117 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:29:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-10 08:29:50,126 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 117 [2019-09-10 08:29:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:50,127 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-10 08:29:50,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-10 08:29:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:29:50,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:50,129 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:29:50,129 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1734849881, now seen corresponding path program 1 times [2019-09-10 08:29:50,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:50,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:50,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:50,265 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:29:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:50,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:50,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:50,267 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 5 states. [2019-09-10 08:29:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:50,460 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2019-09-10 08:29:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:50,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-10 08:29:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:50,462 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:50,462 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:50,463 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:29:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 419 transitions. [2019-09-10 08:29:50,471 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 419 transitions. Word has length 118 [2019-09-10 08:29:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:50,472 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 419 transitions. [2019-09-10 08:29:50,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 419 transitions. [2019-09-10 08:29:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:29:50,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:50,473 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:29:50,474 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:50,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1494263947, now seen corresponding path program 1 times [2019-09-10 08:29:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:50,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:50,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:50,604 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:29:50,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:50,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:50,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:50,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:50,606 INFO L87 Difference]: Start difference. First operand 304 states and 419 transitions. Second operand 5 states. [2019-09-10 08:29:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:50,801 INFO L93 Difference]: Finished difference Result 304 states and 416 transitions. [2019-09-10 08:29:50,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:50,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-10 08:29:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:50,804 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:50,804 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:50,804 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:29:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 416 transitions. [2019-09-10 08:29:50,814 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 416 transitions. Word has length 119 [2019-09-10 08:29:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:50,814 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 416 transitions. [2019-09-10 08:29:50,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 416 transitions. [2019-09-10 08:29:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:50,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:50,816 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:29:50,817 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 776973317, now seen corresponding path program 1 times [2019-09-10 08:29:50,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:50,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:50,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:50,976 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:29:50,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:50,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:50,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:50,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:50,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:50,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:50,978 INFO L87 Difference]: Start difference. First operand 304 states and 416 transitions. Second operand 5 states. [2019-09-10 08:29:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:51,216 INFO L93 Difference]: Finished difference Result 304 states and 413 transitions. [2019-09-10 08:29:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:51,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:29:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:51,220 INFO L225 Difference]: With dead ends: 304 [2019-09-10 08:29:51,220 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 08:29:51,220 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:29:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 08:29:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-10 08:29:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 08:29:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 413 transitions. [2019-09-10 08:29:51,230 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 413 transitions. Word has length 120 [2019-09-10 08:29:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:51,231 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 413 transitions. [2019-09-10 08:29:51,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 413 transitions. [2019-09-10 08:29:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:51,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:51,233 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:29:51,234 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -510022136, now seen corresponding path program 1 times [2019-09-10 08:29:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:51,397 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:29:51,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:51,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:51,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:51,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:51,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:51,399 INFO L87 Difference]: Start difference. First operand 304 states and 413 transitions. Second operand 5 states. [2019-09-10 08:29:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:51,517 INFO L93 Difference]: Finished difference Result 718 states and 1029 transitions. [2019-09-10 08:29:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:51,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:29:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:51,521 INFO L225 Difference]: With dead ends: 718 [2019-09-10 08:29:51,521 INFO L226 Difference]: Without dead ends: 718 [2019-09-10 08:29:51,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:29:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-09-10 08:29:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 658. [2019-09-10 08:29:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-10 08:29:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 947 transitions. [2019-09-10 08:29:51,541 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 947 transitions. Word has length 121 [2019-09-10 08:29:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:51,541 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 947 transitions. [2019-09-10 08:29:51,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 947 transitions. [2019-09-10 08:29:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:51,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:51,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] [2019-09-10 08:29:51,544 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash 780943061, now seen corresponding path program 1 times [2019-09-10 08:29:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:51,707 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:29:51,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:51,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:51,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:51,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:51,711 INFO L87 Difference]: Start difference. First operand 658 states and 947 transitions. Second operand 5 states. [2019-09-10 08:29:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:51,847 INFO L93 Difference]: Finished difference Result 1161 states and 1696 transitions. [2019-09-10 08:29:51,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:51,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:29:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:51,856 INFO L225 Difference]: With dead ends: 1161 [2019-09-10 08:29:51,856 INFO L226 Difference]: Without dead ends: 1161 [2019-09-10 08:29:51,857 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:29:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-09-10 08:29:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 911. [2019-09-10 08:29:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-10 08:29:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1329 transitions. [2019-09-10 08:29:51,892 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1329 transitions. Word has length 121 [2019-09-10 08:29:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:51,893 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1329 transitions. [2019-09-10 08:29:51,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1329 transitions. [2019-09-10 08:29:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:51,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:51,895 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:29:51,895 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -909475221, now seen corresponding path program 1 times [2019-09-10 08:29:51,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:52,217 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:29:52,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:52,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:52,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:52,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:52,219 INFO L87 Difference]: Start difference. First operand 911 states and 1329 transitions. Second operand 9 states. [2019-09-10 08:29:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:52,513 INFO L93 Difference]: Finished difference Result 2459 states and 3634 transitions. [2019-09-10 08:29:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:52,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:52,525 INFO L225 Difference]: With dead ends: 2459 [2019-09-10 08:29:52,525 INFO L226 Difference]: Without dead ends: 2459 [2019-09-10 08:29:52,527 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:29:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-09-10 08:29:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 1075. [2019-09-10 08:29:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-10 08:29:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1575 transitions. [2019-09-10 08:29:52,569 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1575 transitions. Word has length 121 [2019-09-10 08:29:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:52,570 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1575 transitions. [2019-09-10 08:29:52,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1575 transitions. [2019-09-10 08:29:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:52,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:52,572 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:29:52,572 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:52,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1121640156, now seen corresponding path program 1 times [2019-09-10 08:29:52,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:52,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:52,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:52,754 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:29:52,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:52,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:52,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:52,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:52,757 INFO L87 Difference]: Start difference. First operand 1075 states and 1575 transitions. Second operand 5 states. [2019-09-10 08:29:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:52,956 INFO L93 Difference]: Finished difference Result 1503 states and 2210 transitions. [2019-09-10 08:29:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:52,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:29:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:52,967 INFO L225 Difference]: With dead ends: 1503 [2019-09-10 08:29:52,967 INFO L226 Difference]: Without dead ends: 1503 [2019-09-10 08:29:52,968 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:29:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-09-10 08:29:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1313. [2019-09-10 08:29:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-09-10 08:29:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1933 transitions. [2019-09-10 08:29:53,020 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1933 transitions. Word has length 121 [2019-09-10 08:29:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:53,021 INFO L475 AbstractCegarLoop]: Abstraction has 1313 states and 1933 transitions. [2019-09-10 08:29:53,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1933 transitions. [2019-09-10 08:29:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:53,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:53,024 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:29:53,024 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2117519461, now seen corresponding path program 1 times [2019-09-10 08:29:53,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:53,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:53,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:53,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:53,155 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:29:53,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:53,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:53,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:53,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:53,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:53,159 INFO L87 Difference]: Start difference. First operand 1313 states and 1933 transitions. Second operand 3 states. [2019-09-10 08:29:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:53,225 INFO L93 Difference]: Finished difference Result 1315 states and 1928 transitions. [2019-09-10 08:29:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:53,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:29:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:53,232 INFO L225 Difference]: With dead ends: 1315 [2019-09-10 08:29:53,232 INFO L226 Difference]: Without dead ends: 1315 [2019-09-10 08:29:53,233 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:29:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-09-10 08:29:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1313. [2019-09-10 08:29:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-09-10 08:29:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1927 transitions. [2019-09-10 08:29:53,270 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1927 transitions. Word has length 121 [2019-09-10 08:29:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:53,270 INFO L475 AbstractCegarLoop]: Abstraction has 1313 states and 1927 transitions. [2019-09-10 08:29:53,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1927 transitions. [2019-09-10 08:29:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:53,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:53,273 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:29:53,273 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1936230108, now seen corresponding path program 1 times [2019-09-10 08:29:53,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:53,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:53,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:53,349 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:29:53,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:53,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:53,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:53,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:53,351 INFO L87 Difference]: Start difference. First operand 1313 states and 1927 transitions. Second operand 3 states. [2019-09-10 08:29:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:53,392 INFO L93 Difference]: Finished difference Result 2325 states and 3394 transitions. [2019-09-10 08:29:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:53,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:29:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:53,403 INFO L225 Difference]: With dead ends: 2325 [2019-09-10 08:29:53,403 INFO L226 Difference]: Without dead ends: 2325 [2019-09-10 08:29:53,404 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:29:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-09-10 08:29:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2019-09-10 08:29:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-09-10 08:29:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3393 transitions. [2019-09-10 08:29:53,465 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3393 transitions. Word has length 121 [2019-09-10 08:29:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:53,466 INFO L475 AbstractCegarLoop]: Abstraction has 2323 states and 3393 transitions. [2019-09-10 08:29:53,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3393 transitions. [2019-09-10 08:29:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:53,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:53,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:53,468 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1496063070, now seen corresponding path program 1 times [2019-09-10 08:29:53,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:53,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:53,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:53,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:53,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:53,731 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:29:53,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:53,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:53,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:53,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:53,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:53,734 INFO L87 Difference]: Start difference. First operand 2323 states and 3393 transitions. Second operand 9 states. [2019-09-10 08:29:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:54,076 INFO L93 Difference]: Finished difference Result 6123 states and 8986 transitions. [2019-09-10 08:29:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:54,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:54,110 INFO L225 Difference]: With dead ends: 6123 [2019-09-10 08:29:54,110 INFO L226 Difference]: Without dead ends: 6123 [2019-09-10 08:29:54,113 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:29:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2019-09-10 08:29:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 2778. [2019-09-10 08:29:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2019-09-10 08:29:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4062 transitions. [2019-09-10 08:29:54,269 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4062 transitions. Word has length 121 [2019-09-10 08:29:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:54,270 INFO L475 AbstractCegarLoop]: Abstraction has 2778 states and 4062 transitions. [2019-09-10 08:29:54,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4062 transitions. [2019-09-10 08:29:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:54,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:54,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] [2019-09-10 08:29:54,272 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash -222165262, now seen corresponding path program 1 times [2019-09-10 08:29:54,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:54,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:54,529 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:29:54,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:54,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:54,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:54,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:54,532 INFO L87 Difference]: Start difference. First operand 2778 states and 4062 transitions. Second operand 9 states. [2019-09-10 08:29:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:54,852 INFO L93 Difference]: Finished difference Result 6343 states and 9310 transitions. [2019-09-10 08:29:54,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:54,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:54,884 INFO L225 Difference]: With dead ends: 6343 [2019-09-10 08:29:54,884 INFO L226 Difference]: Without dead ends: 6343 [2019-09-10 08:29:54,884 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:29:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-09-10 08:29:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 3092. [2019-09-10 08:29:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-10 08:29:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4525 transitions. [2019-09-10 08:29:55,060 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4525 transitions. Word has length 121 [2019-09-10 08:29:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:55,061 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 4525 transitions. [2019-09-10 08:29:55,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4525 transitions. [2019-09-10 08:29:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:55,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:55,064 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:29:55,064 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:55,065 INFO L82 PathProgramCache]: Analyzing trace with hash -684921793, now seen corresponding path program 1 times [2019-09-10 08:29:55,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:55,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:55,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:55,283 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:29:55,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:55,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:55,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:55,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:55,285 INFO L87 Difference]: Start difference. First operand 3092 states and 4525 transitions. Second operand 9 states. [2019-09-10 08:29:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:55,679 INFO L93 Difference]: Finished difference Result 5756 states and 8445 transitions. [2019-09-10 08:29:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:55,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:55,716 INFO L225 Difference]: With dead ends: 5756 [2019-09-10 08:29:55,716 INFO L226 Difference]: Without dead ends: 5756 [2019-09-10 08:29:55,716 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:29:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2019-09-10 08:29:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 3411. [2019-09-10 08:29:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2019-09-10 08:29:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4996 transitions. [2019-09-10 08:29:55,802 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4996 transitions. Word has length 121 [2019-09-10 08:29:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:55,802 INFO L475 AbstractCegarLoop]: Abstraction has 3411 states and 4996 transitions. [2019-09-10 08:29:55,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4996 transitions. [2019-09-10 08:29:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:29:55,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:55,806 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:29:55,806 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1220503032, now seen corresponding path program 1 times [2019-09-10 08:29:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:55,945 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:29:55,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:55,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:55,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:55,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:55,947 INFO L87 Difference]: Start difference. First operand 3411 states and 4996 transitions. Second operand 5 states. [2019-09-10 08:29:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:56,014 INFO L93 Difference]: Finished difference Result 5839 states and 8553 transitions. [2019-09-10 08:29:56,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:29:56,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-10 08:29:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:56,037 INFO L225 Difference]: With dead ends: 5839 [2019-09-10 08:29:56,037 INFO L226 Difference]: Without dead ends: 5839 [2019-09-10 08:29:56,038 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:29:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2019-09-10 08:29:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 3433. [2019-09-10 08:29:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2019-09-10 08:29:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 5010 transitions. [2019-09-10 08:29:56,172 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 5010 transitions. Word has length 122 [2019-09-10 08:29:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:56,173 INFO L475 AbstractCegarLoop]: Abstraction has 3433 states and 5010 transitions. [2019-09-10 08:29:56,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 5010 transitions. [2019-09-10 08:29:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:29:56,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:56,175 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:29:56,175 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash 124379524, now seen corresponding path program 1 times [2019-09-10 08:29:56,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:56,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:56,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:56,356 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:29:56,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:56,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:29:56,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:56,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:29:56,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:29:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:29:56,359 INFO L87 Difference]: Start difference. First operand 3433 states and 5010 transitions. Second operand 4 states. [2019-09-10 08:29:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:56,412 INFO L93 Difference]: Finished difference Result 4972 states and 7246 transitions. [2019-09-10 08:29:56,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:29:56,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-10 08:29:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:56,425 INFO L225 Difference]: With dead ends: 4972 [2019-09-10 08:29:56,425 INFO L226 Difference]: Without dead ends: 4972 [2019-09-10 08:29:56,427 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:29:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-09-10 08:29:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4970. [2019-09-10 08:29:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:29:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7245 transitions. [2019-09-10 08:29:56,522 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7245 transitions. Word has length 122 [2019-09-10 08:29:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:56,522 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7245 transitions. [2019-09-10 08:29:56,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:29:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7245 transitions. [2019-09-10 08:29:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:29:56,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:56,525 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:29:56,525 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash -605502652, now seen corresponding path program 1 times [2019-09-10 08:29:56,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:56,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:56,800 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:29:56,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:56,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:56,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:56,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:56,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:56,802 INFO L87 Difference]: Start difference. First operand 4970 states and 7245 transitions. Second operand 9 states. [2019-09-10 08:29:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:57,451 INFO L93 Difference]: Finished difference Result 9700 states and 14165 transitions. [2019-09-10 08:29:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:29:57,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:29:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:57,471 INFO L225 Difference]: With dead ends: 9700 [2019-09-10 08:29:57,472 INFO L226 Difference]: Without dead ends: 9700 [2019-09-10 08:29:57,472 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:29:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2019-09-10 08:29:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 4970. [2019-09-10 08:29:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:29:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7244 transitions. [2019-09-10 08:29:57,655 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7244 transitions. Word has length 123 [2019-09-10 08:29:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:57,655 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7244 transitions. [2019-09-10 08:29:57,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7244 transitions. [2019-09-10 08:29:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:29:57,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:57,658 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:29:57,658 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1823653614, now seen corresponding path program 1 times [2019-09-10 08:29:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:57,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:57,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:57,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:57,928 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:29:57,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:29:57,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:57,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:29:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:29:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:29:57,930 INFO L87 Difference]: Start difference. First operand 4970 states and 7244 transitions. Second operand 10 states. [2019-09-10 08:29:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:59,042 INFO L93 Difference]: Finished difference Result 9918 states and 14428 transitions. [2019-09-10 08:29:59,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:29:59,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-10 08:29:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:59,064 INFO L225 Difference]: With dead ends: 9918 [2019-09-10 08:29:59,064 INFO L226 Difference]: Without dead ends: 9918 [2019-09-10 08:29:59,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9918 states. [2019-09-10 08:29:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9918 to 4970. [2019-09-10 08:29:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:29:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7240 transitions. [2019-09-10 08:29:59,174 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7240 transitions. Word has length 123 [2019-09-10 08:29:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:59,174 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7240 transitions. [2019-09-10 08:29:59,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:29:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7240 transitions. [2019-09-10 08:29:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:29:59,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:59,177 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:29:59,177 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1180348485, now seen corresponding path program 1 times [2019-09-10 08:29:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:59,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:59,484 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:29:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:59,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:29:59,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:59,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:29:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:29:59,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:29:59,486 INFO L87 Difference]: Start difference. First operand 4970 states and 7240 transitions. Second operand 10 states. [2019-09-10 08:30:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:00,489 INFO L93 Difference]: Finished difference Result 9785 states and 14235 transitions. [2019-09-10 08:30:00,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:30:00,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2019-09-10 08:30:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:00,511 INFO L225 Difference]: With dead ends: 9785 [2019-09-10 08:30:00,511 INFO L226 Difference]: Without dead ends: 9785 [2019-09-10 08:30:00,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2019-09-10 08:30:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 4970. [2019-09-10 08:30:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:30:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7238 transitions. [2019-09-10 08:30:00,634 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7238 transitions. Word has length 123 [2019-09-10 08:30:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:00,635 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7238 transitions. [2019-09-10 08:30:00,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:30:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7238 transitions. [2019-09-10 08:30:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:30:00,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:00,637 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:30:00,637 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash -165022808, now seen corresponding path program 1 times [2019-09-10 08:30:00,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:00,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:00,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:00,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:00,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:30:00,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:00,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:30:00,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:30:00,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:30:00,915 INFO L87 Difference]: Start difference. First operand 4970 states and 7238 transitions. Second operand 10 states. [2019-09-10 08:30:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:02,136 INFO L93 Difference]: Finished difference Result 9919 states and 14419 transitions. [2019-09-10 08:30:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:30:02,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-10 08:30:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:02,162 INFO L225 Difference]: With dead ends: 9919 [2019-09-10 08:30:02,162 INFO L226 Difference]: Without dead ends: 9919 [2019-09-10 08:30:02,163 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:30:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2019-09-10 08:30:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 4970. [2019-09-10 08:30:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:30:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7232 transitions. [2019-09-10 08:30:02,260 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7232 transitions. Word has length 124 [2019-09-10 08:30:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:02,260 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7232 transitions. [2019-09-10 08:30:02,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:30:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7232 transitions. [2019-09-10 08:30:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:30:02,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:02,262 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:30:02,263 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -600651996, now seen corresponding path program 1 times [2019-09-10 08:30:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:02,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:02,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:02,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:02,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:02,527 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:30:02,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:02,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:30:02,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:02,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:30:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:30:02,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:30:02,531 INFO L87 Difference]: Start difference. First operand 4970 states and 7232 transitions. Second operand 10 states. [2019-09-10 08:30:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:03,418 INFO L93 Difference]: Finished difference Result 9869 states and 14328 transitions. [2019-09-10 08:30:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:30:03,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2019-09-10 08:30:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:03,435 INFO L225 Difference]: With dead ends: 9869 [2019-09-10 08:30:03,436 INFO L226 Difference]: Without dead ends: 9869 [2019-09-10 08:30:03,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9869 states. [2019-09-10 08:30:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9869 to 4970. [2019-09-10 08:30:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:30:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7224 transitions. [2019-09-10 08:30:03,538 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7224 transitions. Word has length 125 [2019-09-10 08:30:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:03,539 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7224 transitions. [2019-09-10 08:30:03,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:30:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7224 transitions. [2019-09-10 08:30:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:30:03,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:03,541 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:30:03,542 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:03,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1027454488, now seen corresponding path program 1 times [2019-09-10 08:30:03,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:03,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:03,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:03,855 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:30:03,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:03,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:30:03,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:03,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:30:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:30:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:30:03,857 INFO L87 Difference]: Start difference. First operand 4970 states and 7224 transitions. Second operand 10 states. [2019-09-10 08:30:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:04,913 INFO L93 Difference]: Finished difference Result 9899 states and 14363 transitions. [2019-09-10 08:30:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:30:04,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-09-10 08:30:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:04,929 INFO L225 Difference]: With dead ends: 9899 [2019-09-10 08:30:04,930 INFO L226 Difference]: Without dead ends: 9899 [2019-09-10 08:30:04,930 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:30:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2019-09-10 08:30:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 4970. [2019-09-10 08:30:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2019-09-10 08:30:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7217 transitions. [2019-09-10 08:30:05,019 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7217 transitions. Word has length 126 [2019-09-10 08:30:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:05,020 INFO L475 AbstractCegarLoop]: Abstraction has 4970 states and 7217 transitions. [2019-09-10 08:30:05,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:30:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7217 transitions. [2019-09-10 08:30:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:30:05,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:05,022 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:30:05,022 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1728637094, now seen corresponding path program 1 times [2019-09-10 08:30:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:05,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:05,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:05,272 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:30:05,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:05,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:30:05,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:05,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:30:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:30:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:30:05,274 INFO L87 Difference]: Start difference. First operand 4970 states and 7217 transitions. Second operand 10 states. [2019-09-10 08:30:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:06,978 INFO L93 Difference]: Finished difference Result 18548 states and 26772 transitions. [2019-09-10 08:30:06,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:30:06,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-10 08:30:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:07,007 INFO L225 Difference]: With dead ends: 18548 [2019-09-10 08:30:07,008 INFO L226 Difference]: Without dead ends: 18548 [2019-09-10 08:30:07,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:30:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18548 states. [2019-09-10 08:30:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18548 to 4997. [2019-09-10 08:30:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4997 states. [2019-09-10 08:30:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 7253 transitions. [2019-09-10 08:30:07,161 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 7253 transitions. Word has length 127 [2019-09-10 08:30:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:07,161 INFO L475 AbstractCegarLoop]: Abstraction has 4997 states and 7253 transitions. [2019-09-10 08:30:07,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:30:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 7253 transitions. [2019-09-10 08:30:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:30:07,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:07,164 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:30:07,164 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2105653509, now seen corresponding path program 1 times [2019-09-10 08:30:07,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:07,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:07,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:07,244 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:30:07,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:07,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:07,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:07,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:07,245 INFO L87 Difference]: Start difference. First operand 4997 states and 7253 transitions. Second operand 3 states. [2019-09-10 08:30:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:07,281 INFO L93 Difference]: Finished difference Result 9475 states and 13787 transitions. [2019-09-10 08:30:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:07,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:30:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:07,293 INFO L225 Difference]: With dead ends: 9475 [2019-09-10 08:30:07,293 INFO L226 Difference]: Without dead ends: 9475 [2019-09-10 08:30:07,293 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:30:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9475 states. [2019-09-10 08:30:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9475 to 9221. [2019-09-10 08:30:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9221 states. [2019-09-10 08:30:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9221 states to 9221 states and 13345 transitions. [2019-09-10 08:30:07,421 INFO L78 Accepts]: Start accepts. Automaton has 9221 states and 13345 transitions. Word has length 128 [2019-09-10 08:30:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:07,422 INFO L475 AbstractCegarLoop]: Abstraction has 9221 states and 13345 transitions. [2019-09-10 08:30:07,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9221 states and 13345 transitions. [2019-09-10 08:30:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:30:07,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:07,425 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:30:07,425 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1669775685, now seen corresponding path program 1 times [2019-09-10 08:30:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:09,121 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 08:30:09,279 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:30:09,535 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:30:09,724 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:30:09,946 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:30:10,139 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:30:10,371 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 08:30:10,586 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 08:30:10,828 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:30:11,072 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 08:30:11,326 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:30:11,525 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:30:11,769 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 08:30:11,953 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:30:12,148 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:30:14,288 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:30:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-10 08:30:14,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:14,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 08:30:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 08:30:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:30:14,290 INFO L87 Difference]: Start difference. First operand 9221 states and 13345 transitions. Second operand 46 states. [2019-09-10 08:30:14,545 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:30:15,428 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-09-10 08:30:15,791 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 08:30:16,000 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:30:16,216 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:30:16,455 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:30:16,793 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:30:17,880 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 08:30:18,318 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:30:18,926 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 139 [2019-09-10 08:30:19,727 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 153 [2019-09-10 08:30:20,446 WARN L188 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 138 [2019-09-10 08:30:21,298 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 153 [2019-09-10 08:30:22,201 WARN L188 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 160 [2019-09-10 08:30:23,304 WARN L188 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 175 [2019-09-10 08:30:24,508 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 220 DAG size of output: 182 [2019-09-10 08:30:25,832 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 237 DAG size of output: 193 [2019-09-10 08:30:27,174 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:30:29,390 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 272 DAG size of output: 223 [2019-09-10 08:30:31,734 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 286 DAG size of output: 233 [2019-09-10 08:30:32,348 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-09-10 08:30:32,828 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:30:33,383 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:30:33,906 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 101 [2019-09-10 08:30:34,355 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-09-10 08:30:34,989 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 08:30:35,703 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:30:36,323 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:30:36,964 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:30:37,271 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:30:38,386 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:30:39,158 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:30:40,422 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:30:41,309 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:30:42,495 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:30:43,423 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 08:30:43,954 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:30:44,764 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:30:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:56,031 INFO L93 Difference]: Finished difference Result 37305 states and 54123 transitions. [2019-09-10 08:30:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 08:30:56,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-10 08:30:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:56,074 INFO L225 Difference]: With dead ends: 37305 [2019-09-10 08:30:56,074 INFO L226 Difference]: Without dead ends: 37305 [2019-09-10 08:30:56,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=1613, Invalid=8089, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 08:30:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37305 states. [2019-09-10 08:30:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37305 to 9261. [2019-09-10 08:30:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9261 states. [2019-09-10 08:30:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9261 states to 9261 states and 13395 transitions. [2019-09-10 08:30:56,502 INFO L78 Accepts]: Start accepts. Automaton has 9261 states and 13395 transitions. Word has length 128 [2019-09-10 08:30:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:56,503 INFO L475 AbstractCegarLoop]: Abstraction has 9261 states and 13395 transitions. [2019-09-10 08:30:56,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 08:30:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 9261 states and 13395 transitions. [2019-09-10 08:30:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:30:56,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:56,505 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:30:56,505 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1390990270, now seen corresponding path program 1 times [2019-09-10 08:30:56,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:56,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:57,408 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:30:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:58,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:30:58,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:58,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:30:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:30:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:30:58,190 INFO L87 Difference]: Start difference. First operand 9261 states and 13395 transitions. Second operand 25 states. [2019-09-10 08:30:59,429 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:30:59,799 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 08:31:00,169 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:31:00,561 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 08:31:01,273 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-09-10 08:31:02,027 WARN L188 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-09-10 08:31:02,284 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:31:02,447 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:31:02,839 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 08:31:03,291 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 08:31:03,565 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:31:03,950 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:31:04,538 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:31:05,183 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:31:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:08,741 INFO L93 Difference]: Finished difference Result 40668 states and 59030 transitions. [2019-09-10 08:31:08,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:31:08,741 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-10 08:31:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:08,791 INFO L225 Difference]: With dead ends: 40668 [2019-09-10 08:31:08,791 INFO L226 Difference]: Without dead ends: 40668 [2019-09-10 08:31:08,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:31:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40668 states. [2019-09-10 08:31:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40668 to 9281. [2019-09-10 08:31:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2019-09-10 08:31:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 13417 transitions. [2019-09-10 08:31:09,173 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 13417 transitions. Word has length 128 [2019-09-10 08:31:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:09,173 INFO L475 AbstractCegarLoop]: Abstraction has 9281 states and 13417 transitions. [2019-09-10 08:31:09,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:31:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 13417 transitions. [2019-09-10 08:31:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:31:09,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:09,175 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:31:09,175 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash 970646882, now seen corresponding path program 1 times [2019-09-10 08:31:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:09,944 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-10 08:31:10,242 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 08:31:10,412 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:31:10,618 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:31:10,788 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:31:11,031 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:31:11,218 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 08:31:11,464 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:31:11,690 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:31:11,939 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:31:12,142 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:31:12,393 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 08:31:12,785 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:31:14,700 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:31:14,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:14,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-10 08:31:14,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:14,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 08:31:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 08:31:14,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:31:14,702 INFO L87 Difference]: Start difference. First operand 9281 states and 13417 transitions. Second operand 41 states. [2019-09-10 08:31:14,974 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-10 08:31:16,319 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 08:31:16,526 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 08:31:16,754 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-09-10 08:31:17,019 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-10 08:31:17,465 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-10 08:31:18,270 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:31:18,640 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 84 [2019-09-10 08:31:19,136 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 102 [2019-09-10 08:31:19,687 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 110 [2019-09-10 08:31:20,403 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 128 [2019-09-10 08:31:21,206 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 137 [2019-09-10 08:31:22,189 WARN L188 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 156 [2019-09-10 08:31:23,231 WARN L188 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 165 [2019-09-10 08:31:24,545 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 240 DAG size of output: 183 [2019-09-10 08:31:25,825 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 252 DAG size of output: 191 [2019-09-10 08:31:27,329 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 273 DAG size of output: 206 [2019-09-10 08:31:27,797 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-09-10 08:31:28,210 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-09-10 08:31:28,617 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-09-10 08:31:29,221 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-10 08:31:29,686 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-10 08:31:30,462 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-10 08:31:30,901 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-09-10 08:31:31,987 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-09-10 08:31:32,538 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:31:33,559 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-10 08:31:34,191 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-10 08:31:35,139 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-10 08:31:35,651 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-10 08:31:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:44,727 INFO L93 Difference]: Finished difference Result 36865 states and 53479 transitions. [2019-09-10 08:31:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 08:31:44,728 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 128 [2019-09-10 08:31:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:44,759 INFO L225 Difference]: With dead ends: 36865 [2019-09-10 08:31:44,759 INFO L226 Difference]: Without dead ends: 36865 [2019-09-10 08:31:44,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1308, Invalid=5012, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 08:31:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36865 states. [2019-09-10 08:31:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36865 to 9331. [2019-09-10 08:31:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9331 states. [2019-09-10 08:31:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9331 states to 9331 states and 13481 transitions. [2019-09-10 08:31:45,002 INFO L78 Accepts]: Start accepts. Automaton has 9331 states and 13481 transitions. Word has length 128 [2019-09-10 08:31:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:45,003 INFO L475 AbstractCegarLoop]: Abstraction has 9331 states and 13481 transitions. [2019-09-10 08:31:45,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 08:31:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9331 states and 13481 transitions. [2019-09-10 08:31:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:31:45,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:45,005 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:31:45,005 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1768753698, now seen corresponding path program 1 times [2019-09-10 08:31:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:45,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:46,629 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:31:46,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:46,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:31:46,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:46,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:31:46,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:31:46,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:31:46,631 INFO L87 Difference]: Start difference. First operand 9331 states and 13481 transitions. Second operand 24 states. [2019-09-10 08:31:47,866 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:31:48,115 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 08:31:48,534 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:31:49,288 WARN L188 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-09-10 08:31:50,091 WARN L188 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2019-09-10 08:31:50,324 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:31:50,550 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:31:50,800 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:31:51,110 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 08:31:51,457 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:31:51,827 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:31:52,121 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:31:52,459 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:31:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:54,528 INFO L93 Difference]: Finished difference Result 38740 states and 56158 transitions. [2019-09-10 08:31:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:31:54,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-10 08:31:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:54,568 INFO L225 Difference]: With dead ends: 38740 [2019-09-10 08:31:54,569 INFO L226 Difference]: Without dead ends: 38740 [2019-09-10 08:31:54,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=490, Invalid=1960, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:31:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38740 states. [2019-09-10 08:31:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38740 to 9447. [2019-09-10 08:31:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9447 states. [2019-09-10 08:31:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9447 states to 9447 states and 13638 transitions. [2019-09-10 08:31:54,769 INFO L78 Accepts]: Start accepts. Automaton has 9447 states and 13638 transitions. Word has length 128 [2019-09-10 08:31:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:54,769 INFO L475 AbstractCegarLoop]: Abstraction has 9447 states and 13638 transitions. [2019-09-10 08:31:54,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:31:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 9447 states and 13638 transitions. [2019-09-10 08:31:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:31:54,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:54,772 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:31:54,772 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash 859171391, now seen corresponding path program 1 times [2019-09-10 08:31:54,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:54,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:54,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:54,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:55,934 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:31:56,607 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:31:56,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:56,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:31:56,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:56,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:31:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:31:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:31:56,609 INFO L87 Difference]: Start difference. First operand 9447 states and 13638 transitions. Second operand 25 states. [2019-09-10 08:31:57,777 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 08:31:58,049 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:31:58,424 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:31:58,824 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-10 08:31:59,353 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-09-10 08:31:59,902 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-09-10 08:32:00,137 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 08:32:00,611 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:32:01,079 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:32:01,308 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:32:01,669 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:32:02,169 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:32:02,583 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:32:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,335 INFO L93 Difference]: Finished difference Result 44043 states and 63874 transitions. [2019-09-10 08:32:05,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:32:05,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-10 08:32:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,373 INFO L225 Difference]: With dead ends: 44043 [2019-09-10 08:32:05,373 INFO L226 Difference]: Without dead ends: 44043 [2019-09-10 08:32:05,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:32:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44043 states. [2019-09-10 08:32:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44043 to 9451. [2019-09-10 08:32:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9451 states. [2019-09-10 08:32:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9451 states to 9451 states and 13638 transitions. [2019-09-10 08:32:05,677 INFO L78 Accepts]: Start accepts. Automaton has 9451 states and 13638 transitions. Word has length 128 [2019-09-10 08:32:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,677 INFO L475 AbstractCegarLoop]: Abstraction has 9451 states and 13638 transitions. [2019-09-10 08:32:05,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:32:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9451 states and 13638 transitions. [2019-09-10 08:32:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:32:05,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,680 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:32:05,680 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash 759484704, now seen corresponding path program 1 times [2019-09-10 08:32:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:07,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:07,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:32:07,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:07,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:32:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:32:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:32:07,422 INFO L87 Difference]: Start difference. First operand 9451 states and 13638 transitions. Second operand 24 states. [2019-09-10 08:32:08,501 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:32:08,696 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:32:08,933 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:32:09,249 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-10 08:32:09,632 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-10 08:32:10,145 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 121 [2019-09-10 08:32:10,372 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:32:10,604 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:32:10,988 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:32:11,351 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:32:11,759 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:32:12,742 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:32:13,415 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:32:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:16,411 INFO L93 Difference]: Finished difference Result 59455 states and 86134 transitions. [2019-09-10 08:32:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:32:16,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 128 [2019-09-10 08:32:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:16,463 INFO L225 Difference]: With dead ends: 59455 [2019-09-10 08:32:16,463 INFO L226 Difference]: Without dead ends: 59455 [2019-09-10 08:32:16,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:32:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59455 states. [2019-09-10 08:32:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59455 to 9600. [2019-09-10 08:32:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9600 states. [2019-09-10 08:32:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9600 states to 9600 states and 13831 transitions. [2019-09-10 08:32:16,790 INFO L78 Accepts]: Start accepts. Automaton has 9600 states and 13831 transitions. Word has length 128 [2019-09-10 08:32:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:16,790 INFO L475 AbstractCegarLoop]: Abstraction has 9600 states and 13831 transitions. [2019-09-10 08:32:16,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:32:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9600 states and 13831 transitions. [2019-09-10 08:32:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:16,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:16,793 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:32:16,793 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 568996734, now seen corresponding path program 1 times [2019-09-10 08:32:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:16,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:17,687 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:32:17,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:17,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:32:17,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:17,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:32:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:32:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:32:17,689 INFO L87 Difference]: Start difference. First operand 9600 states and 13831 transitions. Second operand 15 states. [2019-09-10 08:32:18,230 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:32:18,394 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:32:18,573 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:32:18,747 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:32:18,941 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:32:19,222 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:32:19,432 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:32:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:20,164 INFO L93 Difference]: Finished difference Result 45317 states and 65777 transitions. [2019-09-10 08:32:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:32:20,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 129 [2019-09-10 08:32:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:20,206 INFO L225 Difference]: With dead ends: 45317 [2019-09-10 08:32:20,206 INFO L226 Difference]: Without dead ends: 45317 [2019-09-10 08:32:20,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:32:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-09-10 08:32:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 9509. [2019-09-10 08:32:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9509 states. [2019-09-10 08:32:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9509 states to 9509 states and 13711 transitions. [2019-09-10 08:32:20,487 INFO L78 Accepts]: Start accepts. Automaton has 9509 states and 13711 transitions. Word has length 129 [2019-09-10 08:32:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:20,487 INFO L475 AbstractCegarLoop]: Abstraction has 9509 states and 13711 transitions. [2019-09-10 08:32:20,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:32:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9509 states and 13711 transitions. [2019-09-10 08:32:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:20,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:20,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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:20,489 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash -279551843, now seen corresponding path program 1 times [2019-09-10 08:32:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:20,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:21,041 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:32:21,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:21,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:32:21,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:21,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:32:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:32:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:32:21,043 INFO L87 Difference]: Start difference. First operand 9509 states and 13711 transitions. Second operand 13 states. [2019-09-10 08:32:21,405 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 08:32:21,552 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:32:21,702 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 08:32:21,993 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:32:22,200 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:32:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:22,460 INFO L93 Difference]: Finished difference Result 36622 states and 53043 transitions. [2019-09-10 08:32:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:22,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:32:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:22,571 INFO L225 Difference]: With dead ends: 36622 [2019-09-10 08:32:22,572 INFO L226 Difference]: Without dead ends: 36622 [2019-09-10 08:32:22,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:32:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36622 states. [2019-09-10 08:32:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36622 to 9438. [2019-09-10 08:32:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9438 states. [2019-09-10 08:32:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 13604 transitions. [2019-09-10 08:32:22,744 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 13604 transitions. Word has length 129 [2019-09-10 08:32:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:22,745 INFO L475 AbstractCegarLoop]: Abstraction has 9438 states and 13604 transitions. [2019-09-10 08:32:22,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:32:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 13604 transitions. [2019-09-10 08:32:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:22,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:22,747 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:22,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1197732160, now seen corresponding path program 1 times [2019-09-10 08:32:22,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:22,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:22,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:22,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:24,004 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:32:24,153 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:32:24,321 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:32:24,613 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:32:25,517 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:32:25,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:32:25,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:25,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:32:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:32:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:32:25,519 INFO L87 Difference]: Start difference. First operand 9438 states and 13604 transitions. Second operand 31 states. [2019-09-10 08:32:26,771 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-10 08:32:27,288 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 08:32:27,667 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 08:32:28,097 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:32:28,598 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-09-10 08:32:29,256 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-09-10 08:32:29,987 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2019-09-10 08:32:30,926 WARN L188 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 161 [2019-09-10 08:32:31,940 WARN L188 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2019-09-10 08:32:32,252 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 08:32:32,481 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 08:32:32,909 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 08:32:33,381 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-10 08:32:33,784 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 08:32:34,224 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 08:32:34,927 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:32:35,426 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 08:32:36,208 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:32:36,703 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 08:32:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:41,662 INFO L93 Difference]: Finished difference Result 43159 states and 62559 transitions. [2019-09-10 08:32:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:32:41,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2019-09-10 08:32:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:41,703 INFO L225 Difference]: With dead ends: 43159 [2019-09-10 08:32:41,703 INFO L226 Difference]: Without dead ends: 43159 [2019-09-10 08:32:41,704 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:32:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43159 states. [2019-09-10 08:32:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43159 to 9452. [2019-09-10 08:32:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-10 08:32:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 13621 transitions. [2019-09-10 08:32:42,100 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 13621 transitions. Word has length 129 [2019-09-10 08:32:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:42,100 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 13621 transitions. [2019-09-10 08:32:42,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:32:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 13621 transitions. [2019-09-10 08:32:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:42,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:42,102 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:32:42,103 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash -59208219, now seen corresponding path program 1 times [2019-09-10 08:32:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:42,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:42,719 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:32:42,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:42,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:32:42,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:42,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:32:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:32:42,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:32:42,721 INFO L87 Difference]: Start difference. First operand 9452 states and 13621 transitions. Second operand 16 states. [2019-09-10 08:32:43,390 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:32:43,606 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:32:43,825 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:32:44,028 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:32:44,416 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:32:44,619 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:32:44,869 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:32:45,036 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:32:45,237 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:32:45,708 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:32:45,901 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:32:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,158 INFO L93 Difference]: Finished difference Result 58354 states and 84591 transitions. [2019-09-10 08:32:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:32:46,159 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 129 [2019-09-10 08:32:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:46,218 INFO L225 Difference]: With dead ends: 58354 [2019-09-10 08:32:46,218 INFO L226 Difference]: Without dead ends: 58354 [2019-09-10 08:32:46,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:32:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58354 states. [2019-09-10 08:32:46,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58354 to 9321. [2019-09-10 08:32:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9321 states. [2019-09-10 08:32:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9321 states to 9321 states and 13458 transitions. [2019-09-10 08:32:46,556 INFO L78 Accepts]: Start accepts. Automaton has 9321 states and 13458 transitions. Word has length 129 [2019-09-10 08:32:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,557 INFO L475 AbstractCegarLoop]: Abstraction has 9321 states and 13458 transitions. [2019-09-10 08:32:46,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:32:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 9321 states and 13458 transitions. [2019-09-10 08:32:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:46,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,558 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:32:46,559 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash -829357733, now seen corresponding path program 1 times [2019-09-10 08:32:46,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,890 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-09-10 08:32:47,460 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:32:47,597 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:32:47,778 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:32:47,924 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:32:48,096 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:32:49,263 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:32:49,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:49,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 08:32:49,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:49,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:32:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:32:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:32:49,264 INFO L87 Difference]: Start difference. First operand 9321 states and 13458 transitions. Second operand 29 states. [2019-09-10 08:32:49,435 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-09-10 08:32:50,603 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-09-10 08:32:51,137 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-09-10 08:32:51,381 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2019-09-10 08:32:51,767 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 69 [2019-09-10 08:32:52,175 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 76 [2019-09-10 08:32:52,667 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 93 [2019-09-10 08:32:53,311 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 101 [2019-09-10 08:32:54,017 WARN L188 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 118 [2019-09-10 08:32:54,355 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-10 08:32:54,676 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-10 08:32:54,989 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-09-10 08:32:55,438 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-10 08:32:55,768 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-10 08:32:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:59,880 INFO L93 Difference]: Finished difference Result 33259 states and 48208 transitions. [2019-09-10 08:32:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:32:59,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2019-09-10 08:32:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:59,911 INFO L225 Difference]: With dead ends: 33259 [2019-09-10 08:32:59,911 INFO L226 Difference]: Without dead ends: 33259 [2019-09-10 08:32:59,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=536, Invalid=2014, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:32:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33259 states. [2019-09-10 08:33:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33259 to 9319. [2019-09-10 08:33:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-09-10 08:33:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 13454 transitions. [2019-09-10 08:33:00,119 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 13454 transitions. Word has length 129 [2019-09-10 08:33:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:00,119 INFO L475 AbstractCegarLoop]: Abstraction has 9319 states and 13454 transitions. [2019-09-10 08:33:00,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:33:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 13454 transitions. [2019-09-10 08:33:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:00,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:00,121 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:33:00,121 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1635491301, now seen corresponding path program 1 times [2019-09-10 08:33:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:00,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:00,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:01,004 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2019-09-10 08:33:01,135 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:33:01,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:01,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:33:01,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:01,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:33:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:33:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:33:01,137 INFO L87 Difference]: Start difference. First operand 9319 states and 13454 transitions. Second operand 17 states. [2019-09-10 08:33:01,922 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-09-10 08:33:02,124 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-09-10 08:33:02,296 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 08:33:02,472 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:33:02,618 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:33:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:04,039 INFO L93 Difference]: Finished difference Result 42470 states and 61701 transitions. [2019-09-10 08:33:04,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:33:04,040 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2019-09-10 08:33:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:04,086 INFO L225 Difference]: With dead ends: 42470 [2019-09-10 08:33:04,086 INFO L226 Difference]: Without dead ends: 42470 [2019-09-10 08:33:04,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:33:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42470 states. [2019-09-10 08:33:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42470 to 9304. [2019-09-10 08:33:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9304 states. [2019-09-10 08:33:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 13436 transitions. [2019-09-10 08:33:04,364 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 13436 transitions. Word has length 129 [2019-09-10 08:33:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:04,365 INFO L475 AbstractCegarLoop]: Abstraction has 9304 states and 13436 transitions. [2019-09-10 08:33:04,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:33:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 13436 transitions. [2019-09-10 08:33:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:04,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:04,366 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:33:04,366 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1459134333, now seen corresponding path program 1 times [2019-09-10 08:33:04,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:04,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:04,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:05,350 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:33:05,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:05,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:33:05,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:05,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:33:05,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:33:05,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:05,351 INFO L87 Difference]: Start difference. First operand 9304 states and 13436 transitions. Second operand 19 states. [2019-09-10 08:33:06,011 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 08:33:06,225 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:33:06,616 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-09-10 08:33:07,079 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 08:33:07,259 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:33:07,666 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:33:07,992 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:33:08,172 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:33:08,439 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:33:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:09,334 INFO L93 Difference]: Finished difference Result 45298 states and 65766 transitions. [2019-09-10 08:33:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:33:09,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-10 08:33:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:09,376 INFO L225 Difference]: With dead ends: 45298 [2019-09-10 08:33:09,377 INFO L226 Difference]: Without dead ends: 45298 [2019-09-10 08:33:09,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:33:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45298 states. [2019-09-10 08:33:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45298 to 9278. [2019-09-10 08:33:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2019-09-10 08:33:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 13404 transitions. [2019-09-10 08:33:09,642 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 13404 transitions. Word has length 129 [2019-09-10 08:33:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:09,642 INFO L475 AbstractCegarLoop]: Abstraction has 9278 states and 13404 transitions. [2019-09-10 08:33:09,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:33:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 13404 transitions. [2019-09-10 08:33:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:09,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:09,644 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:33:09,644 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1282415388, now seen corresponding path program 1 times [2019-09-10 08:33:09,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:09,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:09,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:09,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:09,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:10,550 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:33:10,827 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:33:11,467 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:33:11,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:11,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:33:11,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:11,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:33:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:33:11,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:33:11,469 INFO L87 Difference]: Start difference. First operand 9278 states and 13404 transitions. Second operand 25 states. [2019-09-10 08:33:12,739 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:33:12,986 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-10 08:33:13,353 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-10 08:33:13,774 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-09-10 08:33:14,383 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 125 [2019-09-10 08:33:15,028 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 138 [2019-09-10 08:33:15,299 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:33:15,482 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 08:33:15,819 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:33:16,169 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:33:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:18,357 INFO L93 Difference]: Finished difference Result 32276 states and 46807 transitions. [2019-09-10 08:33:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:33:18,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-09-10 08:33:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:18,390 INFO L225 Difference]: With dead ends: 32276 [2019-09-10 08:33:18,390 INFO L226 Difference]: Without dead ends: 32276 [2019-09-10 08:33:18,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:33:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32276 states. [2019-09-10 08:33:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32276 to 9266. [2019-09-10 08:33:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9266 states. [2019-09-10 08:33:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 13387 transitions. [2019-09-10 08:33:18,597 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 13387 transitions. Word has length 129 [2019-09-10 08:33:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:18,597 INFO L475 AbstractCegarLoop]: Abstraction has 9266 states and 13387 transitions. [2019-09-10 08:33:18,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:33:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 13387 transitions. [2019-09-10 08:33:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:18,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:18,599 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:33:18,599 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash 476281820, now seen corresponding path program 1 times [2019-09-10 08:33:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:18,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:18,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:19,144 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:33:19,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:19,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:33:19,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:19,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:33:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:33:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:33:19,145 INFO L87 Difference]: Start difference. First operand 9266 states and 13387 transitions. Second operand 13 states. [2019-09-10 08:33:19,508 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:33:19,665 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:33:19,900 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:33:20,207 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:33:20,430 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:33:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:20,781 INFO L93 Difference]: Finished difference Result 35552 states and 51569 transitions. [2019-09-10 08:33:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:20,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:33:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:20,818 INFO L225 Difference]: With dead ends: 35552 [2019-09-10 08:33:20,818 INFO L226 Difference]: Without dead ends: 35552 [2019-09-10 08:33:20,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:33:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35552 states. [2019-09-10 08:33:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35552 to 9201. [2019-09-10 08:33:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9201 states. [2019-09-10 08:33:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9201 states to 9201 states and 13307 transitions. [2019-09-10 08:33:21,063 INFO L78 Accepts]: Start accepts. Automaton has 9201 states and 13307 transitions. Word has length 129 [2019-09-10 08:33:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:21,064 INFO L475 AbstractCegarLoop]: Abstraction has 9201 states and 13307 transitions. [2019-09-10 08:33:21,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:33:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 9201 states and 13307 transitions. [2019-09-10 08:33:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:21,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:21,065 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:33:21,065 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash 9869342, now seen corresponding path program 1 times [2019-09-10 08:33:21,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:21,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:21,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:21,624 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:33:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:21,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:33:21,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:21,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:33:21,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:33:21,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:33:21,628 INFO L87 Difference]: Start difference. First operand 9201 states and 13307 transitions. Second operand 13 states. [2019-09-10 08:33:22,234 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 08:33:22,487 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 08:33:22,744 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 08:33:23,155 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 08:33:23,472 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 08:33:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:23,828 INFO L93 Difference]: Finished difference Result 36232 states and 52571 transitions. [2019-09-10 08:33:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:23,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2019-09-10 08:33:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:23,865 INFO L225 Difference]: With dead ends: 36232 [2019-09-10 08:33:23,866 INFO L226 Difference]: Without dead ends: 36232 [2019-09-10 08:33:23,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:33:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36232 states. [2019-09-10 08:33:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36232 to 9181. [2019-09-10 08:33:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-09-10 08:33:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 13279 transitions. [2019-09-10 08:33:24,110 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 13279 transitions. Word has length 129 [2019-09-10 08:33:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:24,110 INFO L475 AbstractCegarLoop]: Abstraction has 9181 states and 13279 transitions. [2019-09-10 08:33:24,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:33:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 13279 transitions. [2019-09-10 08:33:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:24,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:24,111 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:33:24,111 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1214549341, now seen corresponding path program 1 times [2019-09-10 08:33:24,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:24,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:24,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:24,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:24,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:25,197 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:33:25,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:25,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:33:25,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:25,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:33:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:33:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:25,198 INFO L87 Difference]: Start difference. First operand 9181 states and 13279 transitions. Second operand 19 states. [2019-09-10 08:33:25,855 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:33:26,060 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:33:26,378 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 08:33:26,846 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:33:27,014 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:33:27,343 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:33:27,615 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:33:27,827 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:33:28,061 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:33:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:28,915 INFO L93 Difference]: Finished difference Result 42527 states and 61788 transitions. [2019-09-10 08:33:28,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:33:28,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2019-09-10 08:33:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:28,952 INFO L225 Difference]: With dead ends: 42527 [2019-09-10 08:33:28,952 INFO L226 Difference]: Without dead ends: 42527 [2019-09-10 08:33:28,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:33:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42527 states. [2019-09-10 08:33:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42527 to 9169. [2019-09-10 08:33:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9169 states. [2019-09-10 08:33:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9169 states to 9169 states and 13263 transitions. [2019-09-10 08:33:29,167 INFO L78 Accepts]: Start accepts. Automaton has 9169 states and 13263 transitions. Word has length 129 [2019-09-10 08:33:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:29,168 INFO L475 AbstractCegarLoop]: Abstraction has 9169 states and 13263 transitions. [2019-09-10 08:33:29,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:33:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 9169 states and 13263 transitions. [2019-09-10 08:33:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:29,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:29,169 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:33:29,169 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1604872504, now seen corresponding path program 1 times [2019-09-10 08:33:29,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:29,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:29,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:29,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:29,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:29,754 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:33:29,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:29,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:33:29,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:29,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:33:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:33:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:33:29,755 INFO L87 Difference]: Start difference. First operand 9169 states and 13263 transitions. Second operand 13 states. [2019-09-10 08:33:30,208 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 08:33:30,364 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:33:30,539 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:33:30,862 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:33:31,089 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 08:33:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:31,501 INFO L93 Difference]: Finished difference Result 36114 states and 52425 transitions. [2019-09-10 08:33:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:31,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2019-09-10 08:33:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:31,537 INFO L225 Difference]: With dead ends: 36114 [2019-09-10 08:33:31,537 INFO L226 Difference]: Without dead ends: 36114 [2019-09-10 08:33:31,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:33:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36114 states. [2019-09-10 08:33:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36114 to 9154. [2019-09-10 08:33:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-09-10 08:33:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 13243 transitions. [2019-09-10 08:33:31,839 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 13243 transitions. Word has length 130 [2019-09-10 08:33:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:31,839 INFO L475 AbstractCegarLoop]: Abstraction has 9154 states and 13243 transitions. [2019-09-10 08:33:31,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:33:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 13243 transitions. [2019-09-10 08:33:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:31,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:31,840 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:33:31,840 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1312996549, now seen corresponding path program 1 times [2019-09-10 08:33:31,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:31,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:31,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:32,733 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:33:32,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:32,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:33:32,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:32,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:33:32,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:33:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:33:32,734 INFO L87 Difference]: Start difference. First operand 9154 states and 13243 transitions. Second operand 17 states. [2019-09-10 08:33:33,501 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:33:33,657 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:33:34,009 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:33:34,188 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:33:34,371 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:33:34,539 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:33:34,913 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:33:35,090 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:33:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:36,027 INFO L93 Difference]: Finished difference Result 34955 states and 50769 transitions. [2019-09-10 08:33:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:33:36,027 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2019-09-10 08:33:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:36,059 INFO L225 Difference]: With dead ends: 34955 [2019-09-10 08:33:36,060 INFO L226 Difference]: Without dead ends: 34951 [2019-09-10 08:33:36,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:33:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34951 states. [2019-09-10 08:33:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34951 to 8824. [2019-09-10 08:33:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8824 states. [2019-09-10 08:33:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8824 states to 8824 states and 12781 transitions. [2019-09-10 08:33:36,259 INFO L78 Accepts]: Start accepts. Automaton has 8824 states and 12781 transitions. Word has length 130 [2019-09-10 08:33:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:36,260 INFO L475 AbstractCegarLoop]: Abstraction has 8824 states and 12781 transitions. [2019-09-10 08:33:36,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:33:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8824 states and 12781 transitions. [2019-09-10 08:33:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:36,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:36,261 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:33:36,261 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 842257019, now seen corresponding path program 1 times [2019-09-10 08:33:36,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:36,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:36,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:36,823 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-10 08:33:37,075 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:33:37,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:37,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:33:37,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:37,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:33:37,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:33:37,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:33:37,077 INFO L87 Difference]: Start difference. First operand 8824 states and 12781 transitions. Second operand 14 states. [2019-09-10 08:33:37,818 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:33:38,026 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:33:38,241 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:33:38,411 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:33:38,562 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:33:38,752 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:33:38,960 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:33:39,100 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 08:33:39,285 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:33:39,822 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 08:33:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:39,996 INFO L93 Difference]: Finished difference Result 52251 states and 75947 transitions. [2019-09-10 08:33:39,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:33:39,996 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-10 08:33:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:40,052 INFO L225 Difference]: With dead ends: 52251 [2019-09-10 08:33:40,052 INFO L226 Difference]: Without dead ends: 52251 [2019-09-10 08:33:40,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:33:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52251 states. [2019-09-10 08:33:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52251 to 8803. [2019-09-10 08:33:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8803 states. [2019-09-10 08:33:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8803 states to 8803 states and 12756 transitions. [2019-09-10 08:33:40,414 INFO L78 Accepts]: Start accepts. Automaton has 8803 states and 12756 transitions. Word has length 130 [2019-09-10 08:33:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:40,415 INFO L475 AbstractCegarLoop]: Abstraction has 8803 states and 12756 transitions. [2019-09-10 08:33:40,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:33:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8803 states and 12756 transitions. [2019-09-10 08:33:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:33:40,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:40,418 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:33:40,418 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash 892131988, now seen corresponding path program 1 times [2019-09-10 08:33:40,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:40,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:40,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:40,501 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:33:40,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:40,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:40,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:40,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:40,502 INFO L87 Difference]: Start difference. First operand 8803 states and 12756 transitions. Second operand 3 states. [2019-09-10 08:33:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:40,554 INFO L93 Difference]: Finished difference Result 16991 states and 24402 transitions. [2019-09-10 08:33:40,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:40,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 08:33:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:40,573 INFO L225 Difference]: With dead ends: 16991 [2019-09-10 08:33:40,574 INFO L226 Difference]: Without dead ends: 16991 [2019-09-10 08:33:40,574 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:33:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16991 states. [2019-09-10 08:33:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16991 to 16501. [2019-09-10 08:33:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16501 states. [2019-09-10 08:33:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16501 states to 16501 states and 23791 transitions. [2019-09-10 08:33:40,722 INFO L78 Accepts]: Start accepts. Automaton has 16501 states and 23791 transitions. Word has length 165 [2019-09-10 08:33:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:40,722 INFO L475 AbstractCegarLoop]: Abstraction has 16501 states and 23791 transitions. [2019-09-10 08:33:40,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16501 states and 23791 transitions. [2019-09-10 08:33:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:33:40,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:40,725 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:33:40,725 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash 113259421, now seen corresponding path program 1 times [2019-09-10 08:33:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:40,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:40,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:40,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:40,806 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:33:40,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:40,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:40,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:40,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:40,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:40,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:40,808 INFO L87 Difference]: Start difference. First operand 16501 states and 23791 transitions. Second operand 3 states. [2019-09-10 08:33:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:40,892 INFO L93 Difference]: Finished difference Result 31899 states and 45496 transitions. [2019-09-10 08:33:40,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:40,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:33:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:40,932 INFO L225 Difference]: With dead ends: 31899 [2019-09-10 08:33:40,932 INFO L226 Difference]: Without dead ends: 31899 [2019-09-10 08:33:40,933 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:33:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31899 states. [2019-09-10 08:33:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31899 to 30921. [2019-09-10 08:33:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30921 states. [2019-09-10 08:33:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30921 states to 30921 states and 44275 transitions. [2019-09-10 08:33:41,221 INFO L78 Accepts]: Start accepts. Automaton has 30921 states and 44275 transitions. Word has length 166 [2019-09-10 08:33:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:41,222 INFO L475 AbstractCegarLoop]: Abstraction has 30921 states and 44275 transitions. [2019-09-10 08:33:41,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 30921 states and 44275 transitions. [2019-09-10 08:33:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 08:33:41,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:41,224 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:33:41,224 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2110736483, now seen corresponding path program 1 times [2019-09-10 08:33:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:41,296 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:33:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:41,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:41,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:41,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:41,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:41,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:41,298 INFO L87 Difference]: Start difference. First operand 30921 states and 44275 transitions. Second operand 3 states. [2019-09-10 08:33:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:41,455 INFO L93 Difference]: Finished difference Result 59763 states and 84512 transitions. [2019-09-10 08:33:41,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:41,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 08:33:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:41,526 INFO L225 Difference]: With dead ends: 59763 [2019-09-10 08:33:41,526 INFO L226 Difference]: Without dead ends: 59763 [2019-09-10 08:33:41,526 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:33:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59763 states. [2019-09-10 08:33:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59763 to 57809. [2019-09-10 08:33:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57809 states. [2019-09-10 08:33:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57809 states to 57809 states and 82071 transitions. [2019-09-10 08:33:42,274 INFO L78 Accepts]: Start accepts. Automaton has 57809 states and 82071 transitions. Word has length 167 [2019-09-10 08:33:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:42,274 INFO L475 AbstractCegarLoop]: Abstraction has 57809 states and 82071 transitions. [2019-09-10 08:33:42,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 57809 states and 82071 transitions. [2019-09-10 08:33:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:33:42,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:42,276 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:33:42,276 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash -487620321, now seen corresponding path program 1 times [2019-09-10 08:33:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:42,358 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:33:42,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:42,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:42,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:42,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:42,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:42,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:42,359 INFO L87 Difference]: Start difference. First operand 57809 states and 82071 transitions. Second operand 3 states. [2019-09-10 08:33:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:42,500 INFO L93 Difference]: Finished difference Result 57811 states and 81584 transitions. [2019-09-10 08:33:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:42,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:33:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:42,572 INFO L225 Difference]: With dead ends: 57811 [2019-09-10 08:33:42,572 INFO L226 Difference]: Without dead ends: 57811 [2019-09-10 08:33:42,573 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:33:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57811 states. [2019-09-10 08:33:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57811 to 57809. [2019-09-10 08:33:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57809 states. [2019-09-10 08:33:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57809 states to 57809 states and 81583 transitions. [2019-09-10 08:33:43,233 INFO L78 Accepts]: Start accepts. Automaton has 57809 states and 81583 transitions. Word has length 168 [2019-09-10 08:33:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:43,233 INFO L475 AbstractCegarLoop]: Abstraction has 57809 states and 81583 transitions. [2019-09-10 08:33:43,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 57809 states and 81583 transitions. [2019-09-10 08:33:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 08:33:43,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:43,235 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:33:43,235 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1885501466, now seen corresponding path program 1 times [2019-09-10 08:33:43,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:43,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:43,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:43,312 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:33:43,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:43,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:43,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:43,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:43,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:43,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:43,314 INFO L87 Difference]: Start difference. First operand 57809 states and 81583 transitions. Second operand 3 states. [2019-09-10 08:33:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:43,494 INFO L93 Difference]: Finished difference Result 80433 states and 112727 transitions. [2019-09-10 08:33:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:43,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 08:33:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:43,580 INFO L225 Difference]: With dead ends: 80433 [2019-09-10 08:33:43,581 INFO L226 Difference]: Without dead ends: 80433 [2019-09-10 08:33:43,581 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:33:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80433 states. [2019-09-10 08:33:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80433 to 77867. [2019-09-10 08:33:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77867 states. [2019-09-10 08:33:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77867 states to 77867 states and 109521 transitions. [2019-09-10 08:33:45,624 INFO L78 Accepts]: Start accepts. Automaton has 77867 states and 109521 transitions. Word has length 169 [2019-09-10 08:33:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:45,624 INFO L475 AbstractCegarLoop]: Abstraction has 77867 states and 109521 transitions. [2019-09-10 08:33:45,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 77867 states and 109521 transitions. [2019-09-10 08:33:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:33:45,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:45,626 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:33:45,626 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1084255458, now seen corresponding path program 1 times [2019-09-10 08:33:45,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:45,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:45,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:45,745 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:33:45,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:45,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:33:45,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:45,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:33:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:33:45,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:33:45,746 INFO L87 Difference]: Start difference. First operand 77867 states and 109521 transitions. Second operand 7 states. [2019-09-10 08:33:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:46,691 INFO L93 Difference]: Finished difference Result 196273 states and 272036 transitions. [2019-09-10 08:33:46,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:33:46,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-09-10 08:33:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:46,925 INFO L225 Difference]: With dead ends: 196273 [2019-09-10 08:33:46,925 INFO L226 Difference]: Without dead ends: 196273 [2019-09-10 08:33:46,926 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:33:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196273 states. [2019-09-10 08:33:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196273 to 83771. [2019-09-10 08:33:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83771 states. [2019-09-10 08:33:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83771 states to 83771 states and 117393 transitions. [2019-09-10 08:33:50,261 INFO L78 Accepts]: Start accepts. Automaton has 83771 states and 117393 transitions. Word has length 171 [2019-09-10 08:33:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:50,262 INFO L475 AbstractCegarLoop]: Abstraction has 83771 states and 117393 transitions. [2019-09-10 08:33:50,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:33:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 83771 states and 117393 transitions. [2019-09-10 08:33:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:33:50,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:50,262 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:33:50,263 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 880887167, now seen corresponding path program 1 times [2019-09-10 08:33:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:50,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:50,388 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:33:50,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:50,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:33:50,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:50,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:33:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:33:50,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:33:50,390 INFO L87 Difference]: Start difference. First operand 83771 states and 117393 transitions. Second operand 7 states. [2019-09-10 08:33:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:51,506 INFO L93 Difference]: Finished difference Result 179217 states and 245796 transitions. [2019-09-10 08:33:51,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:33:51,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-09-10 08:33:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:51,686 INFO L225 Difference]: With dead ends: 179217 [2019-09-10 08:33:51,686 INFO L226 Difference]: Without dead ends: 179217 [2019-09-10 08:33:51,686 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:33:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179217 states. [2019-09-10 08:33:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179217 to 89675. [2019-09-10 08:33:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89675 states. [2019-09-10 08:33:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89675 states to 89675 states and 125265 transitions. [2019-09-10 08:33:53,254 INFO L78 Accepts]: Start accepts. Automaton has 89675 states and 125265 transitions. Word has length 171 [2019-09-10 08:33:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:53,254 INFO L475 AbstractCegarLoop]: Abstraction has 89675 states and 125265 transitions. [2019-09-10 08:33:53,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:33:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 89675 states and 125265 transitions. [2019-09-10 08:33:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 08:33:53,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:53,259 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:33:53,259 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1412589508, now seen corresponding path program 1 times [2019-09-10 08:33:53,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:53,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:53,360 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:33:53,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:53,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:53,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:53,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:53,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:53,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:53,362 INFO L87 Difference]: Start difference. First operand 89675 states and 125265 transitions. Second operand 3 states. [2019-09-10 08:33:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:53,639 INFO L93 Difference]: Finished difference Result 171997 states and 236610 transitions. [2019-09-10 08:33:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:53,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-10 08:33:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:53,812 INFO L225 Difference]: With dead ends: 171997 [2019-09-10 08:33:53,812 INFO L226 Difference]: Without dead ends: 171997 [2019-09-10 08:33:53,812 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:33:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171997 states. [2019-09-10 08:33:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171997 to 162811. [2019-09-10 08:33:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162811 states. [2019-09-10 08:33:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162811 states to 162811 states and 225457 transitions. [2019-09-10 08:33:57,796 INFO L78 Accepts]: Start accepts. Automaton has 162811 states and 225457 transitions. Word has length 206 [2019-09-10 08:33:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:57,796 INFO L475 AbstractCegarLoop]: Abstraction has 162811 states and 225457 transitions. [2019-09-10 08:33:57,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 162811 states and 225457 transitions. [2019-09-10 08:33:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 08:33:57,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:57,803 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:33:57,803 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:57,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:57,804 INFO L82 PathProgramCache]: Analyzing trace with hash -618244518, now seen corresponding path program 1 times [2019-09-10 08:33:57,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:57,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:57,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:57,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:57,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:57,885 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:33:57,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:57,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:57,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:57,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:57,886 INFO L87 Difference]: Start difference. First operand 162811 states and 225457 transitions. Second operand 3 states. [2019-09-10 08:33:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:58,465 INFO L93 Difference]: Finished difference Result 311053 states and 423218 transitions. [2019-09-10 08:33:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:58,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-10 08:33:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:58,844 INFO L225 Difference]: With dead ends: 311053 [2019-09-10 08:33:58,844 INFO L226 Difference]: Without dead ends: 311053 [2019-09-10 08:33:58,844 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:33:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311053 states. [2019-09-10 08:34:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311053 to 292683. [2019-09-10 08:34:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292683 states. [2019-09-10 08:34:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292683 states to 292683 states and 400913 transitions. [2019-09-10 08:34:09,221 INFO L78 Accepts]: Start accepts. Automaton has 292683 states and 400913 transitions. Word has length 207 [2019-09-10 08:34:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:09,221 INFO L475 AbstractCegarLoop]: Abstraction has 292683 states and 400913 transitions. [2019-09-10 08:34:09,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 292683 states and 400913 transitions. [2019-09-10 08:34:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:34:09,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:09,233 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:34:09,233 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1520661203, now seen corresponding path program 1 times [2019-09-10 08:34:09,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:09,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:09,700 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:34:09,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:09,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:34:09,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2019-09-10 08:34:09,705 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:34:09,778 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:34:09,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:34:09,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:34:11,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:34:11,962 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:34:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:11,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:34:11,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:11,969 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:34:11,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:11,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:34:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:12,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:34:12,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:34:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:13,228 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:34:13,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:34:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:13,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:31,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:34:32,686 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:34:32,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:34:32,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:34:32,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:34:32,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:34:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:34:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:34:32,693 INFO L87 Difference]: Start difference. First operand 292683 states and 400913 transitions. Second operand 20 states. [2019-09-10 08:34:35,193 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 08:34:40,376 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 08:34:42,585 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 08:34:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:47,135 INFO L93 Difference]: Finished difference Result 1620349 states and 2194757 transitions. [2019-09-10 08:34:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:34:47,136 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 208 [2019-09-10 08:34:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:01,384 INFO L225 Difference]: With dead ends: 1620349 [2019-09-10 08:35:01,385 INFO L226 Difference]: Without dead ends: 1620349 [2019-09-10 08:35:01,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 342 SyntacticMatches, 61 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=1173, Invalid=2987, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:35:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620349 states. [2019-09-10 08:35:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620349 to 686935. [2019-09-10 08:35:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686935 states. [2019-09-10 08:35:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686935 states to 686935 states and 938650 transitions. [2019-09-10 08:35:26,224 INFO L78 Accepts]: Start accepts. Automaton has 686935 states and 938650 transitions. Word has length 208 [2019-09-10 08:35:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:26,224 INFO L475 AbstractCegarLoop]: Abstraction has 686935 states and 938650 transitions. [2019-09-10 08:35:26,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:35:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 686935 states and 938650 transitions. [2019-09-10 08:35:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 08:35:26,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:26,257 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, 1] [2019-09-10 08:35:26,257 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -609145036, now seen corresponding path program 1 times [2019-09-10 08:35:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:26,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:26,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:26,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:26,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:35:26,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2019-09-10 08:35:26,748 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], [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], [674], [679], [772], [773], [777], [778], [779] [2019-09-10 08:35:26,758 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:35:26,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:35:26,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:35:28,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:35:28,160 INFO L272 AbstractInterpreter]: Visited 188 different actions 1786 times. Merged at 71 different actions 1362 times. Widened at 33 different actions 270 times. Performed 6473 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6473 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 233 fixpoints after 35 different actions. Largest state had 206 variables. [2019-09-10 08:35:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:28,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:35:28,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:28,161 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:35:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:28,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:35:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:35,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:35:35,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:35:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:36,126 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:35:36,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:35:36,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:36,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:36,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:36,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:38,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:38,982 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:35:38,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:35:38,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2019-09-10 08:35:38,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:35:38,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:35:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:35:38,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:35:38,990 INFO L87 Difference]: Start difference. First operand 686935 states and 938650 transitions. Second operand 23 states. [2019-09-10 08:35:39,143 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:35:41,187 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 08:35:41,696 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:35:42,171 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:35:42,752 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:35:42,948 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:35:43,090 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:35:43,270 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:35:43,959 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:35:44,128 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:35:44,543 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:35:44,681 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:35:44,877 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:35:45,041 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:35:45,223 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:35:45,551 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:35:45,873 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:35:46,851 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:35:47,045 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:35:47,213 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:35:47,366 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:35:47,538 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:35:48,058 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:35:48,392 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:35:48,578 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:35:48,830 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:35:49,077 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:35:49,301 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:35:49,789 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:35:49,983 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:35:50,220 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:35:50,396 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:35:50,559 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:35:50,778 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:35:50,984 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:35:51,223 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:35:51,397 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:35:51,549 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:35:51,750 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:35:52,075 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:35:52,518 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:35:52,704 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:35:52,903 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:35:53,154 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:35:53,442 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:35:53,611 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:35:54,246 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:35:54,481 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:35:54,668 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:35:54,929 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:35:55,110 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:35:55,282 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:35:55,488 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:35:55,723 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:35:55,899 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:35:56,330 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:35:56,521 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:35:57,161 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:35:57,404 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:35:57,606 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:35:58,105 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:35:58,291 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:35:58,486 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:35:58,700 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:35:58,891 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:35:59,446 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:36:00,252 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:36:00,453 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:36:00,641 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:36:00,844 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:36:01,051 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:01,223 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:36:01,490 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:36:01,721 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:36:01,921 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:02,138 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:36:02,435 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:02,599 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:36:03,032 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:03,593 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:36:03,799 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:04,016 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:36:04,216 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:36:04,424 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:36:04,678 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:36:04,852 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:36:05,020 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:36:05,233 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:36:05,402 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:36:05,637 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:36:05,873 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:36:06,076 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:36:06,287 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:36:06,570 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:36:06,837 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:07,159 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:36:07,466 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:36:07,731 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:36:07,951 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:36:08,171 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:08,352 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:08,523 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:36:08,730 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:36:08,897 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:09,087 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:36:09,320 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:36:09,514 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:36:10,195 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:36:10,355 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:36:10,629 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:10,818 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:10,999 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:36:11,239 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:36:11,441 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:36:11,658 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:36:11,874 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:12,047 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:12,254 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:36:12,442 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:36:12,657 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:36:12,835 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:36:12,992 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:36:13,181 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:13,379 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:36:13,548 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:13,725 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:36:14,007 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:36:14,280 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:36:14,532 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:36:14,758 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:14,971 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:15,177 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:15,408 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:36:15,603 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:36:15,809 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:36:16,005 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:36:16,259 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:36:16,486 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:16,646 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:36:16,930 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:36:17,228 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:17,401 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:36:17,741 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:36:17,910 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:36:18,414 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:36:18,586 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:18,772 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:36:18,934 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:36:19,102 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:36:19,728 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:19,951 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:36:20,123 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:36:20,291 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:36:20,511 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:20,745 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:36:20,972 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:36:21,184 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:36:21,422 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:36:21,623 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:36:21,818 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:36:21,979 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:36:22,225 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:22,458 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:36:22,657 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:36:22,912 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:23,120 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:36:23,356 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:36:23,586 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:36:23,821 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:36:24,094 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:36:24,307 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:24,547 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:24,716 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:24,880 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:25,080 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:25,255 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:25,445 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:25,603 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:36:25,854 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:36:26,092 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:36:26,284 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:26,445 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:26,765 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:27,125 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:36:27,287 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:27,474 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:36:27,687 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:36:28,510 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:36:28,713 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:36:28,927 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:29,158 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:29,362 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:36:29,576 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:36:29,831 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:36:30,062 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:36:30,232 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:36:30,442 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:36:30,642 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:36:30,885 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:31,075 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:36:31,298 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:36:31,570 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:36:31,784 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:36:32,027 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:36:32,288 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:36:32,527 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:32,890 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:33,223 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:33,449 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:33,643 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:36:33,852 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:36:34,041 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:36:34,207 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:34,395 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:36:34,623 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:36:34,791 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:36:35,357 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:36:35,567 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:36:35,746 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:36:35,997 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:36,182 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:36,402 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:36:36,637 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:36:36,880 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:36:37,116 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:37,366 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:37,542 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:36:37,753 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:36:38,001 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:36:38,241 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:36:38,984 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:39,162 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:36:39,494 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:36:39,666 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:36:40,112 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:36:40,629 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:36:40,808 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:36:41,003 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:36:41,246 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:36:41,555 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:36:41,731 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:36:42,455 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:36:42,640 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:49,992 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:36:50,213 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:36:50,475 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:36:50,662 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:36:51,283 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:51,528 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 08:36:51,750 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:36:52,034 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:36:52,276 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:36:52,652 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:36:52,909 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:36:53,124 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:36:53,331 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:36:53,570 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:36:53,803 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:36:54,334 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:36:54,530 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:36:54,832 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:36:55,014 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:36:55,301 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:36:55,492 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:36:55,711 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:36:55,940 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:36:56,156 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:36:56,387 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:36:56,615 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:36:56,818 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:36:57,042 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:36:57,256 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:36:57,510 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:36:57,745 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:36:58,108 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:36:58,604 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:36:58,937 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:36:59,144 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:36:59,417 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:36:59,768 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:37:00,133 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:37:00,357 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:37:00,561 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 08:37:00,758 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:37:00,970 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:37:01,183 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:37:01,417 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:37:01,616 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:37:01,822 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:02,014 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:37:04,606 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:37:05,623 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:37:05,829 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:37:06,099 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:37:06,298 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:37:06,549 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:37:06,798 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:37:06,972 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:37:07,179 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:37:07,348 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:37:07,814 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:37:08,030 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:37:08,236 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:37:08,445 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:08,688 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:08,938 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:37:09,197 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:37:09,466 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:37:09,994 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:37:10,265 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 08:37:10,454 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:37:10,628 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:37:10,854 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:11,171 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:37:12,789 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:37:12,998 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:37:13,191 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:37:13,595 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:37:13,800 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:37:14,058 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:14,291 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:37:14,511 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:37:14,776 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:37:15,001 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:15,258 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:37:15,486 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:37:15,665 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:37:15,942 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:37:16,138 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:16,364 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:37:16,598 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:37:16,830 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:17,020 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:37:17,243 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:37:17,447 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 08:37:17,664 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:37:17,853 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:37:18,052 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 08:37:18,236 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:37:18,598 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:37:18,828 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:37:19,040 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:37:19,274 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:37:20,104 WARN L188 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:37:20,312 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:37:20,501 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 08:37:20,820 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:37:21,120 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:37:21,359 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:21,565 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:21,788 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:37:22,035 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:37:22,279 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:37:22,509 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:22,704 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:22,935 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:37:23,177 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:37:23,443 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 08:37:23,691 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:37:23,929 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:37:24,118 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:37:24,308 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:37:24,500 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:37:24,698 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:37:24,914 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:37:25,104 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:37:25,287 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:37:25,473 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:37:25,920 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:37:26,108 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:37:26,319 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:37:26,503 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:37:26,752 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:37:27,677 WARN L188 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:37:27,905 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:37:28,139 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:37:28,356 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:28,607 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:37:28,836 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:29,167 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:37:29,363 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:37:30,277 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:37:30,475 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:37:30,776 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:37:31,011 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:37:33,081 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:33,389 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:35,124 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:37:35,333 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:37:35,556 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:35,780 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:37:36,213 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:36,433 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:36,611 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:37:36,872 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:37:37,786 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:37:37,988 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:37:38,207 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:37:38,423 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:38,675 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:37:39,028 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:39,214 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:37:39,458 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:37:39,708 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:37:39,980 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:40,233 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:37:40,592 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:37:41,858 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:37:42,078 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:37:42,328 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:37:42,569 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:37:42,779 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:37:43,048 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 08:37:43,821 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:37:43,990 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:37:44,193 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:37:44,378 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:37:44,578 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:37:44,804 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:37:44,999 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:37:45,229 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:37:45,465 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:37:45,659 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:37:45,886 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:37:46,272 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:46,536 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:37:46,828 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:37:47,001 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:37:47,178 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:37:47,463 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:37:47,647 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:37:47,859 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:37:48,073 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:49,422 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:37:49,701 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:49,913 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:37:50,097 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:37:50,286 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:37:50,593 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:37:51,007 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:37:51,194 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:37:51,399 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:37:51,729 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:37:52,166 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:37:52,365 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:37:52,578 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:37:52,835 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:37:53,061 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:37:53,297 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:37:53,557 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:37:53,833 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:37:54,040 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:37:54,245 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:37:54,448 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:37:54,743 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:37:54,984 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:37:55,225 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:37:55,490 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:37:57,049 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:37:57,330 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:37:57,677 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-10 08:37:57,866 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:37:58,312 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:37:58,633 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:37:58,822 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:37:59,031 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:37:59,251 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:37:59,867 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:38:00,059 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:38:00,319 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:38:00,655 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-10 08:38:00,956 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:38:01,220 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:38:01,451 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:38:01,696 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:38:02,041 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-09-10 08:38:02,298 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:38:02,692 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 08:38:04,277 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:38:04,615 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66