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.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:00:59,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:00:59,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:00:59,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:00:59,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:00:59,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:00:59,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:00:59,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:00:59,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:00:59,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:00:59,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:00:59,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:00:59,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:00:59,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:00:59,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:00:59,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:00:59,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:00:59,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:00:59,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:00:59,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:00:59,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:00:59,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:00:59,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:00:59,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:00:59,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:00:59,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:00:59,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:00:59,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:00:59,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:00:59,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:00:59,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:00:59,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:00:59,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:00:59,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:00:59,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:00:59,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:00:59,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:00:59,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:00:59,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:00:59,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:00:59,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:00:59,225 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:00:59,253 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:00:59,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:00:59,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:00:59,254 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:00:59,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:00:59,255 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:00:59,255 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:00:59,255 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:00:59,256 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:00:59,256 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:00:59,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:00:59,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:00:59,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:00:59,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:00:59,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:00:59,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:00:59,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:00:59,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:00:59,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:00:59,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:00:59,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:00:59,260 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:00:59,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:00:59,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:00:59,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:00:59,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:00:59,261 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:00:59,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:00:59,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:00:59,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:00:59,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:00:59,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:00:59,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:00:59,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:00:59,334 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:00:59,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 08:00:59,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7fc0302/3e886396795d4a3f9e1faf36b22c2a00/FLAG8b42d6ab4 [2019-09-10 08:01:00,028 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:01:00,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 08:01:00,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7fc0302/3e886396795d4a3f9e1faf36b22c2a00/FLAG8b42d6ab4 [2019-09-10 08:01:00,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7fc0302/3e886396795d4a3f9e1faf36b22c2a00 [2019-09-10 08:01:00,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:01:00,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:01:00,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:01:00,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:01:00,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:01:00,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:01:00" (1/1) ... [2019-09-10 08:01:00,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5c22f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:00, skipping insertion in model container [2019-09-10 08:01:00,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:01:00" (1/1) ... [2019-09-10 08:01:00,307 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:01:00,391 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:01:00,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:01:00,974 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:01:01,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:01:01,153 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:01:01,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01 WrapperNode [2019-09-10 08:01:01,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:01:01,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:01:01,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:01:01,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:01:01,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (1/1) ... [2019-09-10 08:01:01,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:01:01,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:01:01,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:01:01,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:01:01,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (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:01:01,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:01:01,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:01:01,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:01:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:01:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:01:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:01:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:01:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:01:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:01:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:01:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:01:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:01:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:01:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:01:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:01:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:01:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:01:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:01:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:01:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:01:02,957 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:01:02,957 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:01:02,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:01:02 BoogieIcfgContainer [2019-09-10 08:01:02,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:01:02,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:01:02,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:01:02,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:01:02,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:01:00" (1/3) ... [2019-09-10 08:01:02,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53521b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:01:02, skipping insertion in model container [2019-09-10 08:01:02,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:01:01" (2/3) ... [2019-09-10 08:01:02,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53521b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:01:02, skipping insertion in model container [2019-09-10 08:01:02,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:01:02" (3/3) ... [2019-09-10 08:01:02,968 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 08:01:02,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:01:02,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:01:03,005 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:01:03,033 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:01:03,033 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:01:03,034 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:01:03,034 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:01:03,034 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:01:03,034 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:01:03,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:01:03,034 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:01:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-09-10 08:01:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:01:03,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:03,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:03,085 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 727976503, now seen corresponding path program 1 times [2019-09-10 08:01:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:03,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:03,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:03,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:01:03,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:03,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:01:03,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:01:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:01:03,615 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 4 states. [2019-09-10 08:01:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:03,763 INFO L93 Difference]: Finished difference Result 342 states and 556 transitions. [2019-09-10 08:01:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:03,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 08:01:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:03,782 INFO L225 Difference]: With dead ends: 342 [2019-09-10 08:01:03,782 INFO L226 Difference]: Without dead ends: 332 [2019-09-10 08:01:03,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-10 08:01:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-10 08:01:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-10 08:01:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-09-10 08:01:03,860 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 131 [2019-09-10 08:01:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:03,861 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-09-10 08:01:03,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:01:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-09-10 08:01:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:01:03,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:03,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:03,867 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash -956343336, now seen corresponding path program 1 times [2019-09-10 08:01:03,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:03,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:03,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:04,130 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:01:04,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:04,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:04,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:04,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:04,133 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2019-09-10 08:01:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:04,201 INFO L93 Difference]: Finished difference Result 529 states and 816 transitions. [2019-09-10 08:01:04,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:04,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:01:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:04,206 INFO L225 Difference]: With dead ends: 529 [2019-09-10 08:01:04,206 INFO L226 Difference]: Without dead ends: 529 [2019-09-10 08:01:04,207 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:01:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-10 08:01:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 527. [2019-09-10 08:01:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-10 08:01:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 815 transitions. [2019-09-10 08:01:04,245 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 815 transitions. Word has length 161 [2019-09-10 08:01:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:04,245 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 815 transitions. [2019-09-10 08:01:04,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 815 transitions. [2019-09-10 08:01:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:01:04,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:04,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:04,251 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:04,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash 179469100, now seen corresponding path program 1 times [2019-09-10 08:01:04,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:04,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:04,385 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:01:04,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:04,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:04,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:04,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:04,387 INFO L87 Difference]: Start difference. First operand 527 states and 815 transitions. Second operand 3 states. [2019-09-10 08:01:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:04,463 INFO L93 Difference]: Finished difference Result 879 states and 1366 transitions. [2019-09-10 08:01:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:04,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 08:01:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:04,471 INFO L225 Difference]: With dead ends: 879 [2019-09-10 08:01:04,471 INFO L226 Difference]: Without dead ends: 879 [2019-09-10 08:01:04,472 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:01:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-10 08:01:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2019-09-10 08:01:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-09-10 08:01:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1365 transitions. [2019-09-10 08:01:04,518 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1365 transitions. Word has length 164 [2019-09-10 08:01:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:04,519 INFO L475 AbstractCegarLoop]: Abstraction has 877 states and 1365 transitions. [2019-09-10 08:01:04,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1365 transitions. [2019-09-10 08:01:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 08:01:04,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:04,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:04,526 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1011258605, now seen corresponding path program 1 times [2019-09-10 08:01:04,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:04,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:04,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:04,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:04,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:04,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:04,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:04,680 INFO L87 Difference]: Start difference. First operand 877 states and 1365 transitions. Second operand 3 states. [2019-09-10 08:01:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:04,743 INFO L93 Difference]: Finished difference Result 1495 states and 2326 transitions. [2019-09-10 08:01:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:04,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 08:01:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:04,757 INFO L225 Difference]: With dead ends: 1495 [2019-09-10 08:01:04,757 INFO L226 Difference]: Without dead ends: 1495 [2019-09-10 08:01:04,758 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:01:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-09-10 08:01:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2019-09-10 08:01:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-09-10 08:01:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2325 transitions. [2019-09-10 08:01:04,801 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2325 transitions. Word has length 167 [2019-09-10 08:01:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:04,802 INFO L475 AbstractCegarLoop]: Abstraction has 1493 states and 2325 transitions. [2019-09-10 08:01:04,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2325 transitions. [2019-09-10 08:01:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:01:04,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:04,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:04,809 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash 654878474, now seen corresponding path program 1 times [2019-09-10 08:01:04,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:04,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:04,939 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:01:04,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:04,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:04,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:04,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:04,941 INFO L87 Difference]: Start difference. First operand 1493 states and 2325 transitions. Second operand 3 states. [2019-09-10 08:01:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,006 INFO L93 Difference]: Finished difference Result 2555 states and 3958 transitions. [2019-09-10 08:01:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:05,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 08:01:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,022 INFO L225 Difference]: With dead ends: 2555 [2019-09-10 08:01:05,022 INFO L226 Difference]: Without dead ends: 2555 [2019-09-10 08:01:05,023 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:01:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-09-10 08:01:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2553. [2019-09-10 08:01:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-09-10 08:01:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3957 transitions. [2019-09-10 08:01:05,093 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3957 transitions. Word has length 170 [2019-09-10 08:01:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,093 INFO L475 AbstractCegarLoop]: Abstraction has 2553 states and 3957 transitions. [2019-09-10 08:01:05,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3957 transitions. [2019-09-10 08:01:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:01:05,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:05,104 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2027212929, now seen corresponding path program 1 times [2019-09-10 08:01:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:05,271 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:01:05,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:05,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:05,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:05,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:05,275 INFO L87 Difference]: Start difference. First operand 2553 states and 3957 transitions. Second operand 3 states. [2019-09-10 08:01:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,350 INFO L93 Difference]: Finished difference Result 4327 states and 6638 transitions. [2019-09-10 08:01:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:05,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:01:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,376 INFO L225 Difference]: With dead ends: 4327 [2019-09-10 08:01:05,377 INFO L226 Difference]: Without dead ends: 4327 [2019-09-10 08:01:05,377 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:01:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2019-09-10 08:01:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 4325. [2019-09-10 08:01:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-09-10 08:01:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 6637 transitions. [2019-09-10 08:01:05,542 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 6637 transitions. Word has length 173 [2019-09-10 08:01:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,543 INFO L475 AbstractCegarLoop]: Abstraction has 4325 states and 6637 transitions. [2019-09-10 08:01:05,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 6637 transitions. [2019-09-10 08:01:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:05,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:05,565 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1452477050, now seen corresponding path program 1 times [2019-09-10 08:01:05,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:05,714 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:01:05,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:05,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:05,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:05,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:05,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:05,717 INFO L87 Difference]: Start difference. First operand 4325 states and 6637 transitions. Second operand 3 states. [2019-09-10 08:01:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:06,343 INFO L93 Difference]: Finished difference Result 8558 states and 13082 transitions. [2019-09-10 08:01:06,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:06,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:06,391 INFO L225 Difference]: With dead ends: 8558 [2019-09-10 08:01:06,392 INFO L226 Difference]: Without dead ends: 8558 [2019-09-10 08:01:06,392 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:01:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2019-09-10 08:01:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8556. [2019-09-10 08:01:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8556 states. [2019-09-10 08:01:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8556 states to 8556 states and 13081 transitions. [2019-09-10 08:01:06,593 INFO L78 Accepts]: Start accepts. Automaton has 8556 states and 13081 transitions. Word has length 176 [2019-09-10 08:01:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:06,593 INFO L475 AbstractCegarLoop]: Abstraction has 8556 states and 13081 transitions. [2019-09-10 08:01:06,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8556 states and 13081 transitions. [2019-09-10 08:01:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:06,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:06,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:06,614 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1141259162, now seen corresponding path program 1 times [2019-09-10 08:01:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:06,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:06,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:06,741 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:01:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:06,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:06,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:06,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:06,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:06,743 INFO L87 Difference]: Start difference. First operand 8556 states and 13081 transitions. Second operand 3 states. [2019-09-10 08:01:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:07,235 INFO L93 Difference]: Finished difference Result 16941 states and 25773 transitions. [2019-09-10 08:01:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:07,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:07,296 INFO L225 Difference]: With dead ends: 16941 [2019-09-10 08:01:07,296 INFO L226 Difference]: Without dead ends: 16941 [2019-09-10 08:01:07,297 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:01:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16941 states. [2019-09-10 08:01:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16941 to 16939. [2019-09-10 08:01:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16939 states. [2019-09-10 08:01:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16939 states to 16939 states and 25772 transitions. [2019-09-10 08:01:07,646 INFO L78 Accepts]: Start accepts. Automaton has 16939 states and 25772 transitions. Word has length 176 [2019-09-10 08:01:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:07,647 INFO L475 AbstractCegarLoop]: Abstraction has 16939 states and 25772 transitions. [2019-09-10 08:01:07,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16939 states and 25772 transitions. [2019-09-10 08:01:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:07,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:07,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:07,688 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash -62348085, now seen corresponding path program 1 times [2019-09-10 08:01:07,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:07,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:07,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:07,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:07,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:07,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:07,960 INFO L87 Difference]: Start difference. First operand 16939 states and 25772 transitions. Second operand 3 states. [2019-09-10 08:01:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:08,470 INFO L93 Difference]: Finished difference Result 33507 states and 50635 transitions. [2019-09-10 08:01:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:08,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:08,538 INFO L225 Difference]: With dead ends: 33507 [2019-09-10 08:01:08,539 INFO L226 Difference]: Without dead ends: 33507 [2019-09-10 08:01:08,540 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:01:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-09-10 08:01:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 33505. [2019-09-10 08:01:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33505 states. [2019-09-10 08:01:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33505 states to 33505 states and 50634 transitions. [2019-09-10 08:01:09,279 INFO L78 Accepts]: Start accepts. Automaton has 33505 states and 50634 transitions. Word has length 176 [2019-09-10 08:01:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:09,280 INFO L475 AbstractCegarLoop]: Abstraction has 33505 states and 50634 transitions. [2019-09-10 08:01:09,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 33505 states and 50634 transitions. [2019-09-10 08:01:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:09,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:09,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:09,384 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash 574213830, now seen corresponding path program 1 times [2019-09-10 08:01:09,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:09,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:09,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:09,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:09,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:09,560 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:01:09,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:09,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:09,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:09,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:09,562 INFO L87 Difference]: Start difference. First operand 33505 states and 50634 transitions. Second operand 3 states. [2019-09-10 08:01:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:10,864 INFO L93 Difference]: Finished difference Result 66555 states and 100007 transitions. [2019-09-10 08:01:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:10,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:11,002 INFO L225 Difference]: With dead ends: 66555 [2019-09-10 08:01:11,002 INFO L226 Difference]: Without dead ends: 66555 [2019-09-10 08:01:11,002 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:01:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66555 states. [2019-09-10 08:01:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66555 to 66553. [2019-09-10 08:01:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66553 states. [2019-09-10 08:01:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66553 states to 66553 states and 100006 transitions. [2019-09-10 08:01:12,120 INFO L78 Accepts]: Start accepts. Automaton has 66553 states and 100006 transitions. Word has length 176 [2019-09-10 08:01:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:12,121 INFO L475 AbstractCegarLoop]: Abstraction has 66553 states and 100006 transitions. [2019-09-10 08:01:12,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 66553 states and 100006 transitions. [2019-09-10 08:01:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:12,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:12,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:12,207 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash 446128523, now seen corresponding path program 1 times [2019-09-10 08:01:12,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:12,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:12,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:12,352 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:01:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:12,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:12,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:12,354 INFO L87 Difference]: Start difference. First operand 66553 states and 100006 transitions. Second operand 3 states. [2019-09-10 08:01:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:14,159 INFO L93 Difference]: Finished difference Result 132083 states and 197167 transitions. [2019-09-10 08:01:14,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:14,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:14,331 INFO L225 Difference]: With dead ends: 132083 [2019-09-10 08:01:14,331 INFO L226 Difference]: Without dead ends: 132083 [2019-09-10 08:01:14,332 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:01:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132083 states. [2019-09-10 08:01:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132083 to 132081. [2019-09-10 08:01:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132081 states. [2019-09-10 08:01:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132081 states to 132081 states and 197166 transitions. [2019-09-10 08:01:17,776 INFO L78 Accepts]: Start accepts. Automaton has 132081 states and 197166 transitions. Word has length 176 [2019-09-10 08:01:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:17,777 INFO L475 AbstractCegarLoop]: Abstraction has 132081 states and 197166 transitions. [2019-09-10 08:01:17,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 132081 states and 197166 transitions. [2019-09-10 08:01:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:17,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:17,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:17,929 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash -325735130, now seen corresponding path program 1 times [2019-09-10 08:01:17,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:17,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:17,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:17,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:18,070 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:01:18,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:18,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:18,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:18,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:18,072 INFO L87 Difference]: Start difference. First operand 132081 states and 197166 transitions. Second operand 5 states. [2019-09-10 08:01:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:18,570 INFO L93 Difference]: Finished difference Result 66469 states and 99012 transitions. [2019-09-10 08:01:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:18,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 08:01:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:18,648 INFO L225 Difference]: With dead ends: 66469 [2019-09-10 08:01:18,648 INFO L226 Difference]: Without dead ends: 66469 [2019-09-10 08:01:18,649 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:01:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66469 states. [2019-09-10 08:01:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66469 to 66469. [2019-09-10 08:01:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66469 states. [2019-09-10 08:01:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66469 states to 66469 states and 99012 transitions. [2019-09-10 08:01:19,846 INFO L78 Accepts]: Start accepts. Automaton has 66469 states and 99012 transitions. Word has length 176 [2019-09-10 08:01:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:19,846 INFO L475 AbstractCegarLoop]: Abstraction has 66469 states and 99012 transitions. [2019-09-10 08:01:19,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 66469 states and 99012 transitions. [2019-09-10 08:01:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:19,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:19,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:19,906 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash 861197675, now seen corresponding path program 1 times [2019-09-10 08:01:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:19,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:19,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:20,048 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:01:20,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:20,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:01:20,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:20,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:01:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:01:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:01:20,050 INFO L87 Difference]: Start difference. First operand 66469 states and 99012 transitions. Second operand 5 states. [2019-09-10 08:01:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:20,442 INFO L93 Difference]: Finished difference Result 33505 states and 49780 transitions. [2019-09-10 08:01:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:01:20,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 08:01:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:20,480 INFO L225 Difference]: With dead ends: 33505 [2019-09-10 08:01:20,481 INFO L226 Difference]: Without dead ends: 33505 [2019-09-10 08:01:20,481 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:01:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33505 states. [2019-09-10 08:01:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33505 to 33505. [2019-09-10 08:01:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33505 states. [2019-09-10 08:01:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33505 states to 33505 states and 49780 transitions. [2019-09-10 08:01:22,219 INFO L78 Accepts]: Start accepts. Automaton has 33505 states and 49780 transitions. Word has length 176 [2019-09-10 08:01:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:22,220 INFO L475 AbstractCegarLoop]: Abstraction has 33505 states and 49780 transitions. [2019-09-10 08:01:22,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:01:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 33505 states and 49780 transitions. [2019-09-10 08:01:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:22,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:22,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:22,254 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:22,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1046466736, now seen corresponding path program 1 times [2019-09-10 08:01:22,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:22,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:22,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:22,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:22,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:22,370 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:01:22,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:22,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:22,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:22,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:22,373 INFO L87 Difference]: Start difference. First operand 33505 states and 49780 transitions. Second operand 3 states. [2019-09-10 08:01:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:22,451 INFO L93 Difference]: Finished difference Result 21907 states and 32261 transitions. [2019-09-10 08:01:22,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:22,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:22,479 INFO L225 Difference]: With dead ends: 21907 [2019-09-10 08:01:22,479 INFO L226 Difference]: Without dead ends: 21907 [2019-09-10 08:01:22,480 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:01:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21907 states. [2019-09-10 08:01:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21907 to 21905. [2019-09-10 08:01:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21905 states. [2019-09-10 08:01:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21905 states to 21905 states and 32260 transitions. [2019-09-10 08:01:22,712 INFO L78 Accepts]: Start accepts. Automaton has 21905 states and 32260 transitions. Word has length 176 [2019-09-10 08:01:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:22,712 INFO L475 AbstractCegarLoop]: Abstraction has 21905 states and 32260 transitions. [2019-09-10 08:01:22,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21905 states and 32260 transitions. [2019-09-10 08:01:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:22,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:22,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:22,726 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2102840920, now seen corresponding path program 1 times [2019-09-10 08:01:22,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:22,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:22,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:22,843 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:01:22,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:22,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:22,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:22,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:22,845 INFO L87 Difference]: Start difference. First operand 21905 states and 32260 transitions. Second operand 3 states. [2019-09-10 08:01:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:22,904 INFO L93 Difference]: Finished difference Result 11507 states and 16805 transitions. [2019-09-10 08:01:22,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:22,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:01:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:22,919 INFO L225 Difference]: With dead ends: 11507 [2019-09-10 08:01:22,919 INFO L226 Difference]: Without dead ends: 11507 [2019-09-10 08:01:22,921 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:01:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2019-09-10 08:01:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 11505. [2019-09-10 08:01:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11505 states. [2019-09-10 08:01:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11505 states to 11505 states and 16804 transitions. [2019-09-10 08:01:23,079 INFO L78 Accepts]: Start accepts. Automaton has 11505 states and 16804 transitions. Word has length 176 [2019-09-10 08:01:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:23,080 INFO L475 AbstractCegarLoop]: Abstraction has 11505 states and 16804 transitions. [2019-09-10 08:01:23,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 11505 states and 16804 transitions. [2019-09-10 08:01:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:01:23,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:23,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:23,090 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1417214282, now seen corresponding path program 1 times [2019-09-10 08:01:23,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:23,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:23,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:23,305 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:01:23,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:23,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:23,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:23,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:23,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:23,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:23,309 INFO L87 Difference]: Start difference. First operand 11505 states and 16804 transitions. Second operand 7 states. [2019-09-10 08:01:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:24,235 INFO L93 Difference]: Finished difference Result 81103 states and 116259 transitions. [2019-09-10 08:01:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:01:24,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2019-09-10 08:01:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:24,335 INFO L225 Difference]: With dead ends: 81103 [2019-09-10 08:01:24,335 INFO L226 Difference]: Without dead ends: 81103 [2019-09-10 08:01:24,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81103 states. [2019-09-10 08:01:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81103 to 33153. [2019-09-10 08:01:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33153 states. [2019-09-10 08:01:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33153 states to 33153 states and 47724 transitions. [2019-09-10 08:01:25,066 INFO L78 Accepts]: Start accepts. Automaton has 33153 states and 47724 transitions. Word has length 176 [2019-09-10 08:01:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:25,067 INFO L475 AbstractCegarLoop]: Abstraction has 33153 states and 47724 transitions. [2019-09-10 08:01:25,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33153 states and 47724 transitions. [2019-09-10 08:01:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:01:25,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:25,088 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:25,089 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1798072305, now seen corresponding path program 1 times [2019-09-10 08:01:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:25,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:25,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:25,207 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:01:25,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:25,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:25,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:25,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:25,209 INFO L87 Difference]: Start difference. First operand 33153 states and 47724 transitions. Second operand 3 states. [2019-09-10 08:01:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:25,291 INFO L93 Difference]: Finished difference Result 16943 states and 24209 transitions. [2019-09-10 08:01:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:25,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:01:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:25,317 INFO L225 Difference]: With dead ends: 16943 [2019-09-10 08:01:25,317 INFO L226 Difference]: Without dead ends: 16943 [2019-09-10 08:01:25,317 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:01:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16943 states. [2019-09-10 08:01:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16943 to 16941. [2019-09-10 08:01:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16941 states. [2019-09-10 08:01:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16941 states to 16941 states and 24208 transitions. [2019-09-10 08:01:25,576 INFO L78 Accepts]: Start accepts. Automaton has 16941 states and 24208 transitions. Word has length 180 [2019-09-10 08:01:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:25,577 INFO L475 AbstractCegarLoop]: Abstraction has 16941 states and 24208 transitions. [2019-09-10 08:01:25,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16941 states and 24208 transitions. [2019-09-10 08:01:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:01:25,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:25,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:25,592 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1122250367, now seen corresponding path program 1 times [2019-09-10 08:01:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:25,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:25,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:26,043 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:01:26,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:26,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:26,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:26,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:26,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:26,045 INFO L87 Difference]: Start difference. First operand 16941 states and 24208 transitions. Second operand 7 states. [2019-09-10 08:01:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:26,626 INFO L93 Difference]: Finished difference Result 46111 states and 65277 transitions. [2019-09-10 08:01:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:26,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 08:01:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:26,667 INFO L225 Difference]: With dead ends: 46111 [2019-09-10 08:01:26,667 INFO L226 Difference]: Without dead ends: 46111 [2019-09-10 08:01:26,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46111 states. [2019-09-10 08:01:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46111 to 27117. [2019-09-10 08:01:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27117 states. [2019-09-10 08:01:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27117 states to 27117 states and 38432 transitions. [2019-09-10 08:01:27,054 INFO L78 Accepts]: Start accepts. Automaton has 27117 states and 38432 transitions. Word has length 180 [2019-09-10 08:01:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:27,054 INFO L475 AbstractCegarLoop]: Abstraction has 27117 states and 38432 transitions. [2019-09-10 08:01:27,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 27117 states and 38432 transitions. [2019-09-10 08:01:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:01:27,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:27,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:27,072 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 253022843, now seen corresponding path program 1 times [2019-09-10 08:01:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:27,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:27,262 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:01:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:27,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:27,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:27,264 INFO L87 Difference]: Start difference. First operand 27117 states and 38432 transitions. Second operand 7 states. [2019-09-10 08:01:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:27,832 INFO L93 Difference]: Finished difference Result 56287 states and 79517 transitions. [2019-09-10 08:01:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:27,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 08:01:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:27,893 INFO L225 Difference]: With dead ends: 56287 [2019-09-10 08:01:27,893 INFO L226 Difference]: Without dead ends: 56287 [2019-09-10 08:01:27,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56287 states. [2019-09-10 08:01:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56287 to 41173. [2019-09-10 08:01:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41173 states. [2019-09-10 08:01:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41173 states to 41173 states and 58024 transitions. [2019-09-10 08:01:28,618 INFO L78 Accepts]: Start accepts. Automaton has 41173 states and 58024 transitions. Word has length 180 [2019-09-10 08:01:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:28,618 INFO L475 AbstractCegarLoop]: Abstraction has 41173 states and 58024 transitions. [2019-09-10 08:01:28,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 41173 states and 58024 transitions. [2019-09-10 08:01:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:01:28,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:28,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:28,645 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash -440755211, now seen corresponding path program 1 times [2019-09-10 08:01:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:28,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:28,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:28,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:28,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:28,842 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:01:28,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:28,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:28,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:28,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:28,844 INFO L87 Difference]: Start difference. First operand 41173 states and 58024 transitions. Second operand 7 states. [2019-09-10 08:01:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:29,343 INFO L93 Difference]: Finished difference Result 65287 states and 92101 transitions. [2019-09-10 08:01:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:29,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 08:01:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:29,411 INFO L225 Difference]: With dead ends: 65287 [2019-09-10 08:01:29,411 INFO L226 Difference]: Without dead ends: 65287 [2019-09-10 08:01:29,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65287 states. [2019-09-10 08:01:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65287 to 51253. [2019-09-10 08:01:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51253 states. [2019-09-10 08:01:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51253 states to 51253 states and 72104 transitions. [2019-09-10 08:01:30,539 INFO L78 Accepts]: Start accepts. Automaton has 51253 states and 72104 transitions. Word has length 180 [2019-09-10 08:01:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:30,540 INFO L475 AbstractCegarLoop]: Abstraction has 51253 states and 72104 transitions. [2019-09-10 08:01:30,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 51253 states and 72104 transitions. [2019-09-10 08:01:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:01:30,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:30,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:30,570 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 202217735, now seen corresponding path program 1 times [2019-09-10 08:01:30,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:30,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:30,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:30,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:30,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:30,745 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:01:30,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:30,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:30,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:30,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:30,747 INFO L87 Difference]: Start difference. First operand 51253 states and 72104 transitions. Second operand 7 states. [2019-09-10 08:01:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:31,502 INFO L93 Difference]: Finished difference Result 79587 states and 112569 transitions. [2019-09-10 08:01:31,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:31,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 08:01:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:31,582 INFO L225 Difference]: With dead ends: 79587 [2019-09-10 08:01:31,582 INFO L226 Difference]: Without dead ends: 79587 [2019-09-10 08:01:31,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79587 states. [2019-09-10 08:01:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79587 to 56277. [2019-09-10 08:01:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56277 states. [2019-09-10 08:01:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56277 states to 56277 states and 79208 transitions. [2019-09-10 08:01:32,338 INFO L78 Accepts]: Start accepts. Automaton has 56277 states and 79208 transitions. Word has length 180 [2019-09-10 08:01:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:32,338 INFO L475 AbstractCegarLoop]: Abstraction has 56277 states and 79208 transitions. [2019-09-10 08:01:32,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 56277 states and 79208 transitions. [2019-09-10 08:01:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:01:32,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:32,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:32,372 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash -200791795, now seen corresponding path program 1 times [2019-09-10 08:01:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:32,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:32,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:32,581 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:01:32,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:32,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:32,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:32,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:32,583 INFO L87 Difference]: Start difference. First operand 56277 states and 79208 transitions. Second operand 7 states. [2019-09-10 08:01:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:33,501 INFO L93 Difference]: Finished difference Result 85607 states and 121165 transitions. [2019-09-10 08:01:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:33,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 08:01:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:33,599 INFO L225 Difference]: With dead ends: 85607 [2019-09-10 08:01:33,599 INFO L226 Difference]: Without dead ends: 85607 [2019-09-10 08:01:33,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85607 states. [2019-09-10 08:01:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85607 to 61781. [2019-09-10 08:01:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61781 states. [2019-09-10 08:01:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61781 states to 61781 states and 87024 transitions. [2019-09-10 08:01:34,318 INFO L78 Accepts]: Start accepts. Automaton has 61781 states and 87024 transitions. Word has length 180 [2019-09-10 08:01:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:34,318 INFO L475 AbstractCegarLoop]: Abstraction has 61781 states and 87024 transitions. [2019-09-10 08:01:34,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 61781 states and 87024 transitions. [2019-09-10 08:01:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:01:34,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:34,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:34,355 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:34,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2013801790, now seen corresponding path program 1 times [2019-09-10 08:01:34,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:34,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:34,685 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:01:34,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:34,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:01:34,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:34,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:01:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:01:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:01:34,686 INFO L87 Difference]: Start difference. First operand 61781 states and 87024 transitions. Second operand 7 states. [2019-09-10 08:01:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:35,309 INFO L93 Difference]: Finished difference Result 81057 states and 112930 transitions. [2019-09-10 08:01:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:01:35,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-10 08:01:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:35,380 INFO L225 Difference]: With dead ends: 81057 [2019-09-10 08:01:35,380 INFO L226 Difference]: Without dead ends: 81057 [2019-09-10 08:01:35,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81057 states. [2019-09-10 08:01:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81057 to 65901. [2019-09-10 08:01:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65901 states. [2019-09-10 08:01:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65901 states to 65901 states and 91496 transitions. [2019-09-10 08:01:36,355 INFO L78 Accepts]: Start accepts. Automaton has 65901 states and 91496 transitions. Word has length 182 [2019-09-10 08:01:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:36,355 INFO L475 AbstractCegarLoop]: Abstraction has 65901 states and 91496 transitions. [2019-09-10 08:01:36,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:01:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 65901 states and 91496 transitions. [2019-09-10 08:01:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:01:36,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:36,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:36,395 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2051201949, now seen corresponding path program 1 times [2019-09-10 08:01:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:36,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:36,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:36,469 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:01:36,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:36,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:36,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:36,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:36,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:36,471 INFO L87 Difference]: Start difference. First operand 65901 states and 91496 transitions. Second operand 3 states. [2019-09-10 08:01:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:36,626 INFO L93 Difference]: Finished difference Result 65893 states and 91472 transitions. [2019-09-10 08:01:36,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:36,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:01:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:36,682 INFO L225 Difference]: With dead ends: 65893 [2019-09-10 08:01:36,682 INFO L226 Difference]: Without dead ends: 65893 [2019-09-10 08:01:36,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:01:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65893 states. [2019-09-10 08:01:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65893 to 65893. [2019-09-10 08:01:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65893 states. [2019-09-10 08:01:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65893 states to 65893 states and 91472 transitions. [2019-09-10 08:01:37,303 INFO L78 Accepts]: Start accepts. Automaton has 65893 states and 91472 transitions. Word has length 182 [2019-09-10 08:01:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:37,303 INFO L475 AbstractCegarLoop]: Abstraction has 65893 states and 91472 transitions. [2019-09-10 08:01:37,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 65893 states and 91472 transitions. [2019-09-10 08:01:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:01:37,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:37,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:37,339 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash -186993458, now seen corresponding path program 1 times [2019-09-10 08:01:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:37,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:37,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:38,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:38,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:01:38,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:38,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:01:38,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:01:38,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:01:38,013 INFO L87 Difference]: Start difference. First operand 65893 states and 91472 transitions. Second operand 10 states. [2019-09-10 08:01:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:40,764 INFO L93 Difference]: Finished difference Result 334623 states and 462858 transitions. [2019-09-10 08:01:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:01:40,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-10 08:01:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:41,094 INFO L225 Difference]: With dead ends: 334623 [2019-09-10 08:01:41,094 INFO L226 Difference]: Without dead ends: 334623 [2019-09-10 08:01:41,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:01:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334623 states. [2019-09-10 08:01:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334623 to 62573. [2019-09-10 08:01:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62573 states. [2019-09-10 08:01:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62573 states to 62573 states and 86724 transitions. [2019-09-10 08:01:43,640 INFO L78 Accepts]: Start accepts. Automaton has 62573 states and 86724 transitions. Word has length 183 [2019-09-10 08:01:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:43,641 INFO L475 AbstractCegarLoop]: Abstraction has 62573 states and 86724 transitions. [2019-09-10 08:01:43,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:01:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 62573 states and 86724 transitions. [2019-09-10 08:01:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:01:43,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:43,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:43,673 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash -803841952, now seen corresponding path program 1 times [2019-09-10 08:01:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:43,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:43,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:44,099 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:01:44,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:44,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:01:44,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:44,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:01:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:01:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:01:44,101 INFO L87 Difference]: Start difference. First operand 62573 states and 86724 transitions. Second operand 14 states. [2019-09-10 08:01:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:51,737 INFO L93 Difference]: Finished difference Result 481548 states and 670176 transitions. [2019-09-10 08:01:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 08:01:51,737 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 183 [2019-09-10 08:01:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:52,307 INFO L225 Difference]: With dead ends: 481548 [2019-09-10 08:01:52,307 INFO L226 Difference]: Without dead ends: 481548 [2019-09-10 08:01:52,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=521, Invalid=1929, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:01:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481548 states. [2019-09-10 08:01:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481548 to 65172. [2019-09-10 08:01:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65172 states. [2019-09-10 08:01:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65172 states to 65172 states and 90083 transitions. [2019-09-10 08:01:58,502 INFO L78 Accepts]: Start accepts. Automaton has 65172 states and 90083 transitions. Word has length 183 [2019-09-10 08:01:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:58,502 INFO L475 AbstractCegarLoop]: Abstraction has 65172 states and 90083 transitions. [2019-09-10 08:01:58,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:01:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 65172 states and 90083 transitions. [2019-09-10 08:01:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:01:58,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:58,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:58,536 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1466595674, now seen corresponding path program 1 times [2019-09-10 08:01:58,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:58,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:58,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:58,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:58,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:58,637 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:01:58,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:58,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:01:58,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:58,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:01:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:01:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:01:58,639 INFO L87 Difference]: Start difference. First operand 65172 states and 90083 transitions. Second operand 3 states. [2019-09-10 08:01:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:58,754 INFO L93 Difference]: Finished difference Result 35213 states and 47953 transitions. [2019-09-10 08:01:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:01:58,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 08:01:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:59,192 INFO L225 Difference]: With dead ends: 35213 [2019-09-10 08:01:59,192 INFO L226 Difference]: Without dead ends: 35213 [2019-09-10 08:01:59,192 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:01:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35213 states. [2019-09-10 08:01:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35213 to 35211. [2019-09-10 08:01:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35211 states. [2019-09-10 08:01:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35211 states to 35211 states and 47952 transitions. [2019-09-10 08:01:59,706 INFO L78 Accepts]: Start accepts. Automaton has 35211 states and 47952 transitions. Word has length 183 [2019-09-10 08:01:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:59,707 INFO L475 AbstractCegarLoop]: Abstraction has 35211 states and 47952 transitions. [2019-09-10 08:01:59,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:01:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35211 states and 47952 transitions. [2019-09-10 08:01:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:01:59,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:59,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:59,729 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1608261022, now seen corresponding path program 1 times [2019-09-10 08:01:59,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:59,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:59,801 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:01:59,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:59,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:01:59,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:59,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:01:59,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:01:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:01:59,802 INFO L87 Difference]: Start difference. First operand 35211 states and 47952 transitions. Second operand 4 states. [2019-09-10 08:02:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:00,258 INFO L93 Difference]: Finished difference Result 61295 states and 83725 transitions. [2019-09-10 08:02:00,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:02:00,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:02:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:00,312 INFO L225 Difference]: With dead ends: 61295 [2019-09-10 08:02:00,312 INFO L226 Difference]: Without dead ends: 61295 [2019-09-10 08:02:00,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:02:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61295 states. [2019-09-10 08:02:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61295 to 32357. [2019-09-10 08:02:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32357 states. [2019-09-10 08:02:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32357 states to 32357 states and 44162 transitions. [2019-09-10 08:02:00,858 INFO L78 Accepts]: Start accepts. Automaton has 32357 states and 44162 transitions. Word has length 184 [2019-09-10 08:02:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:00,859 INFO L475 AbstractCegarLoop]: Abstraction has 32357 states and 44162 transitions. [2019-09-10 08:02:00,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32357 states and 44162 transitions. [2019-09-10 08:02:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:02:00,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:00,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:00,876 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1429563028, now seen corresponding path program 1 times [2019-09-10 08:02:00,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:00,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:01,113 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:02:01,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:01,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:01,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:01,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:01,114 INFO L87 Difference]: Start difference. First operand 32357 states and 44162 transitions. Second operand 10 states. [2019-09-10 08:02:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:04,187 INFO L93 Difference]: Finished difference Result 171786 states and 235782 transitions. [2019-09-10 08:02:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:02:04,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-10 08:02:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:04,351 INFO L225 Difference]: With dead ends: 171786 [2019-09-10 08:02:04,351 INFO L226 Difference]: Without dead ends: 171786 [2019-09-10 08:02:04,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:02:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171786 states. [2019-09-10 08:02:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171786 to 32466. [2019-09-10 08:02:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32466 states. [2019-09-10 08:02:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32466 states to 32466 states and 44284 transitions. [2019-09-10 08:02:05,964 INFO L78 Accepts]: Start accepts. Automaton has 32466 states and 44284 transitions. Word has length 184 [2019-09-10 08:02:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:05,964 INFO L475 AbstractCegarLoop]: Abstraction has 32466 states and 44284 transitions. [2019-09-10 08:02:05,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 32466 states and 44284 transitions. [2019-09-10 08:02:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:02:05,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:05,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:05,981 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1301309832, now seen corresponding path program 1 times [2019-09-10 08:02:05,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:05,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:05,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:06,333 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:02:06,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:06,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:02:06,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:06,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:02:06,335 INFO L87 Difference]: Start difference. First operand 32466 states and 44284 transitions. Second operand 12 states. [2019-09-10 08:02:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:09,929 INFO L93 Difference]: Finished difference Result 111120 states and 152729 transitions. [2019-09-10 08:02:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:02:09,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 184 [2019-09-10 08:02:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:10,034 INFO L225 Difference]: With dead ends: 111120 [2019-09-10 08:02:10,034 INFO L226 Difference]: Without dead ends: 111120 [2019-09-10 08:02:10,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:02:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111120 states. [2019-09-10 08:02:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111120 to 31466. [2019-09-10 08:02:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31466 states. [2019-09-10 08:02:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31466 states to 31466 states and 42916 transitions. [2019-09-10 08:02:11,220 INFO L78 Accepts]: Start accepts. Automaton has 31466 states and 42916 transitions. Word has length 184 [2019-09-10 08:02:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:11,220 INFO L475 AbstractCegarLoop]: Abstraction has 31466 states and 42916 transitions. [2019-09-10 08:02:11,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 31466 states and 42916 transitions. [2019-09-10 08:02:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:02:11,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:11,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:11,237 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash -206160051, now seen corresponding path program 1 times [2019-09-10 08:02:11,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:11,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:11,539 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:02:11,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:11,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:11,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:11,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:11,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:11,542 INFO L87 Difference]: Start difference. First operand 31466 states and 42916 transitions. Second operand 10 states. [2019-09-10 08:02:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:13,925 INFO L93 Difference]: Finished difference Result 152594 states and 209009 transitions. [2019-09-10 08:02:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:02:13,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-10 08:02:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:14,058 INFO L225 Difference]: With dead ends: 152594 [2019-09-10 08:02:14,058 INFO L226 Difference]: Without dead ends: 152594 [2019-09-10 08:02:14,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:02:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152594 states. [2019-09-10 08:02:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152594 to 41618. [2019-09-10 08:02:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41618 states. [2019-09-10 08:02:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41618 states to 41618 states and 56070 transitions. [2019-09-10 08:02:15,768 INFO L78 Accepts]: Start accepts. Automaton has 41618 states and 56070 transitions. Word has length 184 [2019-09-10 08:02:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:15,769 INFO L475 AbstractCegarLoop]: Abstraction has 41618 states and 56070 transitions. [2019-09-10 08:02:15,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 41618 states and 56070 transitions. [2019-09-10 08:02:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:02:15,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:15,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:15,798 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:15,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:15,798 INFO L82 PathProgramCache]: Analyzing trace with hash 333790234, now seen corresponding path program 1 times [2019-09-10 08:02:15,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:15,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:15,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:15,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:15,881 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:02:15,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:15,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:02:15,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:15,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:02:15,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:02:15,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:02:15,882 INFO L87 Difference]: Start difference. First operand 41618 states and 56070 transitions. Second operand 4 states. [2019-09-10 08:02:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:16,434 INFO L93 Difference]: Finished difference Result 65412 states and 88621 transitions. [2019-09-10 08:02:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:02:16,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-09-10 08:02:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:16,491 INFO L225 Difference]: With dead ends: 65412 [2019-09-10 08:02:16,492 INFO L226 Difference]: Without dead ends: 65412 [2019-09-10 08:02:16,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:02:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65412 states. [2019-09-10 08:02:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65412 to 41618. [2019-09-10 08:02:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41618 states. [2019-09-10 08:02:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41618 states to 41618 states and 56070 transitions. [2019-09-10 08:02:17,035 INFO L78 Accepts]: Start accepts. Automaton has 41618 states and 56070 transitions. Word has length 185 [2019-09-10 08:02:17,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:17,036 INFO L475 AbstractCegarLoop]: Abstraction has 41618 states and 56070 transitions. [2019-09-10 08:02:17,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 41618 states and 56070 transitions. [2019-09-10 08:02:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:02:17,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:17,066 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1113239361, now seen corresponding path program 1 times [2019-09-10 08:02:17,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:17,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:17,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:17,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:17,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:17,319 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:02:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:17,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:17,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:17,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:17,323 INFO L87 Difference]: Start difference. First operand 41618 states and 56070 transitions. Second operand 10 states. [2019-09-10 08:02:20,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:20,262 INFO L93 Difference]: Finished difference Result 205262 states and 277577 transitions. [2019-09-10 08:02:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:02:20,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-10 08:02:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:20,472 INFO L225 Difference]: With dead ends: 205262 [2019-09-10 08:02:20,472 INFO L226 Difference]: Without dead ends: 205262 [2019-09-10 08:02:20,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:02:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205262 states. [2019-09-10 08:02:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205262 to 41864. [2019-09-10 08:02:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41864 states. [2019-09-10 08:02:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41864 states to 41864 states and 56352 transitions. [2019-09-10 08:02:22,544 INFO L78 Accepts]: Start accepts. Automaton has 41864 states and 56352 transitions. Word has length 185 [2019-09-10 08:02:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:22,544 INFO L475 AbstractCegarLoop]: Abstraction has 41864 states and 56352 transitions. [2019-09-10 08:02:22,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 41864 states and 56352 transitions. [2019-09-10 08:02:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:02:22,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:22,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:22,569 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1421876632, now seen corresponding path program 1 times [2019-09-10 08:02:22,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:22,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:22,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:22,827 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:02:22,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:22,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:22,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:22,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:22,828 INFO L87 Difference]: Start difference. First operand 41864 states and 56352 transitions. Second operand 10 states. [2019-09-10 08:02:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:25,014 INFO L93 Difference]: Finished difference Result 207986 states and 279839 transitions. [2019-09-10 08:02:25,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:02:25,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-10 08:02:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:25,217 INFO L225 Difference]: With dead ends: 207986 [2019-09-10 08:02:25,218 INFO L226 Difference]: Without dead ends: 207986 [2019-09-10 08:02:25,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:02:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207986 states. [2019-09-10 08:02:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207986 to 42626. [2019-09-10 08:02:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42626 states. [2019-09-10 08:02:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42626 states to 42626 states and 57296 transitions. [2019-09-10 08:02:27,227 INFO L78 Accepts]: Start accepts. Automaton has 42626 states and 57296 transitions. Word has length 185 [2019-09-10 08:02:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:27,227 INFO L475 AbstractCegarLoop]: Abstraction has 42626 states and 57296 transitions. [2019-09-10 08:02:27,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 42626 states and 57296 transitions. [2019-09-10 08:02:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:02:27,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:27,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:27,252 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1890555556, now seen corresponding path program 1 times [2019-09-10 08:02:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:27,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:27,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:27,306 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:02:27,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:27,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:02:27,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:02:27,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:02:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:27,308 INFO L87 Difference]: Start difference. First operand 42626 states and 57296 transitions. Second operand 3 states. [2019-09-10 08:02:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:27,521 INFO L93 Difference]: Finished difference Result 40410 states and 54014 transitions. [2019-09-10 08:02:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:02:27,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-10 08:02:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:27,556 INFO L225 Difference]: With dead ends: 40410 [2019-09-10 08:02:27,556 INFO L226 Difference]: Without dead ends: 40410 [2019-09-10 08:02:27,556 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:02:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40410 states. [2019-09-10 08:02:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40410 to 40410. [2019-09-10 08:02:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40410 states. [2019-09-10 08:02:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40410 states to 40410 states and 54014 transitions. [2019-09-10 08:02:27,977 INFO L78 Accepts]: Start accepts. Automaton has 40410 states and 54014 transitions. Word has length 186 [2019-09-10 08:02:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:27,977 INFO L475 AbstractCegarLoop]: Abstraction has 40410 states and 54014 transitions. [2019-09-10 08:02:27,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:02:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 40410 states and 54014 transitions. [2019-09-10 08:02:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:02:28,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:28,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:28,000 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1924059500, now seen corresponding path program 1 times [2019-09-10 08:02:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:28,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:28,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:28,062 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:02:28,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:28,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:02:28,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:28,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:02:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:02:28,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:28,064 INFO L87 Difference]: Start difference. First operand 40410 states and 54014 transitions. Second operand 3 states. [2019-09-10 08:02:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:28,278 INFO L93 Difference]: Finished difference Result 39354 states and 52274 transitions. [2019-09-10 08:02:28,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:02:28,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-10 08:02:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:28,310 INFO L225 Difference]: With dead ends: 39354 [2019-09-10 08:02:28,310 INFO L226 Difference]: Without dead ends: 39354 [2019-09-10 08:02:28,311 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:02:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39354 states. [2019-09-10 08:02:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39354 to 39354. [2019-09-10 08:02:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39354 states. [2019-09-10 08:02:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39354 states to 39354 states and 52274 transitions. [2019-09-10 08:02:28,951 INFO L78 Accepts]: Start accepts. Automaton has 39354 states and 52274 transitions. Word has length 186 [2019-09-10 08:02:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:28,952 INFO L475 AbstractCegarLoop]: Abstraction has 39354 states and 52274 transitions. [2019-09-10 08:02:28,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:02:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 39354 states and 52274 transitions. [2019-09-10 08:02:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:02:28,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:28,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:28,975 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:28,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2108182768, now seen corresponding path program 1 times [2019-09-10 08:02:28,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:28,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:28,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:28,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:28,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:29,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:29,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:29,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:29,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:29,196 INFO L87 Difference]: Start difference. First operand 39354 states and 52274 transitions. Second operand 10 states. [2019-09-10 08:02:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:32,065 INFO L93 Difference]: Finished difference Result 226327 states and 303561 transitions. [2019-09-10 08:02:32,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:02:32,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-10 08:02:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:32,276 INFO L225 Difference]: With dead ends: 226327 [2019-09-10 08:02:32,276 INFO L226 Difference]: Without dead ends: 226327 [2019-09-10 08:02:32,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:02:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226327 states. [2019-09-10 08:02:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226327 to 37335. [2019-09-10 08:02:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37335 states. [2019-09-10 08:02:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37335 states to 37335 states and 49646 transitions. [2019-09-10 08:02:34,247 INFO L78 Accepts]: Start accepts. Automaton has 37335 states and 49646 transitions. Word has length 186 [2019-09-10 08:02:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:34,248 INFO L475 AbstractCegarLoop]: Abstraction has 37335 states and 49646 transitions. [2019-09-10 08:02:34,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 37335 states and 49646 transitions. [2019-09-10 08:02:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:02:34,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:34,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:34,271 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash 687128316, now seen corresponding path program 1 times [2019-09-10 08:02:34,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:34,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:34,362 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:02:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:34,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:02:34,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:34,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:02:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:02:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:34,364 INFO L87 Difference]: Start difference. First operand 37335 states and 49646 transitions. Second operand 3 states. [2019-09-10 08:02:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:34,448 INFO L93 Difference]: Finished difference Result 19364 states and 25366 transitions. [2019-09-10 08:02:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:02:34,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-10 08:02:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:34,472 INFO L225 Difference]: With dead ends: 19364 [2019-09-10 08:02:34,472 INFO L226 Difference]: Without dead ends: 19364 [2019-09-10 08:02:34,473 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:02:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19364 states. [2019-09-10 08:02:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19364 to 19362. [2019-09-10 08:02:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19362 states. [2019-09-10 08:02:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19362 states to 19362 states and 25365 transitions. [2019-09-10 08:02:34,760 INFO L78 Accepts]: Start accepts. Automaton has 19362 states and 25365 transitions. Word has length 186 [2019-09-10 08:02:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:34,761 INFO L475 AbstractCegarLoop]: Abstraction has 19362 states and 25365 transitions. [2019-09-10 08:02:34,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:02:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 19362 states and 25365 transitions. [2019-09-10 08:02:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:02:34,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:34,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:34,776 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1797936065, now seen corresponding path program 1 times [2019-09-10 08:02:34,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:34,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:34,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:35,099 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:02:35,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:35,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:02:35,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:35,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:35,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:02:35,101 INFO L87 Difference]: Start difference. First operand 19362 states and 25365 transitions. Second operand 12 states. [2019-09-10 08:02:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:37,456 INFO L93 Difference]: Finished difference Result 53623 states and 70945 transitions. [2019-09-10 08:02:37,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:02:37,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-10 08:02:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:37,501 INFO L225 Difference]: With dead ends: 53623 [2019-09-10 08:02:37,501 INFO L226 Difference]: Without dead ends: 53623 [2019-09-10 08:02:37,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:02:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53623 states. [2019-09-10 08:02:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53623 to 27257. [2019-09-10 08:02:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27257 states. [2019-09-10 08:02:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27257 states to 27257 states and 35306 transitions. [2019-09-10 08:02:37,971 INFO L78 Accepts]: Start accepts. Automaton has 27257 states and 35306 transitions. Word has length 187 [2019-09-10 08:02:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:37,971 INFO L475 AbstractCegarLoop]: Abstraction has 27257 states and 35306 transitions. [2019-09-10 08:02:37,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 27257 states and 35306 transitions. [2019-09-10 08:02:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:02:37,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:37,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:37,989 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1617981026, now seen corresponding path program 1 times [2019-09-10 08:02:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:37,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:37,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:38,602 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:02:38,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:38,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:02:38,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:38,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:38,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:02:38,604 INFO L87 Difference]: Start difference. First operand 27257 states and 35306 transitions. Second operand 12 states. [2019-09-10 08:02:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:41,092 INFO L93 Difference]: Finished difference Result 48657 states and 64394 transitions. [2019-09-10 08:02:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:02:41,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-10 08:02:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:41,132 INFO L225 Difference]: With dead ends: 48657 [2019-09-10 08:02:41,132 INFO L226 Difference]: Without dead ends: 48657 [2019-09-10 08:02:41,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:02:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48657 states. [2019-09-10 08:02:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48657 to 20182. [2019-09-10 08:02:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20182 states. [2019-09-10 08:02:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20182 states to 20182 states and 26451 transitions. [2019-09-10 08:02:41,516 INFO L78 Accepts]: Start accepts. Automaton has 20182 states and 26451 transitions. Word has length 187 [2019-09-10 08:02:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:41,516 INFO L475 AbstractCegarLoop]: Abstraction has 20182 states and 26451 transitions. [2019-09-10 08:02:41,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 20182 states and 26451 transitions. [2019-09-10 08:02:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:02:41,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:41,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:41,529 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1274732102, now seen corresponding path program 1 times [2019-09-10 08:02:41,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:41,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:41,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:41,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:41,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:41,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:02:41,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:41,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:02:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:02:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:02:41,607 INFO L87 Difference]: Start difference. First operand 20182 states and 26451 transitions. Second operand 4 states. [2019-09-10 08:02:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:41,890 INFO L93 Difference]: Finished difference Result 18054 states and 23478 transitions. [2019-09-10 08:02:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:02:41,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-09-10 08:02:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:41,907 INFO L225 Difference]: With dead ends: 18054 [2019-09-10 08:02:41,907 INFO L226 Difference]: Without dead ends: 18054 [2019-09-10 08:02:41,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:02:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18054 states. [2019-09-10 08:02:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18054 to 14672. [2019-09-10 08:02:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14672 states. [2019-09-10 08:02:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14672 states to 14672 states and 19323 transitions. [2019-09-10 08:02:42,058 INFO L78 Accepts]: Start accepts. Automaton has 14672 states and 19323 transitions. Word has length 188 [2019-09-10 08:02:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:42,058 INFO L475 AbstractCegarLoop]: Abstraction has 14672 states and 19323 transitions. [2019-09-10 08:02:42,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14672 states and 19323 transitions. [2019-09-10 08:02:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:02:42,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,064 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2128134123, now seen corresponding path program 1 times [2019-09-10 08:02:42,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:42,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:42,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:42,444 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:02:42,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:42,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:02:42,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:42,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:42,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:42,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:02:42,446 INFO L87 Difference]: Start difference. First operand 14672 states and 19323 transitions. Second operand 12 states. [2019-09-10 08:02:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:45,708 INFO L93 Difference]: Finished difference Result 46122 states and 61576 transitions. [2019-09-10 08:02:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:02:45,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2019-09-10 08:02:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:45,745 INFO L225 Difference]: With dead ends: 46122 [2019-09-10 08:02:45,745 INFO L226 Difference]: Without dead ends: 46122 [2019-09-10 08:02:45,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:02:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46122 states. [2019-09-10 08:02:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46122 to 13500. [2019-09-10 08:02:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13500 states. [2019-09-10 08:02:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13500 states to 13500 states and 17645 transitions. [2019-09-10 08:02:46,243 INFO L78 Accepts]: Start accepts. Automaton has 13500 states and 17645 transitions. Word has length 188 [2019-09-10 08:02:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:46,243 INFO L475 AbstractCegarLoop]: Abstraction has 13500 states and 17645 transitions. [2019-09-10 08:02:46,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13500 states and 17645 transitions. [2019-09-10 08:02:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:02:46,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:46,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:46,249 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash -641922616, now seen corresponding path program 1 times [2019-09-10 08:02:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:46,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:46,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:46,543 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:02:46,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:46,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:46,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:46,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:46,545 INFO L87 Difference]: Start difference. First operand 13500 states and 17645 transitions. Second operand 10 states. [2019-09-10 08:02:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:48,029 INFO L93 Difference]: Finished difference Result 30120 states and 40053 transitions. [2019-09-10 08:02:48,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:02:48,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-10 08:02:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:48,053 INFO L225 Difference]: With dead ends: 30120 [2019-09-10 08:02:48,053 INFO L226 Difference]: Without dead ends: 30120 [2019-09-10 08:02:48,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:02:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30120 states. [2019-09-10 08:02:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30120 to 11269. [2019-09-10 08:02:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11269 states. [2019-09-10 08:02:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 14865 transitions. [2019-09-10 08:02:48,216 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 14865 transitions. Word has length 188 [2019-09-10 08:02:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:48,217 INFO L475 AbstractCegarLoop]: Abstraction has 11269 states and 14865 transitions. [2019-09-10 08:02:48,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 14865 transitions. [2019-09-10 08:02:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:02:48,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:48,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:48,221 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:48,221 INFO L82 PathProgramCache]: Analyzing trace with hash -310390411, now seen corresponding path program 1 times [2019-09-10 08:02:48,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:48,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:48,289 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:02:48,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:48,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:02:48,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:48,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:02:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:02:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:02:48,291 INFO L87 Difference]: Start difference. First operand 11269 states and 14865 transitions. Second operand 4 states. [2019-09-10 08:02:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:48,590 INFO L93 Difference]: Finished difference Result 11934 states and 15581 transitions. [2019-09-10 08:02:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:02:48,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-10 08:02:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:48,601 INFO L225 Difference]: With dead ends: 11934 [2019-09-10 08:02:48,601 INFO L226 Difference]: Without dead ends: 11934 [2019-09-10 08:02:48,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:02:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11934 states. [2019-09-10 08:02:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11934 to 11035. [2019-09-10 08:02:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11035 states. [2019-09-10 08:02:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11035 states to 11035 states and 14553 transitions. [2019-09-10 08:02:48,681 INFO L78 Accepts]: Start accepts. Automaton has 11035 states and 14553 transitions. Word has length 189 [2019-09-10 08:02:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:48,682 INFO L475 AbstractCegarLoop]: Abstraction has 11035 states and 14553 transitions. [2019-09-10 08:02:48,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 11035 states and 14553 transitions. [2019-09-10 08:02:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:02:48,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:48,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:48,685 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 963477594, now seen corresponding path program 1 times [2019-09-10 08:02:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:48,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:48,940 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:02:48,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:48,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:48,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:48,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:48,942 INFO L87 Difference]: Start difference. First operand 11035 states and 14553 transitions. Second operand 10 states. [2019-09-10 08:02:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:51,239 INFO L93 Difference]: Finished difference Result 42199 states and 56470 transitions. [2019-09-10 08:02:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:02:51,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-09-10 08:02:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:51,273 INFO L225 Difference]: With dead ends: 42199 [2019-09-10 08:02:51,273 INFO L226 Difference]: Without dead ends: 42199 [2019-09-10 08:02:51,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:02:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42199 states. [2019-09-10 08:02:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42199 to 10492. [2019-09-10 08:02:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10492 states. [2019-09-10 08:02:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10492 states to 10492 states and 13939 transitions. [2019-09-10 08:02:51,486 INFO L78 Accepts]: Start accepts. Automaton has 10492 states and 13939 transitions. Word has length 189 [2019-09-10 08:02:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:51,486 INFO L475 AbstractCegarLoop]: Abstraction has 10492 states and 13939 transitions. [2019-09-10 08:02:51,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10492 states and 13939 transitions. [2019-09-10 08:02:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:02:51,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:51,490 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1907125491, now seen corresponding path program 1 times [2019-09-10 08:02:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:51,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:51,557 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:02:51,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:51,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:02:51,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:51,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:02:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:02:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:02:51,558 INFO L87 Difference]: Start difference. First operand 10492 states and 13939 transitions. Second operand 4 states. [2019-09-10 08:02:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:51,892 INFO L93 Difference]: Finished difference Result 19000 states and 25381 transitions. [2019-09-10 08:02:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:02:51,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-10 08:02:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:51,908 INFO L225 Difference]: With dead ends: 19000 [2019-09-10 08:02:51,908 INFO L226 Difference]: Without dead ends: 19000 [2019-09-10 08:02:51,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:02:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19000 states. [2019-09-10 08:02:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19000 to 10011. [2019-09-10 08:02:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2019-09-10 08:02:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 13289 transitions. [2019-09-10 08:02:52,013 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 13289 transitions. Word has length 190 [2019-09-10 08:02:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:52,014 INFO L475 AbstractCegarLoop]: Abstraction has 10011 states and 13289 transitions. [2019-09-10 08:02:52,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 13289 transitions. [2019-09-10 08:02:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:02:52,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:52,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:52,016 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -579740302, now seen corresponding path program 1 times [2019-09-10 08:02:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:52,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:52,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:52,535 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:02:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:52,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:52,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:52,537 INFO L87 Difference]: Start difference. First operand 10011 states and 13289 transitions. Second operand 10 states. [2019-09-10 08:02:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:55,103 INFO L93 Difference]: Finished difference Result 58761 states and 78522 transitions. [2019-09-10 08:02:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:02:55,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2019-09-10 08:02:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:55,156 INFO L225 Difference]: With dead ends: 58761 [2019-09-10 08:02:55,156 INFO L226 Difference]: Without dead ends: 58761 [2019-09-10 08:02:55,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:02:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58761 states. [2019-09-10 08:02:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58761 to 11652. [2019-09-10 08:02:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11652 states. [2019-09-10 08:02:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11652 states to 11652 states and 15338 transitions. [2019-09-10 08:02:55,427 INFO L78 Accepts]: Start accepts. Automaton has 11652 states and 15338 transitions. Word has length 190 [2019-09-10 08:02:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:55,427 INFO L475 AbstractCegarLoop]: Abstraction has 11652 states and 15338 transitions. [2019-09-10 08:02:55,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 11652 states and 15338 transitions. [2019-09-10 08:02:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:02:55,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:55,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:55,432 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2013895406, now seen corresponding path program 1 times [2019-09-10 08:02:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:55,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:55,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:55,539 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:02:55,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:55,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:02:55,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:55,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:02:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:02:55,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:02:55,541 INFO L87 Difference]: Start difference. First operand 11652 states and 15338 transitions. Second operand 4 states. [2019-09-10 08:02:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:55,582 INFO L93 Difference]: Finished difference Result 11700 states and 15362 transitions. [2019-09-10 08:02:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:02:55,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-10 08:02:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:55,597 INFO L225 Difference]: With dead ends: 11700 [2019-09-10 08:02:55,597 INFO L226 Difference]: Without dead ends: 11639 [2019-09-10 08:02:55,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:02:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11639 states. [2019-09-10 08:02:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11639 to 11639. [2019-09-10 08:02:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11639 states. [2019-09-10 08:02:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11639 states to 11639 states and 15288 transitions. [2019-09-10 08:02:55,740 INFO L78 Accepts]: Start accepts. Automaton has 11639 states and 15288 transitions. Word has length 190 [2019-09-10 08:02:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:55,741 INFO L475 AbstractCegarLoop]: Abstraction has 11639 states and 15288 transitions. [2019-09-10 08:02:55,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11639 states and 15288 transitions. [2019-09-10 08:02:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:02:55,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:55,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:55,749 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2097126577, now seen corresponding path program 1 times [2019-09-10 08:02:55,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:55,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:55,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:55,854 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:02:55,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:55,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:02:55,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:55,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:02:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:02:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:55,856 INFO L87 Difference]: Start difference. First operand 11639 states and 15288 transitions. Second operand 3 states. [2019-09-10 08:02:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:55,966 INFO L93 Difference]: Finished difference Result 15920 states and 19837 transitions. [2019-09-10 08:02:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:02:55,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 08:02:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:55,996 INFO L225 Difference]: With dead ends: 15920 [2019-09-10 08:02:55,996 INFO L226 Difference]: Without dead ends: 15918 [2019-09-10 08:02:55,997 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:02:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15918 states. [2019-09-10 08:02:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15918 to 15172. [2019-09-10 08:02:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15172 states. [2019-09-10 08:02:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15172 states to 15172 states and 18986 transitions. [2019-09-10 08:02:56,178 INFO L78 Accepts]: Start accepts. Automaton has 15172 states and 18986 transitions. Word has length 192 [2019-09-10 08:02:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:56,179 INFO L475 AbstractCegarLoop]: Abstraction has 15172 states and 18986 transitions. [2019-09-10 08:02:56,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:02:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15172 states and 18986 transitions. [2019-09-10 08:02:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:02:56,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:56,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:56,185 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1274241064, now seen corresponding path program 1 times [2019-09-10 08:02:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:56,258 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:02:56,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:56,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:02:56,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:56,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:02:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:02:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:56,263 INFO L87 Difference]: Start difference. First operand 15172 states and 18986 transitions. Second operand 3 states. [2019-09-10 08:02:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:56,368 INFO L93 Difference]: Finished difference Result 16472 states and 20715 transitions. [2019-09-10 08:02:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:02:56,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-10 08:02:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:56,390 INFO L225 Difference]: With dead ends: 16472 [2019-09-10 08:02:56,390 INFO L226 Difference]: Without dead ends: 16472 [2019-09-10 08:02:56,397 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:02:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16472 states. [2019-09-10 08:02:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16472 to 15757. [2019-09-10 08:02:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15757 states. [2019-09-10 08:02:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 19730 transitions. [2019-09-10 08:02:56,576 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 19730 transitions. Word has length 193 [2019-09-10 08:02:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:56,576 INFO L475 AbstractCegarLoop]: Abstraction has 15757 states and 19730 transitions. [2019-09-10 08:02:56,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:02:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 19730 transitions. [2019-09-10 08:02:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:02:56,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:56,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:56,582 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash -972264404, now seen corresponding path program 1 times [2019-09-10 08:02:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:56,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:56,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:02:56,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:56,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:02:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:02:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:02:56,729 INFO L87 Difference]: Start difference. First operand 15757 states and 19730 transitions. Second operand 4 states. [2019-09-10 08:02:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:56,792 INFO L93 Difference]: Finished difference Result 14281 states and 17895 transitions. [2019-09-10 08:02:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:02:56,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-10 08:02:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:56,803 INFO L225 Difference]: With dead ends: 14281 [2019-09-10 08:02:56,803 INFO L226 Difference]: Without dead ends: 14281 [2019-09-10 08:02:56,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:02:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14281 states. [2019-09-10 08:02:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14281 to 14281. [2019-09-10 08:02:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14281 states. [2019-09-10 08:02:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14281 states to 14281 states and 17895 transitions. [2019-09-10 08:02:56,898 INFO L78 Accepts]: Start accepts. Automaton has 14281 states and 17895 transitions. Word has length 196 [2019-09-10 08:02:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:56,899 INFO L475 AbstractCegarLoop]: Abstraction has 14281 states and 17895 transitions. [2019-09-10 08:02:56,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:02:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14281 states and 17895 transitions. [2019-09-10 08:02:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:02:56,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:56,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:56,903 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash 282804136, now seen corresponding path program 1 times [2019-09-10 08:02:56,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:57,033 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:02:57,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:57,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:02:57,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:57,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:02:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:02:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:02:57,035 INFO L87 Difference]: Start difference. First operand 14281 states and 17895 transitions. Second operand 6 states. [2019-09-10 08:02:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:57,253 INFO L93 Difference]: Finished difference Result 17265 states and 21681 transitions. [2019-09-10 08:02:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:02:57,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-10 08:02:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:57,268 INFO L225 Difference]: With dead ends: 17265 [2019-09-10 08:02:57,268 INFO L226 Difference]: Without dead ends: 17265 [2019-09-10 08:02:57,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:02:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17265 states. [2019-09-10 08:02:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17265 to 14281. [2019-09-10 08:02:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14281 states. [2019-09-10 08:02:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14281 states to 14281 states and 17895 transitions. [2019-09-10 08:02:57,646 INFO L78 Accepts]: Start accepts. Automaton has 14281 states and 17895 transitions. Word has length 196 [2019-09-10 08:02:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:57,646 INFO L475 AbstractCegarLoop]: Abstraction has 14281 states and 17895 transitions. [2019-09-10 08:02:57,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:02:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 14281 states and 17895 transitions. [2019-09-10 08:02:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:02:57,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:57,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:57,649 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1640400656, now seen corresponding path program 1 times [2019-09-10 08:02:57,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:57,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:57,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:57,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:57,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:57,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:02:57,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:57,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:02:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:02:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:02:57,763 INFO L87 Difference]: Start difference. First operand 14281 states and 17895 transitions. Second operand 6 states. [2019-09-10 08:02:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:57,974 INFO L93 Difference]: Finished difference Result 18086 states and 22777 transitions. [2019-09-10 08:02:57,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:02:57,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-10 08:02:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:57,989 INFO L225 Difference]: With dead ends: 18086 [2019-09-10 08:02:57,989 INFO L226 Difference]: Without dead ends: 18086 [2019-09-10 08:02:57,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:02:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18086 states. [2019-09-10 08:02:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18086 to 15473. [2019-09-10 08:02:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15473 states. [2019-09-10 08:02:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15473 states to 15473 states and 19430 transitions. [2019-09-10 08:02:58,106 INFO L78 Accepts]: Start accepts. Automaton has 15473 states and 19430 transitions. Word has length 196 [2019-09-10 08:02:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:58,106 INFO L475 AbstractCegarLoop]: Abstraction has 15473 states and 19430 transitions. [2019-09-10 08:02:58,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:02:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 15473 states and 19430 transitions. [2019-09-10 08:02:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:02:58,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:58,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:58,109 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2093055856, now seen corresponding path program 1 times [2019-09-10 08:02:58,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:58,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:58,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:58,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:58,280 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:02:58,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:58,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:02:58,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:58,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:02:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:02:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:02:58,281 INFO L87 Difference]: Start difference. First operand 15473 states and 19430 transitions. Second operand 10 states. [2019-09-10 08:02:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:59,251 INFO L93 Difference]: Finished difference Result 44386 states and 56489 transitions. [2019-09-10 08:02:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:02:59,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2019-09-10 08:02:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:59,287 INFO L225 Difference]: With dead ends: 44386 [2019-09-10 08:02:59,287 INFO L226 Difference]: Without dead ends: 44386 [2019-09-10 08:02:59,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:02:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44386 states. [2019-09-10 08:02:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44386 to 25707. [2019-09-10 08:02:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-09-10 08:02:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 32465 transitions. [2019-09-10 08:02:59,572 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 32465 transitions. Word has length 196 [2019-09-10 08:02:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:59,573 INFO L475 AbstractCegarLoop]: Abstraction has 25707 states and 32465 transitions. [2019-09-10 08:02:59,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:02:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 32465 transitions. [2019-09-10 08:02:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:02:59,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:59,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:59,577 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 500555304, now seen corresponding path program 1 times [2019-09-10 08:02:59,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:59,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:00,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:00,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:03:00,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:00,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:03:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:03:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:03:00,215 INFO L87 Difference]: Start difference. First operand 25707 states and 32465 transitions. Second operand 18 states. [2019-09-10 08:03:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:03,841 INFO L93 Difference]: Finished difference Result 220621 states and 279819 transitions. [2019-09-10 08:03:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:03:03,841 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2019-09-10 08:03:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:04,060 INFO L225 Difference]: With dead ends: 220621 [2019-09-10 08:03:04,061 INFO L226 Difference]: Without dead ends: 220621 [2019-09-10 08:03:04,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:03:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220621 states. [2019-09-10 08:03:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220621 to 26420. [2019-09-10 08:03:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26420 states. [2019-09-10 08:03:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26420 states to 26420 states and 33275 transitions. [2019-09-10 08:03:05,663 INFO L78 Accepts]: Start accepts. Automaton has 26420 states and 33275 transitions. Word has length 196 [2019-09-10 08:03:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:05,663 INFO L475 AbstractCegarLoop]: Abstraction has 26420 states and 33275 transitions. [2019-09-10 08:03:05,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:03:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26420 states and 33275 transitions. [2019-09-10 08:03:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:03:05,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:05,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:05,668 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1239594293, now seen corresponding path program 1 times [2019-09-10 08:03:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:06,256 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:03:06,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:06,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:03:06,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:06,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:03:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:03:06,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:03:06,259 INFO L87 Difference]: Start difference. First operand 26420 states and 33275 transitions. Second operand 18 states. [2019-09-10 08:03:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:08,257 INFO L93 Difference]: Finished difference Result 168612 states and 213856 transitions. [2019-09-10 08:03:08,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:03:08,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2019-09-10 08:03:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:08,421 INFO L225 Difference]: With dead ends: 168612 [2019-09-10 08:03:08,421 INFO L226 Difference]: Without dead ends: 168612 [2019-09-10 08:03:08,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:03:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168612 states. [2019-09-10 08:03:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168612 to 28469. [2019-09-10 08:03:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28469 states. [2019-09-10 08:03:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28469 states to 28469 states and 35650 transitions. [2019-09-10 08:03:09,813 INFO L78 Accepts]: Start accepts. Automaton has 28469 states and 35650 transitions. Word has length 196 [2019-09-10 08:03:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:09,813 INFO L475 AbstractCegarLoop]: Abstraction has 28469 states and 35650 transitions. [2019-09-10 08:03:09,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:03:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 28469 states and 35650 transitions. [2019-09-10 08:03:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:03:09,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:09,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:09,819 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1265411539, now seen corresponding path program 1 times [2019-09-10 08:03:09,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:09,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:09,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:09,929 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:03:09,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:09,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:03:09,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:09,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:03:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:03:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:03:09,931 INFO L87 Difference]: Start difference. First operand 28469 states and 35650 transitions. Second operand 4 states. [2019-09-10 08:03:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:09,995 INFO L93 Difference]: Finished difference Result 28489 states and 35634 transitions. [2019-09-10 08:03:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:03:09,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-10 08:03:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:10,018 INFO L225 Difference]: With dead ends: 28489 [2019-09-10 08:03:10,019 INFO L226 Difference]: Without dead ends: 28392 [2019-09-10 08:03:10,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2019-09-10 08:03:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28341. [2019-09-10 08:03:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28341 states. [2019-09-10 08:03:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28341 states to 28341 states and 35470 transitions. [2019-09-10 08:03:10,228 INFO L78 Accepts]: Start accepts. Automaton has 28341 states and 35470 transitions. Word has length 196 [2019-09-10 08:03:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:10,228 INFO L475 AbstractCegarLoop]: Abstraction has 28341 states and 35470 transitions. [2019-09-10 08:03:10,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:03:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 28341 states and 35470 transitions. [2019-09-10 08:03:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 08:03:10,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:10,234 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1719453647, now seen corresponding path program 1 times [2019-09-10 08:03:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:10,331 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:03:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:03:10,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:10,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:03:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:03:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:03:10,333 INFO L87 Difference]: Start difference. First operand 28341 states and 35470 transitions. Second operand 6 states. [2019-09-10 08:03:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:10,501 INFO L93 Difference]: Finished difference Result 40466 states and 51432 transitions. [2019-09-10 08:03:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:03:10,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-09-10 08:03:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:10,534 INFO L225 Difference]: With dead ends: 40466 [2019-09-10 08:03:10,534 INFO L226 Difference]: Without dead ends: 40466 [2019-09-10 08:03:10,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:03:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40466 states. [2019-09-10 08:03:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40466 to 28837. [2019-09-10 08:03:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28837 states. [2019-09-10 08:03:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28837 states to 28837 states and 35878 transitions. [2019-09-10 08:03:10,844 INFO L78 Accepts]: Start accepts. Automaton has 28837 states and 35878 transitions. Word has length 200 [2019-09-10 08:03:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:10,845 INFO L475 AbstractCegarLoop]: Abstraction has 28837 states and 35878 transitions. [2019-09-10 08:03:10,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:03:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28837 states and 35878 transitions. [2019-09-10 08:03:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 08:03:10,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:10,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:10,850 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:10,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1965513133, now seen corresponding path program 1 times [2019-09-10 08:03:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:10,916 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:03:10,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:10,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:10,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:10,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:10,917 INFO L87 Difference]: Start difference. First operand 28837 states and 35878 transitions. Second operand 3 states. [2019-09-10 08:03:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:10,990 INFO L93 Difference]: Finished difference Result 29519 states and 36311 transitions. [2019-09-10 08:03:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:10,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 08:03:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:11,012 INFO L225 Difference]: With dead ends: 29519 [2019-09-10 08:03:11,013 INFO L226 Difference]: Without dead ends: 29519 [2019-09-10 08:03:11,013 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:03:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29519 states. [2019-09-10 08:03:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29519 to 28853. [2019-09-10 08:03:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28853 states. [2019-09-10 08:03:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28853 states to 28853 states and 35566 transitions. [2019-09-10 08:03:11,247 INFO L78 Accepts]: Start accepts. Automaton has 28853 states and 35566 transitions. Word has length 200 [2019-09-10 08:03:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:11,247 INFO L475 AbstractCegarLoop]: Abstraction has 28853 states and 35566 transitions. [2019-09-10 08:03:11,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28853 states and 35566 transitions. [2019-09-10 08:03:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 08:03:11,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:11,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:11,253 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash -977960768, now seen corresponding path program 1 times [2019-09-10 08:03:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:11,332 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:03:11,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:11,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:11,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:11,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:11,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:11,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:11,333 INFO L87 Difference]: Start difference. First operand 28853 states and 35566 transitions. Second operand 3 states. [2019-09-10 08:03:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:11,446 INFO L93 Difference]: Finished difference Result 37255 states and 45887 transitions. [2019-09-10 08:03:11,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:11,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 08:03:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:11,475 INFO L225 Difference]: With dead ends: 37255 [2019-09-10 08:03:11,475 INFO L226 Difference]: Without dead ends: 37255 [2019-09-10 08:03:11,475 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:03:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37255 states. [2019-09-10 08:03:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37255 to 37253. [2019-09-10 08:03:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37253 states. [2019-09-10 08:03:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37253 states to 37253 states and 45886 transitions. [2019-09-10 08:03:11,770 INFO L78 Accepts]: Start accepts. Automaton has 37253 states and 45886 transitions. Word has length 201 [2019-09-10 08:03:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:11,770 INFO L475 AbstractCegarLoop]: Abstraction has 37253 states and 45886 transitions. [2019-09-10 08:03:11,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 37253 states and 45886 transitions. [2019-09-10 08:03:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:03:11,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:11,778 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:11,779 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 396268302, now seen corresponding path program 1 times [2019-09-10 08:03:11,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:03:11,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:11,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:03:11,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:11,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:03:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:03:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:03:11,933 INFO L87 Difference]: Start difference. First operand 37253 states and 45886 transitions. Second operand 6 states. [2019-09-10 08:03:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:12,423 INFO L93 Difference]: Finished difference Result 44702 states and 55182 transitions. [2019-09-10 08:03:12,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:03:12,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-09-10 08:03:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:12,456 INFO L225 Difference]: With dead ends: 44702 [2019-09-10 08:03:12,457 INFO L226 Difference]: Without dead ends: 44700 [2019-09-10 08:03:12,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44700 states. [2019-09-10 08:03:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44700 to 41079. [2019-09-10 08:03:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41079 states. [2019-09-10 08:03:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41079 states to 41079 states and 50676 transitions. [2019-09-10 08:03:12,834 INFO L78 Accepts]: Start accepts. Automaton has 41079 states and 50676 transitions. Word has length 228 [2019-09-10 08:03:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:12,835 INFO L475 AbstractCegarLoop]: Abstraction has 41079 states and 50676 transitions. [2019-09-10 08:03:12,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:03:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41079 states and 50676 transitions. [2019-09-10 08:03:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:03:12,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:12,843 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:12,843 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:12,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1050493105, now seen corresponding path program 1 times [2019-09-10 08:03:12,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:12,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:12,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:13,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:13,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:13,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 08:03:13,551 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [362], [364], [366], [369], [372], [375], [377], [379], [382], [385], [388], [390], [392], [395], [403], [405], [408], [411], [414], [416], [418], [421], [428], [430], [434], [436], [439], [442], [450], [452], [455], [463], [465], [468], [476], [478], [481], [489], [491], [494], [502], [504], [507], [510], [514], [516], [519], [520], [522], [524], [529], [531], [534], [547], [549], [552], [555], [557], [572], [574], [577], [580], [582], [597], [599], [602], [605], [607], [622], [624], [627], [630], [632], [647], [649], [652], [655], [657], [673], [676], [714], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:03:13,647 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:13,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:13,832 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:14,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:14,907 INFO L272 AbstractInterpreter]: Visited 219 different actions 1059 times. Merged at 53 different actions 722 times. Widened at 23 different actions 152 times. Performed 3781 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3781 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 121 fixpoints after 26 different actions. Largest state had 190 variables. [2019-09-10 08:03:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:14,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:14,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:14,914 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:03:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:14,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:03:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:15,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:03:15,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:16,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:16,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:16,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:22,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:22,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:03:22,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2019-09-10 08:03:22,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:03:22,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:03:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:03:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:03:22,838 INFO L87 Difference]: Start difference. First operand 41079 states and 50676 transitions. Second operand 23 states. [2019-09-10 08:03:23,455 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:03:24,556 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 08:03:25,758 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 08:03:26,860 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:03:27,319 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 08:03:27,992 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:03:28,450 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 08:03:29,301 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-10 08:03:29,840 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 08:03:30,370 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:03:30,867 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 08:03:31,581 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2019-09-10 08:03:31,991 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-09-10 08:03:32,615 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 08:03:33,706 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-09-10 08:03:34,575 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 08:03:35,229 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-09-10 08:03:35,700 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 08:03:36,531 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-09-10 08:03:37,025 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:03:37,616 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 08:03:38,175 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-09-10 08:03:38,730 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 08:03:39,321 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:03:40,285 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-09-10 08:03:41,235 WARN L188 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2019-09-10 08:03:41,799 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-09-10 08:03:42,489 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-09-10 08:03:43,155 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 08:03:43,841 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-09-10 08:03:44,364 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-09-10 08:03:45,010 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2019-09-10 08:03:45,491 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 08:03:45,976 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-09-10 08:03:46,465 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 08:03:47,144 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-10 08:03:48,303 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-09-10 08:03:48,676 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 08:03:49,122 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2019-09-10 08:03:49,584 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-09-10 08:03:50,028 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-10 08:03:50,499 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:03:51,499 WARN L188 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-09-10 08:03:51,910 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 08:03:52,542 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2019-09-10 08:03:53,134 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 08:03:53,839 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-09-10 08:03:54,527 WARN L188 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 08:03:55,169 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 08:03:55,801 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2019-09-10 08:03:56,255 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 08:03:56,956 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 08:03:57,462 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 08:03:58,077 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2019-09-10 08:03:58,781 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-09-10 08:03:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:59,046 INFO L93 Difference]: Finished difference Result 282184 states and 339472 transitions. [2019-09-10 08:03:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 08:03:59,047 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 228 [2019-09-10 08:03:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:59,829 INFO L225 Difference]: With dead ends: 282184 [2019-09-10 08:03:59,829 INFO L226 Difference]: Without dead ends: 282184 [2019-09-10 08:03:59,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 342 SyntacticMatches, 96 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3411 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=1895, Invalid=6477, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 08:04:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282184 states. [2019-09-10 08:04:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282184 to 154397. [2019-09-10 08:04:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154397 states. [2019-09-10 08:04:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154397 states to 154397 states and 188966 transitions. [2019-09-10 08:04:04,373 INFO L78 Accepts]: Start accepts. Automaton has 154397 states and 188966 transitions. Word has length 228 [2019-09-10 08:04:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:04,373 INFO L475 AbstractCegarLoop]: Abstraction has 154397 states and 188966 transitions. [2019-09-10 08:04:04,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:04:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 154397 states and 188966 transitions. [2019-09-10 08:04:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:04:04,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:04,426 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:04,427 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1252744279, now seen corresponding path program 1 times [2019-09-10 08:04:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:04,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:04,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:04:04,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:04,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:04:04,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:04,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:04:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:04:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:04,508 INFO L87 Difference]: Start difference. First operand 154397 states and 188966 transitions. Second operand 3 states. [2019-09-10 08:04:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:04,966 INFO L93 Difference]: Finished difference Result 151622 states and 184715 transitions. [2019-09-10 08:04:04,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:04:04,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-09-10 08:04:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:05,232 INFO L225 Difference]: With dead ends: 151622 [2019-09-10 08:04:05,233 INFO L226 Difference]: Without dead ends: 151622 [2019-09-10 08:04:05,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:04:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151622 states. [2019-09-10 08:04:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151622 to 151622. [2019-09-10 08:04:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151622 states. [2019-09-10 08:04:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151622 states to 151622 states and 184715 transitions. [2019-09-10 08:04:07,271 INFO L78 Accepts]: Start accepts. Automaton has 151622 states and 184715 transitions. Word has length 228 [2019-09-10 08:04:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:07,271 INFO L475 AbstractCegarLoop]: Abstraction has 151622 states and 184715 transitions. [2019-09-10 08:04:07,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:04:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 151622 states and 184715 transitions. [2019-09-10 08:04:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:04:07,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:07,295 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:07,295 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2050842813, now seen corresponding path program 1 times [2019-09-10 08:04:07,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:07,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:07,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:04:07,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:07,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:04:07,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:07,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:04:07,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:04:07,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:04:07,375 INFO L87 Difference]: Start difference. First operand 151622 states and 184715 transitions. Second operand 3 states. [2019-09-10 08:04:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:07,761 INFO L93 Difference]: Finished difference Result 149846 states and 181603 transitions. [2019-09-10 08:04:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:04:07,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-09-10 08:04:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:07,934 INFO L225 Difference]: With dead ends: 149846 [2019-09-10 08:04:07,934 INFO L226 Difference]: Without dead ends: 149846 [2019-09-10 08:04:07,935 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:04:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149846 states. [2019-09-10 08:04:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149846 to 149846. [2019-09-10 08:04:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149846 states. [2019-09-10 08:04:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149846 states to 149846 states and 181603 transitions. [2019-09-10 08:04:09,998 INFO L78 Accepts]: Start accepts. Automaton has 149846 states and 181603 transitions. Word has length 228 [2019-09-10 08:04:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:09,999 INFO L475 AbstractCegarLoop]: Abstraction has 149846 states and 181603 transitions. [2019-09-10 08:04:09,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:04:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 149846 states and 181603 transitions. [2019-09-10 08:04:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:04:10,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:10,025 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:10,026 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1625652760, now seen corresponding path program 1 times [2019-09-10 08:04:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:10,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:10,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:04:10,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:04:10,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 08:04:10,632 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [362], [364], [366], [369], [372], [377], [379], [382], [385], [388], [390], [392], [395], [403], [405], [408], [411], [414], [416], [418], [421], [424], [430], [434], [436], [439], [442], [450], [452], [455], [463], [465], [468], [476], [478], [481], [489], [491], [494], [497], [502], [504], [507], [510], [516], [519], [520], [522], [524], [527], [538], [540], [543], [549], [552], [555], [557], [572], [574], [577], [580], [582], [597], [599], [602], [605], [607], [622], [624], [627], [630], [632], [647], [649], [652], [655], [657], [666], [669], [714], [757], [760], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1041], [1044], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:04:10,640 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:04:10,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:04:10,673 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:04:10,767 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:04:10,768 INFO L272 AbstractInterpreter]: Visited 101 different actions 101 times. Never merged. Never widened. Performed 538 root evaluator evaluations with a maximum evaluation depth of 5. Performed 538 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 190 variables. [2019-09-10 08:04:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:10,768 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:04:11,254 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 76.27% of their original sizes. [2019-09-10 08:04:11,255 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:04:17,281 INFO L420 sIntCurrentIteration]: We unified 228 AI predicates to 228 [2019-09-10 08:04:17,282 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:04:17,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:04:17,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [12] total 66 [2019-09-10 08:04:17,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:17,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 08:04:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 08:04:17,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2821, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:04:17,285 INFO L87 Difference]: Start difference. First operand 149846 states and 181603 transitions. Second operand 56 states. [2019-09-10 08:05:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:07,269 INFO L93 Difference]: Finished difference Result 149776 states and 181513 transitions. [2019-09-10 08:05:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 08:05:07,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 229 [2019-09-10 08:05:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:07,420 INFO L225 Difference]: With dead ends: 149776 [2019-09-10 08:05:07,421 INFO L226 Difference]: Without dead ends: 149766 [2019-09-10 08:05:07,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=558, Invalid=7452, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 08:05:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149766 states. [2019-09-10 08:05:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149766 to 149740. [2019-09-10 08:05:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149740 states. [2019-09-10 08:05:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149740 states to 149740 states and 181469 transitions. [2019-09-10 08:05:08,809 INFO L78 Accepts]: Start accepts. Automaton has 149740 states and 181469 transitions. Word has length 229 [2019-09-10 08:05:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:08,809 INFO L475 AbstractCegarLoop]: Abstraction has 149740 states and 181469 transitions. [2019-09-10 08:05:08,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 08:05:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 149740 states and 181469 transitions. [2019-09-10 08:05:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:05:08,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:08,835 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:08,835 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:08,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1239790358, now seen corresponding path program 1 times [2019-09-10 08:05:08,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:09,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:09,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:09,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 08:05:09,414 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [362], [364], [366], [369], [372], [377], [379], [382], [385], [388], [390], [392], [395], [403], [405], [408], [411], [414], [416], [418], [421], [424], [430], [434], [436], [439], [442], [450], [452], [455], [463], [465], [468], [476], [478], [481], [489], [491], [494], [497], [502], [504], [507], [510], [516], [519], [520], [522], [524], [527], [538], [540], [543], [549], [552], [555], [557], [572], [574], [577], [580], [582], [597], [599], [602], [605], [607], [622], [624], [627], [630], [632], [647], [649], [652], [655], [657], [666], [669], [714], [757], [760], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1041], [1046], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:05:09,425 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:09,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:09,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:10,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:10,867 INFO L272 AbstractInterpreter]: Visited 221 different actions 973 times. Merged at 53 different actions 652 times. Widened at 23 different actions 111 times. Performed 3503 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3503 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 80 fixpoints after 17 different actions. Largest state had 190 variables. [2019-09-10 08:05:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:10,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:10,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:10,868 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:05:10,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:10,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:05:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:11,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:05:11,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:11,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:13,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:05:13,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2019-09-10 08:05:13,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:05:13,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:05:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:05:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:05:13,636 INFO L87 Difference]: Start difference. First operand 149740 states and 181469 transitions. Second operand 23 states. [2019-09-10 08:05:13,789 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:05:17,024 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:05:17,600 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:05:17,800 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:05:18,784 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:05:19,015 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:05:19,185 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:05:19,390 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:05:19,661 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:05:19,898 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:05:20,060 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:05:20,240 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:21,006 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:05:21,179 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:21,360 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:05:21,931 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:05:22,464 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:05:22,995 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:05:23,410 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:05:23,631 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:05:23,807 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:05:23,986 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:05:24,194 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:05:24,367 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:05:24,923 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:05:25,119 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:05:25,294 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:05:25,670 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:26,521 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:26,718 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:05:27,456 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:05:27,748 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:05:27,900 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:05:29,457 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:05:29,915 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:05:30,148 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:05:30,715 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:05:30,930 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:05:31,176 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:05:31,629 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:05:31,911 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:05:32,094 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:05:32,342 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:05:32,595 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:32,898 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:05:33,172 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:33,490 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:05:33,757 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:05:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:38,786 INFO L93 Difference]: Finished difference Result 815821 states and 1001978 transitions. [2019-09-10 08:05:38,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 08:05:38,787 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 229 [2019-09-10 08:05:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:39,814 INFO L225 Difference]: With dead ends: 815821 [2019-09-10 08:05:39,814 INFO L226 Difference]: Without dead ends: 815821 [2019-09-10 08:05:39,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 406 SyntacticMatches, 31 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3863 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2672, Invalid=11134, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 08:05:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815821 states. [2019-09-10 08:05:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815821 to 228086. [2019-09-10 08:05:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228086 states. [2019-09-10 08:05:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228086 states to 228086 states and 274606 transitions. [2019-09-10 08:05:45,847 INFO L78 Accepts]: Start accepts. Automaton has 228086 states and 274606 transitions. Word has length 229 [2019-09-10 08:05:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:45,847 INFO L475 AbstractCegarLoop]: Abstraction has 228086 states and 274606 transitions. [2019-09-10 08:05:45,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:05:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 228086 states and 274606 transitions. [2019-09-10 08:05:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:05:45,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:45,889 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,889 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -631159741, now seen corresponding path program 1 times [2019-09-10 08:05:45,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:45,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:45,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:45,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:46,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:46,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:46,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 08:05:46,400 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [364], [366], [369], [372], [377], [379], [382], [385], [388], [390], [392], [395], [403], [405], [408], [411], [414], [416], [418], [421], [424], [430], [434], [436], [439], [442], [450], [452], [455], [463], [465], [468], [476], [478], [481], [489], [491], [494], [497], [502], [504], [507], [510], [516], [519], [520], [522], [524], [527], [538], [540], [543], [549], [552], [555], [557], [572], [574], [577], [580], [582], [597], [599], [602], [605], [607], [622], [624], [627], [630], [632], [647], [649], [652], [655], [657], [666], [669], [714], [757], [762], [782], [785], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:05:46,405 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:46,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:46,439 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:47,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:47,139 INFO L272 AbstractInterpreter]: Visited 221 different actions 1113 times. Merged at 53 different actions 774 times. Widened at 24 different actions 156 times. Performed 4014 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 95 fixpoints after 19 different actions. Largest state had 190 variables. [2019-09-10 08:05:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:47,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:47,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:47,140 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:05:47,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:47,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:05:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:47,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:05:47,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:47,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:47,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:47,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:48,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:48,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:48,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:48,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:54,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:54,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:05:54,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2019-09-10 08:05:54,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:05:54,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:05:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:05:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:05:54,696 INFO L87 Difference]: Start difference. First operand 228086 states and 274606 transitions. Second operand 22 states. [2019-09-10 08:05:54,851 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:05:58,404 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:05:58,571 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:05:58,981 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:05:59,142 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:05:59,316 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:05:59,501 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:06:00,294 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:06:00,660 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:06:00,831 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:01,233 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:06:01,423 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:01,622 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:06:01,804 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:02,234 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:06:02,457 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:02,789 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:06:03,586 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:04,161 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:06:04,380 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:06:05,307 WARN L188 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 08:06:05,730 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:06:09,417 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-10 08:06:09,624 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:06:10,740 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-09-10 08:06:10,949 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-10 08:06:11,148 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:06:12,096 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:06:12,321 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-09-10 08:06:12,518 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-10 08:06:13,365 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 08:06:13,597 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:06:13,813 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 08:06:14,045 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:06:14,269 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:06:14,464 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 08:06:15,635 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:16,055 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:06:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:23,193 INFO L93 Difference]: Finished difference Result 1571224 states and 1898731 transitions. [2019-09-10 08:06:23,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 08:06:23,194 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 229 [2019-09-10 08:06:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:26,249 INFO L225 Difference]: With dead ends: 1571224 [2019-09-10 08:06:26,249 INFO L226 Difference]: Without dead ends: 1571224 [2019-09-10 08:06:26,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 342 SyntacticMatches, 96 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4531 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=2131, Invalid=8581, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 08:06:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571224 states. [2019-09-10 08:06:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571224 to 339086. [2019-09-10 08:06:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339086 states. [2019-09-10 08:06:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339086 states to 339086 states and 406120 transitions. [2019-09-10 08:06:39,809 INFO L78 Accepts]: Start accepts. Automaton has 339086 states and 406120 transitions. Word has length 229 [2019-09-10 08:06:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:39,809 INFO L475 AbstractCegarLoop]: Abstraction has 339086 states and 406120 transitions. [2019-09-10 08:06:39,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:06:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 339086 states and 406120 transitions. [2019-09-10 08:06:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:06:39,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:39,871 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:39,871 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash 768378414, now seen corresponding path program 1 times [2019-09-10 08:06:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:39,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:39,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:40,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:40,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:06:40,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2019-09-10 08:06:40,361 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [364], [366], [369], [372], [375], [377], [379], [382], [385], [388], [390], [392], [395], [403], [405], [408], [411], [416], [418], [421], [424], [430], [434], [436], [439], [442], [450], [452], [455], [463], [465], [468], [471], [474], [476], [478], [481], [489], [491], [494], [497], [502], [504], [507], [510], [516], [519], [520], [522], [524], [527], [538], [540], [543], [549], [552], [555], [557], [572], [574], [577], [580], [582], [599], [602], [605], [607], [622], [624], [627], [630], [632], [647], [649], [652], [655], [657], [666], [669], [682], [687], [714], [782], [785], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:06:40,365 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:06:40,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:06:40,387 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:06:40,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:06:40,896 INFO L272 AbstractInterpreter]: Visited 222 different actions 894 times. Merged at 54 different actions 582 times. Widened at 20 different actions 95 times. Performed 3171 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3171 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 63 fixpoints after 17 different actions. Largest state had 190 variables. [2019-09-10 08:06:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:40,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:06:40,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:40,896 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:06:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:40,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:06:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:41,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:06:41,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:06:42,790 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-10 08:06:42,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:43,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:06:43,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:46,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:46,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:06:46,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:06:46,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:06:46,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:06:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:06:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:06:46,841 INFO L87 Difference]: Start difference. First operand 339086 states and 406120 transitions. Second operand 21 states. [2019-09-10 08:06:47,035 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:06:47,734 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:06:49,317 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 08:06:49,800 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:06:50,379 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:06:50,726 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:06:51,153 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:06:51,548 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:06:53,864 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 08:06:54,334 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 08:06:54,865 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 08:06:55,218 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 08:06:56,421 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:06:56,772 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:06:57,245 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-09-10 08:06:57,570 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:06:57,985 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:06:58,386 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 08:06:58,776 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:06:59,186 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 08:06:59,884 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-09-10 08:07:04,166 WARN L188 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-10 08:07:04,617 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 08:07:05,450 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:07:05,747 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 08:07:06,132 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-09-10 08:07:06,633 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-09-10 08:07:07,195 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 08:07:07,561 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-10 08:07:09,561 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-10 08:07:10,053 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 08:07:10,462 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-09-10 08:07:10,858 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 08:07:11,305 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:07:11,990 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-10 08:07:12,312 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 08:07:12,601 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 08:07:12,999 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 08:07:13,614 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 08:07:14,214 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-09-10 08:07:14,586 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 08:07:14,909 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:07:15,697 WARN L188 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 08:07:16,106 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:07:16,716 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-10 08:07:17,042 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 08:07:17,667 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-09-10 08:07:18,374 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 08:07:18,882 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 08:07:19,392 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 08:07:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:21,704 INFO L93 Difference]: Finished difference Result 858113 states and 1030939 transitions. [2019-09-10 08:07:21,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 08:07:21,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 230 [2019-09-10 08:07:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:22,745 INFO L225 Difference]: With dead ends: 858113 [2019-09-10 08:07:22,746 INFO L226 Difference]: Without dead ends: 858113 [2019-09-10 08:07:22,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 407 SyntacticMatches, 35 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=1644, Invalid=5328, Unknown=0, NotChecked=0, Total=6972 [2019-09-10 08:07:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858113 states. [2019-09-10 08:07:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858113 to 419659. [2019-09-10 08:07:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419659 states. [2019-09-10 08:07:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419659 states to 419659 states and 501299 transitions. [2019-09-10 08:07:37,718 INFO L78 Accepts]: Start accepts. Automaton has 419659 states and 501299 transitions. Word has length 230 [2019-09-10 08:07:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:37,719 INFO L475 AbstractCegarLoop]: Abstraction has 419659 states and 501299 transitions. [2019-09-10 08:07:37,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:07:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 419659 states and 501299 transitions. [2019-09-10 08:07:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:07:37,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:37,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,802 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2049841806, now seen corresponding path program 1 times [2019-09-10 08:07:37,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:37,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 08:07:37,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:37,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:07:37,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:37,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:07:37,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:07:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:07:37,955 INFO L87 Difference]: Start difference. First operand 419659 states and 501299 transitions. Second operand 6 states. [2019-09-10 08:07:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:39,036 INFO L93 Difference]: Finished difference Result 499785 states and 597466 transitions. [2019-09-10 08:07:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:07:39,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2019-09-10 08:07:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:45,753 INFO L225 Difference]: With dead ends: 499785 [2019-09-10 08:07:45,753 INFO L226 Difference]: Without dead ends: 499737 [2019-09-10 08:07:45,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499737 states. [2019-09-10 08:07:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499737 to 445624. [2019-09-10 08:07:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445624 states. [2019-09-10 08:07:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445624 states to 445624 states and 532713 transitions. [2019-09-10 08:07:50,896 INFO L78 Accepts]: Start accepts. Automaton has 445624 states and 532713 transitions. Word has length 231 [2019-09-10 08:07:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:50,896 INFO L475 AbstractCegarLoop]: Abstraction has 445624 states and 532713 transitions. [2019-09-10 08:07:50,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:07:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 445624 states and 532713 transitions. [2019-09-10 08:07:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:07:52,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:52,102 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:52,102 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash 74540729, now seen corresponding path program 1 times [2019-09-10 08:07:52,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:52,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:52,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:07:52,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:52,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:07:52,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:52,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:07:52,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:07:52,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:07:52,291 INFO L87 Difference]: Start difference. First operand 445624 states and 532713 transitions. Second operand 5 states. [2019-09-10 08:07:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:53,274 INFO L93 Difference]: Finished difference Result 454548 states and 541657 transitions. [2019-09-10 08:07:53,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:07:53,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-10 08:07:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:53,825 INFO L225 Difference]: With dead ends: 454548 [2019-09-10 08:07:53,825 INFO L226 Difference]: Without dead ends: 454548 [2019-09-10 08:07:53,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:08:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454548 states. [2019-09-10 08:08:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454548 to 443064. [2019-09-10 08:08:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443064 states. [2019-09-10 08:08:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443064 states to 443064 states and 529619 transitions. [2019-09-10 08:08:04,859 INFO L78 Accepts]: Start accepts. Automaton has 443064 states and 529619 transitions. Word has length 231 [2019-09-10 08:08:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:04,859 INFO L475 AbstractCegarLoop]: Abstraction has 443064 states and 529619 transitions. [2019-09-10 08:08:04,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:08:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 443064 states and 529619 transitions. [2019-09-10 08:08:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:08:04,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:04,920 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:04,920 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:04,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1066191297, now seen corresponding path program 1 times [2019-09-10 08:08:04,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:04,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:05,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:05,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:05,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2019-09-10 08:08:05,696 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [362], [364], [366], [369], [372], [375], [377], [379], [382], [385], [388], [390], [392], [395], [403], [405], [408], [411], [414], [416], [418], [421], [428], [430], [434], [436], [439], [442], [445], [448], [450], [452], [455], [458], [463], [465], [468], [471], [474], [476], [478], [481], [489], [491], [494], [497], [502], [504], [507], [514], [516], [519], [520], [522], [531], [534], [538], [540], [543], [549], [552], [555], [557], [572], [574], [577], [580], [582], [599], [602], [605], [607], [615], [618], [624], [627], [630], [632], [649], [652], [655], [657], [673], [676], [714], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:08:05,701 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:05,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:05,726 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:06,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:06,234 INFO L272 AbstractInterpreter]: Visited 223 different actions 882 times. Merged at 57 different actions 580 times. Widened at 17 different actions 73 times. Performed 3277 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3277 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 65 fixpoints after 14 different actions. Largest state had 190 variables. [2019-09-10 08:08:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:06,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:06,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:06,234 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:06,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:11,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:08:11,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:11,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:11,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:08:12,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:12,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:08:15,042 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:08:15,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [25] total 45 [2019-09-10 08:08:15,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:15,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:08:15,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:08:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1837, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:08:15,044 INFO L87 Difference]: Start difference. First operand 443064 states and 529619 transitions. Second operand 12 states. [2019-09-10 08:08:15,260 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 08:08:15,963 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:08:16,190 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:08:16,734 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:08:17,023 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:08:17,431 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:08:17,927 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:08:18,349 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:08:18,631 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:08:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:23,477 INFO L93 Difference]: Finished difference Result 1319996 states and 1577606 transitions. [2019-09-10 08:08:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:08:23,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 231 [2019-09-10 08:08:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:26,629 INFO L225 Difference]: With dead ends: 1319996 [2019-09-10 08:08:26,630 INFO L226 Difference]: Without dead ends: 1319996 [2019-09-10 08:08:26,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 411 SyntacticMatches, 32 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=305, Invalid=2557, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:08:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319996 states. [2019-09-10 08:08:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319996 to 443612. [2019-09-10 08:08:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443612 states. [2019-09-10 08:08:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443612 states to 443612 states and 530305 transitions. [2019-09-10 08:08:44,409 INFO L78 Accepts]: Start accepts. Automaton has 443612 states and 530305 transitions. Word has length 231 [2019-09-10 08:08:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:44,410 INFO L475 AbstractCegarLoop]: Abstraction has 443612 states and 530305 transitions. [2019-09-10 08:08:44,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:08:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 443612 states and 530305 transitions. [2019-09-10 08:08:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:08:44,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:44,472 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,472 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash 668589246, now seen corresponding path program 1 times [2019-09-10 08:08:44,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:44,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:46,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:46,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2019-09-10 08:08:46,621 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], [95], [98], [101], [114], [127], [140], [153], [166], [169], [176], [178], [182], [185], [188], [191], [194], [196], [198], [201], [204], [207], [209], [211], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [246], [248], [250], [253], [260], [262], [266], [269], [282], [295], [308], [321], [334], [337], [344], [346], [350], [353], [356], [359], [362], [364], [366], [369], [372], [375], [377], [379], [382], [385], [388], [390], [392], [395], [398], [401], [403], [405], [408], [411], [414], [416], [418], [421], [428], [430], [434], [436], [439], [442], [445], [448], [450], [452], [455], [458], [463], [465], [468], [471], [476], [478], [481], [489], [491], [494], [502], [504], [507], [514], [516], [519], [520], [522], [531], [534], [538], [547], [549], [552], [555], [557], [572], [574], [577], [580], [582], [590], [593], [599], [602], [605], [607], [615], [618], [624], [627], [630], [632], [649], [652], [655], [657], [673], [676], [815], [818], [833], [836], [839], [841], [858], [861], [864], [866], [883], [886], [889], [891], [908], [911], [914], [916], [933], [936], [939], [941], [957], [960], [1099], [1102], [1117], [1120], [1123], [1125], [1142], [1145], [1148], [1150], [1167], [1170], [1173], [1175], [1192], [1195], [1198], [1200], [1217], [1220], [1223], [1225], [1298], [1299], [1303], [1304], [1305] [2019-09-10 08:08:46,623 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:46,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:46,644 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:47,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:47,114 INFO L272 AbstractInterpreter]: Visited 223 different actions 980 times. Merged at 56 different actions 668 times. Widened at 18 different actions 103 times. Performed 3659 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3659 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 80 fixpoints after 17 different actions. Largest state had 190 variables. [2019-09-10 08:08:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:47,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:47,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:47,115 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:47,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:47,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:47,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:08:47,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:47,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:47,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:48,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:00,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:09:00,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 12] total 49 [2019-09-10 08:09:00,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:09:00,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 08:09:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 08:09:00,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2193, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:09:00,874 INFO L87 Difference]: Start difference. First operand 443612 states and 530305 transitions. Second operand 39 states. [2019-09-10 08:09:01,491 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:09:03,286 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-09-10 08:09:03,933 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 117 [2019-09-10 08:09:04,550 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-09-10 08:09:05,282 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 08:09:06,036 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 08:09:06,809 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2019-09-10 08:09:07,279 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 107 [2019-09-10 08:09:07,944 WARN L188 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 113 [2019-09-10 08:09:08,579 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2019-09-10 08:09:09,559 WARN L188 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 114 [2019-09-10 08:09:10,581 WARN L188 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 121 [2019-09-10 08:09:11,302 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2019-09-10 08:09:12,321 WARN L188 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 118 [2019-09-10 08:09:13,539 WARN L188 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 128 [2019-09-10 08:09:14,458 WARN L188 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2019-09-10 08:09:15,047 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 124 [2019-09-10 08:09:17,098 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2019-09-10 08:09:17,706 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-10 08:09:18,501 WARN L188 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2019-09-10 08:09:18,971 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2019-09-10 08:09:19,602 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-09-10 08:09:20,123 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-10 08:09:20,615 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-09-10 08:09:20,952 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-10 08:09:21,811 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2019-09-10 08:09:22,177 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 08:09:23,042 WARN L188 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 111 [2019-09-10 08:09:23,514 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 117 [2019-09-10 08:09:24,126 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-09-10 08:09:24,465 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 08:09:24,788 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2019-09-10 08:09:25,049 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 08:09:25,500 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-09-10 08:09:25,997 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-09-10 08:09:26,424 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-09-10 08:09:27,078 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-09-10 08:09:27,489 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:09:27,783 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 08:09:28,463 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 08:09:28,897 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-09-10 08:09:29,209 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 08:09:29,766 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-09-10 08:09:30,242 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 08:09:30,765 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-09-10 08:09:31,297 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 08:09:32,656 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-09-10 08:09:33,355 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:09:33,828 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 08:09:34,360 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:09:34,680 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-09-10 08:09:35,240 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 08:09:35,473 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:09:36,314 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 08:09:36,652 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:09:37,152 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 08:09:37,577 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-09-10 08:09:38,009 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 08:09:38,724 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-10 08:09:39,119 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 08:09:39,491 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 08:09:40,195 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-09-10 08:09:40,775 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-10 08:09:41,750 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2019-09-10 08:09:42,023 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 08:09:42,438 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-09-10 08:09:42,992 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-09-10 08:09:43,495 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 08:09:44,160 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 107 [2019-09-10 08:09:44,550 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-09-10 08:09:45,577 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2019-09-10 08:09:46,441 WARN L188 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-09-10 08:09:47,335 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-09-10 08:09:47,876 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-09-10 08:09:48,478 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-09-10 08:09:49,168 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-09-10 08:09:49,724 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-09-10 08:09:50,363 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-09-10 08:09:50,968 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 117 [2019-09-10 08:09:51,525 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2019-09-10 08:09:52,623 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-09-10 08:09:53,653 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:09:54,466 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-09-10 08:09:54,980 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-09-10 08:09:55,793 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2019-09-10 08:09:56,076 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:09:56,633 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-09-10 08:09:57,220 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2019-09-10 08:09:57,814 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2019-09-10 08:09:58,406 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-09-10 08:09:59,506 WARN L188 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 126 [2019-09-10 08:09:59,912 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:10:00,564 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 123 [2019-09-10 08:10:01,176 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-09-10 08:10:02,043 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2019-09-10 08:10:02,443 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:10:03,211 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-09-10 08:10:03,922 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 130 [2019-09-10 08:10:04,836 WARN L188 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 114 [2019-09-10 08:10:05,839 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 131 [2019-09-10 08:10:06,702 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 08:10:07,255 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 08:10:08,228 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2019-09-10 08:10:08,931 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-09-10 08:10:09,358 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 08:10:09,800 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 08:10:10,523 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 08:10:10,876 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 08:10:11,567 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-09-10 08:10:12,348 WARN L188 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2019-09-10 08:10:12,910 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2019-09-10 08:10:13,350 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-09-10 08:10:13,840 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:10:14,271 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-10 08:10:14,828 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 08:10:15,279 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:10:15,927 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2019-09-10 08:10:16,365 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 119 [2019-09-10 08:10:16,957 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 129 [2019-09-10 08:10:17,356 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2019-09-10 08:10:17,813 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:10:18,160 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 08:10:19,005 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2019-09-10 08:10:19,579 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2019-09-10 08:10:20,048 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2019-09-10 08:10:20,596 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-09-10 08:10:21,112 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-09-10 08:10:21,696 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-09-10 08:10:22,154 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2019-09-10 08:10:22,526 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-09-10 08:10:23,324 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 125 [2019-09-10 08:10:23,998 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 120 [2019-09-10 08:10:24,875 WARN L188 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2019-09-10 08:10:25,864 WARN L188 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2019-09-10 08:10:26,854 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-09-10 08:10:27,351 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-09-10 08:10:27,839 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:10:28,098 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:10:28,522 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 123 [2019-09-10 08:10:28,977 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-09-10 08:10:29,632 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-09-10 08:10:30,249 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-09-10 08:10:30,647 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:10:30,978 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:10:31,586 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-09-10 08:10:31,982 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-09-10 08:10:32,390 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:10:33,245 WARN L188 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-09-10 08:10:33,765 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-10 08:10:34,119 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2019-09-10 08:10:34,500 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 08:10:34,832 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 08:10:35,588 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-09-10 08:10:36,407 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-09-10 08:10:37,355 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 08:10:38,224 WARN L188 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 08:10:38,788 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-09-10 08:10:39,382 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-09-10 08:10:39,922 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 113 [2019-09-10 08:10:40,336 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-09-10 08:10:40,720 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-09-10 08:10:41,050 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 08:10:41,626 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2019-09-10 08:10:42,171 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:10:42,565 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:10:43,034 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-09-10 08:10:43,398 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 08:10:44,072 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 08:10:44,427 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-09-10 08:10:44,756 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 08:10:45,387 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-09-10 08:10:45,778 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-09-10 08:10:46,345 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-09-10 08:10:46,896 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-09-10 08:10:47,685 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-09-10 08:10:48,590 WARN L188 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2019-09-10 08:10:49,163 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 08:10:49,588 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 08:10:49,877 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 08:10:50,147 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:10:50,784 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-09-10 08:10:51,464 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-10 08:10:52,034 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-09-10 08:10:52,469 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-09-10 08:10:52,957 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-09-10 08:10:53,672 WARN L188 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 114 [2019-09-10 08:10:54,329 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2019-09-10 08:10:54,688 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:10:55,085 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 08:10:55,396 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 08:10:56,022 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:10:56,328 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 08:10:57,359 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2019-09-10 08:10:57,818 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-09-10 08:10:58,400 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2019-09-10 08:10:59,069 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-09-10 08:10:59,478 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-09-10 08:11:00,012 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-09-10 08:11:00,515 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 08:11:01,049 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-09-10 08:11:01,465 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:11:01,891 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:11:02,234 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-09-10 08:11:02,578 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 08:11:02,989 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-09-10 08:11:03,544 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 08:11:04,249 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 114 [2019-09-10 08:11:04,902 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2019-09-10 08:11:05,634 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-09-10 08:11:06,111 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-10 08:11:06,616 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2019-09-10 08:11:07,160 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2019-09-10 08:11:07,742 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 08:11:08,230 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-09-10 08:11:08,860 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-09-10 08:11:09,428 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 08:11:10,090 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2019-09-10 08:11:10,696 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2019-09-10 08:11:11,367 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 08:11:12,003 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 08:11:12,687 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2019-09-10 08:11:13,712 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-09-10 08:11:14,406 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2019-09-10 08:11:14,714 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:11:15,513 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2019-09-10 08:11:16,202 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 123 [2019-09-10 08:11:16,608 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-09-10 08:11:17,065 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 08:11:17,567 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:11:17,880 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:11:18,616 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-09-10 08:11:19,070 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-09-10 08:11:19,697 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-09-10 08:11:20,116 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-09-10 08:11:20,557 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-10 08:11:21,028 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2019-09-10 08:11:21,541 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 08:11:21,910 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 08:11:22,363 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 08:11:22,797 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:11:23,577 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-10 08:11:24,018 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-09-10 08:11:24,553 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-09-10 08:11:25,317 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-09-10 08:11:25,820 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2019-09-10 08:11:26,246 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:11:27,048 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2019-09-10 08:11:27,628 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-09-10 08:11:28,205 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-09-10 08:11:28,717 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-10 08:11:29,147 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 08:11:29,907 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 124 [2019-09-10 08:11:30,824 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-09-10 08:11:31,427 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-09-10 08:11:32,065 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2019-09-10 08:11:32,772 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-09-10 08:11:33,538 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 105 [2019-09-10 08:11:34,186 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 08:11:34,907 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 133 [2019-09-10 08:11:35,599 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-10 08:11:36,458 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 117 [2019-09-10 08:11:37,453 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-09-10 08:11:37,970 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 08:11:38,497 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 08:11:39,399 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 141 [2019-09-10 08:11:39,894 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-09-10 08:11:40,976 WARN L188 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 127 [2019-09-10 08:11:41,435 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2019-09-10 08:11:41,956 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2019-09-10 08:11:42,909 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 116 [2019-09-10 08:11:43,432 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2019-09-10 08:11:43,982 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:11:44,494 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2019-09-10 08:11:45,349 WARN L188 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 123 [2019-09-10 08:11:46,032 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2019-09-10 08:11:46,471 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2019-09-10 08:11:47,290 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2019-09-10 08:11:47,950 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-09-10 08:11:48,473 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-09-10 08:11:49,270 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 111 [2019-09-10 08:11:49,796 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-09-10 08:11:50,191 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:11:50,589 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 08:11:51,445 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2019-09-10 08:11:51,986 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2019-09-10 08:11:52,451 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 08:11:52,842 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:11:53,744 WARN L188 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-09-10 08:11:54,668 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 134 [2019-09-10 08:11:55,088 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-09-10 08:11:55,843 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-09-10 08:11:56,617 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 120 [2019-09-10 08:11:57,380 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 08:11:58,920 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 124 DAG size of output: 118 [2019-09-10 08:11:59,526 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-10 08:12:00,569 WARN L188 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 119 [2019-09-10 08:12:01,004 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-09-10 08:12:01,466 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-09-10 08:12:02,380 WARN L188 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-09-10 08:12:03,028 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 114 [2019-09-10 08:12:03,499 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2019-09-10 08:12:03,944 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:12:04,345 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 08:12:04,875 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-09-10 08:12:05,377 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-09-10 08:12:05,750 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:12:06,284 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-09-10 08:12:08,037 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-09-10 08:12:08,462 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-09-10 08:12:09,045 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 08:12:10,052 WARN L188 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2019-09-10 08:12:10,418 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 08:12:10,812 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 08:12:11,248 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 08:12:11,814 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 08:12:12,509 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 117 [2019-09-10 08:12:13,065 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-09-10 08:12:13,621 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 124 [2019-09-10 08:12:14,080 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2019-09-10 08:12:14,605 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2019-09-10 08:12:15,229 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2019-09-10 08:12:16,057 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 116 [2019-09-10 08:12:16,767 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 08:12:17,530 WARN L188 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 08:12:18,191 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2019-09-10 08:12:18,686 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 105 [2019-09-10 08:12:19,273 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 08:12:20,135 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 125 [2019-09-10 08:12:21,259 WARN L188 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 111 [2019-09-10 08:12:21,905 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 123 [2019-09-10 08:12:24,254 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-09-10 08:12:24,837 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-09-10 08:12:25,393 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 08:12:26,202 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2019-09-10 08:12:27,297 WARN L188 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2019-09-10 08:12:28,454 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 133 [2019-09-10 08:12:29,342 WARN L188 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-10 08:12:29,825 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 08:12:30,697 WARN L188 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 141 [2019-09-10 08:12:31,282 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-09-10 08:12:31,986 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 127 [2019-09-10 08:12:32,502 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2019-09-10 08:12:33,052 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2019-09-10 08:12:33,513 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:12:34,204 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2019-09-10 08:12:35,156 WARN L188 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2019-09-10 08:12:35,645 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2019-09-10 08:12:36,136 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-09-10 08:12:36,650 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-09-10 08:12:37,408 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 117 [2019-09-10 08:12:37,810 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 08:12:38,370 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-09-10 08:12:38,927 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2019-09-10 08:12:39,305 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 08:12:40,189 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 134