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_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:25:00,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:25:00,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:25:00,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:25:00,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:25:00,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:25:00,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:25:00,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:25:00,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:25:00,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:25:00,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:25:00,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:25:00,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:25:00,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:25:00,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:25:00,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:25:00,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:25:00,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:25:00,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:25:00,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:25:00,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:25:00,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:25:00,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:25:00,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:25:00,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:25:00,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:25:00,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:25:00,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:25:00,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:25:00,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:25:00,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:25:00,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:25:00,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:25:00,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:25:00,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:25:00,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:25:00,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:25:00,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:25:00,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:25:00,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:25:00,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:25:00,316 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 06:25:00,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:25:00,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:25:00,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:25:00,334 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:25:00,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:25:00,335 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:25:00,335 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:25:00,336 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:25:00,336 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:25:00,336 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:25:00,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:25:00,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:25:00,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:25:00,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:25:00,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:25:00,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:25:00,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:25:00,338 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:25:00,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:25:00,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:25:00,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:25:00,340 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:25:00,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:25:00,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:25:00,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:25:00,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:25:00,341 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:25:00,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:25:00,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:25:00,342 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:25:00,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:25:00,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:25:00,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:25:00,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:25:00,399 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:25:00,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-10 06:25:00,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd71b76/05d7c7eae3c4473e9515a2993f0316c5/FLAG8a456a1ee [2019-09-10 06:25:01,141 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:25:01,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-10 06:25:01,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd71b76/05d7c7eae3c4473e9515a2993f0316c5/FLAG8a456a1ee [2019-09-10 06:25:01,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67dd71b76/05d7c7eae3c4473e9515a2993f0316c5 [2019-09-10 06:25:01,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:25:01,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:25:01,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:25:01,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:25:01,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:25:01,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:25:01" (1/1) ... [2019-09-10 06:25:01,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300edefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:01, skipping insertion in model container [2019-09-10 06:25:01,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:25:01" (1/1) ... [2019-09-10 06:25:01,335 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:25:01,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:25:02,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:25:02,526 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:25:03,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:25:03,079 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:25:03,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03 WrapperNode [2019-09-10 06:25:03,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:25:03,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:25:03,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:25:03,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:25:03,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (1/1) ... [2019-09-10 06:25:03,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:25:03,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:25:03,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:25:03,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:25:03,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (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 06:25:03,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:25:03,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:25:03,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:25:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:25:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:25:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:25:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:25:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:25:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:25:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:25:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:25:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:25:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:25:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:25:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:25:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:25:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:25:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:25:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:25:06,871 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:25:06,872 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:25:06,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:25:06 BoogieIcfgContainer [2019-09-10 06:25:06,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:25:06,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:25:06,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:25:06,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:25:06,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:25:01" (1/3) ... [2019-09-10 06:25:06,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3e864b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:25:06, skipping insertion in model container [2019-09-10 06:25:06,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:25:03" (2/3) ... [2019-09-10 06:25:06,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3e864b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:25:06, skipping insertion in model container [2019-09-10 06:25:06,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:25:06" (3/3) ... [2019-09-10 06:25:06,890 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-10 06:25:06,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:25:06,933 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:25:06,953 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:25:06,986 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:25:06,986 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:25:06,986 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:25:06,987 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:25:06,987 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:25:06,987 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:25:06,987 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:25:06,987 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:25:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states. [2019-09-10 06:25:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 06:25:07,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:07,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] [2019-09-10 06:25:07,091 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -613597225, now seen corresponding path program 1 times [2019-09-10 06:25:07,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:07,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:07,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:07,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:07,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:07,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:07,752 INFO L87 Difference]: Start difference. First operand 1078 states. Second operand 4 states. [2019-09-10 06:25:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:08,054 INFO L93 Difference]: Finished difference Result 1084 states and 1880 transitions. [2019-09-10 06:25:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:25:08,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-10 06:25:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:08,089 INFO L225 Difference]: With dead ends: 1084 [2019-09-10 06:25:08,089 INFO L226 Difference]: Without dead ends: 1074 [2019-09-10 06:25:08,093 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 06:25:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-09-10 06:25:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2019-09-10 06:25:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-09-10 06:25:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1817 transitions. [2019-09-10 06:25:08,226 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1817 transitions. Word has length 160 [2019-09-10 06:25:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:08,227 INFO L475 AbstractCegarLoop]: Abstraction has 1074 states and 1817 transitions. [2019-09-10 06:25:08,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1817 transitions. [2019-09-10 06:25:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 06:25:08,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:08,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:08,237 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1016669195, now seen corresponding path program 1 times [2019-09-10 06:25:08,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:08,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:08,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:08,667 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 06:25:08,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:08,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:08,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:08,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:08,670 INFO L87 Difference]: Start difference. First operand 1074 states and 1817 transitions. Second operand 3 states. [2019-09-10 06:25:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:08,897 INFO L93 Difference]: Finished difference Result 1858 states and 3108 transitions. [2019-09-10 06:25:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:08,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 06:25:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:08,908 INFO L225 Difference]: With dead ends: 1858 [2019-09-10 06:25:08,908 INFO L226 Difference]: Without dead ends: 1858 [2019-09-10 06:25:08,909 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 06:25:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2019-09-10 06:25:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1854. [2019-09-10 06:25:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-09-10 06:25:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 3106 transitions. [2019-09-10 06:25:08,954 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 3106 transitions. Word has length 201 [2019-09-10 06:25:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:08,954 INFO L475 AbstractCegarLoop]: Abstraction has 1854 states and 3106 transitions. [2019-09-10 06:25:08,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 3106 transitions. [2019-09-10 06:25:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 06:25:08,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:08,961 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, 1, 1, 1] [2019-09-10 06:25:08,961 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash 277876415, now seen corresponding path program 1 times [2019-09-10 06:25:08,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:08,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:08,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:09,098 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 06:25:09,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:09,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:09,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:09,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:09,101 INFO L87 Difference]: Start difference. First operand 1854 states and 3106 transitions. Second operand 3 states. [2019-09-10 06:25:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:09,245 INFO L93 Difference]: Finished difference Result 2227 states and 3738 transitions. [2019-09-10 06:25:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:09,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 06:25:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:09,265 INFO L225 Difference]: With dead ends: 2227 [2019-09-10 06:25:09,265 INFO L226 Difference]: Without dead ends: 2227 [2019-09-10 06:25:09,266 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 06:25:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-09-10 06:25:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2223. [2019-09-10 06:25:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-10 06:25:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3736 transitions. [2019-09-10 06:25:09,349 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3736 transitions. Word has length 204 [2019-09-10 06:25:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:09,350 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3736 transitions. [2019-09-10 06:25:09,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3736 transitions. [2019-09-10 06:25:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 06:25:09,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:09,360 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:09,361 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash 952115744, now seen corresponding path program 1 times [2019-09-10 06:25:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:09,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:09,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:09,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:09,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:09,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:09,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:09,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:09,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:09,609 INFO L87 Difference]: Start difference. First operand 2223 states and 3736 transitions. Second operand 3 states. [2019-09-10 06:25:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:09,798 INFO L93 Difference]: Finished difference Result 4053 states and 6777 transitions. [2019-09-10 06:25:09,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:09,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-10 06:25:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:09,820 INFO L225 Difference]: With dead ends: 4053 [2019-09-10 06:25:09,820 INFO L226 Difference]: Without dead ends: 4053 [2019-09-10 06:25:09,821 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 06:25:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2019-09-10 06:25:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4049. [2019-09-10 06:25:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-09-10 06:25:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 6775 transitions. [2019-09-10 06:25:09,932 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 6775 transitions. Word has length 207 [2019-09-10 06:25:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:09,933 INFO L475 AbstractCegarLoop]: Abstraction has 4049 states and 6775 transitions. [2019-09-10 06:25:09,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 6775 transitions. [2019-09-10 06:25:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 06:25:09,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:09,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:09,944 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash 17667418, now seen corresponding path program 1 times [2019-09-10 06:25:09,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:09,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:09,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:10,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:10,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:10,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:10,087 INFO L87 Difference]: Start difference. First operand 4049 states and 6775 transitions. Second operand 3 states. [2019-09-10 06:25:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:10,212 INFO L93 Difference]: Finished difference Result 5163 states and 8647 transitions. [2019-09-10 06:25:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:10,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-10 06:25:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:10,241 INFO L225 Difference]: With dead ends: 5163 [2019-09-10 06:25:10,242 INFO L226 Difference]: Without dead ends: 5163 [2019-09-10 06:25:10,242 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 06:25:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-09-10 06:25:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 5159. [2019-09-10 06:25:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-09-10 06:25:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 8645 transitions. [2019-09-10 06:25:10,389 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 8645 transitions. Word has length 210 [2019-09-10 06:25:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:10,390 INFO L475 AbstractCegarLoop]: Abstraction has 5159 states and 8645 transitions. [2019-09-10 06:25:10,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 8645 transitions. [2019-09-10 06:25:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 06:25:10,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:10,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:10,403 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1580390183, now seen corresponding path program 1 times [2019-09-10 06:25:10,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:10,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:10,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:10,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:10,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:10,591 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 06:25:10,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:10,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:10,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:10,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:10,595 INFO L87 Difference]: Start difference. First operand 5159 states and 8645 transitions. Second operand 3 states. [2019-09-10 06:25:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:10,775 INFO L93 Difference]: Finished difference Result 9619 states and 15992 transitions. [2019-09-10 06:25:10,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:10,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-10 06:25:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:10,849 INFO L225 Difference]: With dead ends: 9619 [2019-09-10 06:25:10,850 INFO L226 Difference]: Without dead ends: 9619 [2019-09-10 06:25:10,850 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 06:25:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9619 states. [2019-09-10 06:25:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9619 to 9615. [2019-09-10 06:25:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-09-10 06:25:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 15990 transitions. [2019-09-10 06:25:11,174 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 15990 transitions. Word has length 213 [2019-09-10 06:25:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:11,174 INFO L475 AbstractCegarLoop]: Abstraction has 9615 states and 15990 transitions. [2019-09-10 06:25:11,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 15990 transitions. [2019-09-10 06:25:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:25:11,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:11,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:11,204 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:11,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1696038503, now seen corresponding path program 1 times [2019-09-10 06:25:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:11,384 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 06:25:11,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:11,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:11,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:11,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:11,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:11,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:11,387 INFO L87 Difference]: Start difference. First operand 9615 states and 15990 transitions. Second operand 3 states. [2019-09-10 06:25:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:11,522 INFO L93 Difference]: Finished difference Result 12505 states and 20800 transitions. [2019-09-10 06:25:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:11,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:25:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:11,566 INFO L225 Difference]: With dead ends: 12505 [2019-09-10 06:25:11,566 INFO L226 Difference]: Without dead ends: 12505 [2019-09-10 06:25:11,567 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 06:25:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2019-09-10 06:25:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12501. [2019-09-10 06:25:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12501 states. [2019-09-10 06:25:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 20798 transitions. [2019-09-10 06:25:11,863 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 20798 transitions. Word has length 216 [2019-09-10 06:25:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:11,863 INFO L475 AbstractCegarLoop]: Abstraction has 12501 states and 20798 transitions. [2019-09-10 06:25:11,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 20798 transitions. [2019-09-10 06:25:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 06:25:11,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:11,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:11,889 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash -240031560, now seen corresponding path program 1 times [2019-09-10 06:25:11,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:11,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:12,143 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 06:25:12,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:12,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:12,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:12,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:12,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:12,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:12,145 INFO L87 Difference]: Start difference. First operand 12501 states and 20798 transitions. Second operand 3 states. [2019-09-10 06:25:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:12,333 INFO L93 Difference]: Finished difference Result 23439 states and 38579 transitions. [2019-09-10 06:25:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:12,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-10 06:25:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:12,391 INFO L225 Difference]: With dead ends: 23439 [2019-09-10 06:25:12,391 INFO L226 Difference]: Without dead ends: 23439 [2019-09-10 06:25:12,391 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 06:25:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23439 states. [2019-09-10 06:25:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23439 to 23435. [2019-09-10 06:25:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23435 states. [2019-09-10 06:25:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23435 states to 23435 states and 38577 transitions. [2019-09-10 06:25:12,835 INFO L78 Accepts]: Start accepts. Automaton has 23435 states and 38577 transitions. Word has length 219 [2019-09-10 06:25:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:12,835 INFO L475 AbstractCegarLoop]: Abstraction has 23435 states and 38577 transitions. [2019-09-10 06:25:12,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 23435 states and 38577 transitions. [2019-09-10 06:25:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 06:25:12,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:12,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:12,879 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash 236932990, now seen corresponding path program 1 times [2019-09-10 06:25:12,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:13,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:13,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:13,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:13,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:13,043 INFO L87 Difference]: Start difference. First operand 23435 states and 38577 transitions. Second operand 3 states. [2019-09-10 06:25:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:13,234 INFO L93 Difference]: Finished difference Result 30363 states and 49917 transitions. [2019-09-10 06:25:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:13,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-10 06:25:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:13,318 INFO L225 Difference]: With dead ends: 30363 [2019-09-10 06:25:13,318 INFO L226 Difference]: Without dead ends: 30363 [2019-09-10 06:25:13,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30363 states. [2019-09-10 06:25:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30359. [2019-09-10 06:25:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30359 states. [2019-09-10 06:25:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30359 states to 30359 states and 49915 transitions. [2019-09-10 06:25:14,717 INFO L78 Accepts]: Start accepts. Automaton has 30359 states and 49915 transitions. Word has length 222 [2019-09-10 06:25:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:14,717 INFO L475 AbstractCegarLoop]: Abstraction has 30359 states and 49915 transitions. [2019-09-10 06:25:14,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30359 states and 49915 transitions. [2019-09-10 06:25:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 06:25:14,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:14,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:14,761 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1518995773, now seen corresponding path program 1 times [2019-09-10 06:25:14,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:14,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:14,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:15,195 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 06:25:15,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:15,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:25:15,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:15,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:25:15,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:25:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:25:15,198 INFO L87 Difference]: Start difference. First operand 30359 states and 49915 transitions. Second operand 6 states. [2019-09-10 06:25:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:17,307 INFO L93 Difference]: Finished difference Result 153184 states and 252975 transitions. [2019-09-10 06:25:17,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:25:17,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 06:25:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:17,826 INFO L225 Difference]: With dead ends: 153184 [2019-09-10 06:25:17,826 INFO L226 Difference]: Without dead ends: 153184 [2019-09-10 06:25:17,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 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 06:25:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153184 states. [2019-09-10 06:25:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153184 to 59846. [2019-09-10 06:25:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59846 states. [2019-09-10 06:25:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59846 states to 59846 states and 97749 transitions. [2019-09-10 06:25:21,018 INFO L78 Accepts]: Start accepts. Automaton has 59846 states and 97749 transitions. Word has length 225 [2019-09-10 06:25:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:21,019 INFO L475 AbstractCegarLoop]: Abstraction has 59846 states and 97749 transitions. [2019-09-10 06:25:21,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:25:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 59846 states and 97749 transitions. [2019-09-10 06:25:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 06:25:21,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:21,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:21,077 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1749580756, now seen corresponding path program 1 times [2019-09-10 06:25:21,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:21,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:21,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:21,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:21,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:21,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:21,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:21,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:21,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:21,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:21,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:21,359 INFO L87 Difference]: Start difference. First operand 59846 states and 97749 transitions. Second operand 4 states. [2019-09-10 06:25:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:22,215 INFO L93 Difference]: Finished difference Result 117671 states and 193195 transitions. [2019-09-10 06:25:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:22,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-09-10 06:25:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:22,458 INFO L225 Difference]: With dead ends: 117671 [2019-09-10 06:25:22,458 INFO L226 Difference]: Without dead ends: 117671 [2019-09-10 06:25:22,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117671 states. [2019-09-10 06:25:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117671 to 98125. [2019-09-10 06:25:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98125 states. [2019-09-10 06:25:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98125 states to 98125 states and 160415 transitions. [2019-09-10 06:25:25,454 INFO L78 Accepts]: Start accepts. Automaton has 98125 states and 160415 transitions. Word has length 227 [2019-09-10 06:25:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:25,455 INFO L475 AbstractCegarLoop]: Abstraction has 98125 states and 160415 transitions. [2019-09-10 06:25:25,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 98125 states and 160415 transitions. [2019-09-10 06:25:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 06:25:25,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:25,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:25,535 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash 567593889, now seen corresponding path program 1 times [2019-09-10 06:25:25,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:25,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:25,693 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 06:25:25,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:25,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:25,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:25,695 INFO L87 Difference]: Start difference. First operand 98125 states and 160415 transitions. Second operand 4 states. [2019-09-10 06:25:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:26,434 INFO L93 Difference]: Finished difference Result 189331 states and 309287 transitions. [2019-09-10 06:25:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:26,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-10 06:25:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:26,655 INFO L225 Difference]: With dead ends: 189331 [2019-09-10 06:25:26,656 INFO L226 Difference]: Without dead ends: 189331 [2019-09-10 06:25:26,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 06:25:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189331 states. [2019-09-10 06:25:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189331 to 159443. [2019-09-10 06:25:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159443 states. [2019-09-10 06:25:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159443 states to 159443 states and 259641 transitions. [2019-09-10 06:25:30,866 INFO L78 Accepts]: Start accepts. Automaton has 159443 states and 259641 transitions. Word has length 228 [2019-09-10 06:25:30,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:30,866 INFO L475 AbstractCegarLoop]: Abstraction has 159443 states and 259641 transitions. [2019-09-10 06:25:30,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 159443 states and 259641 transitions. [2019-09-10 06:25:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:25:31,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:31,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:31,001 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1511413883, now seen corresponding path program 1 times [2019-09-10 06:25:31,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:31,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:31,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:31,147 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 06:25:31,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:31,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:31,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:31,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:31,149 INFO L87 Difference]: Start difference. First operand 159443 states and 259641 transitions. Second operand 4 states. [2019-09-10 06:25:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:32,078 INFO L93 Difference]: Finished difference Result 302531 states and 492283 transitions. [2019-09-10 06:25:32,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:32,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 06:25:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:32,476 INFO L225 Difference]: With dead ends: 302531 [2019-09-10 06:25:32,476 INFO L226 Difference]: Without dead ends: 302531 [2019-09-10 06:25:32,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 06:25:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302531 states. [2019-09-10 06:25:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302531 to 256589. [2019-09-10 06:25:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256589 states. [2019-09-10 06:25:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256589 states to 256589 states and 416159 transitions. [2019-09-10 06:25:39,644 INFO L78 Accepts]: Start accepts. Automaton has 256589 states and 416159 transitions. Word has length 229 [2019-09-10 06:25:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:39,644 INFO L475 AbstractCegarLoop]: Abstraction has 256589 states and 416159 transitions. [2019-09-10 06:25:39,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 256589 states and 416159 transitions. [2019-09-10 06:25:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:25:39,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:39,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:39,814 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -364230168, now seen corresponding path program 1 times [2019-09-10 06:25:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:39,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:40,061 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 06:25:40,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:40,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:25:40,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:40,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:25:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:25:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:25:40,066 INFO L87 Difference]: Start difference. First operand 256589 states and 416159 transitions. Second operand 7 states. [2019-09-10 06:25:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:48,401 INFO L93 Difference]: Finished difference Result 911401 states and 1473390 transitions. [2019-09-10 06:25:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:25:48,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2019-09-10 06:25:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:49,689 INFO L225 Difference]: With dead ends: 911401 [2019-09-10 06:25:49,690 INFO L226 Difference]: Without dead ends: 911401 [2019-09-10 06:25:49,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:25:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911401 states. [2019-09-10 06:26:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911401 to 663062. [2019-09-10 06:26:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663062 states. [2019-09-10 06:26:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663062 states to 663062 states and 1065947 transitions. [2019-09-10 06:26:18,370 INFO L78 Accepts]: Start accepts. Automaton has 663062 states and 1065947 transitions. Word has length 230 [2019-09-10 06:26:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:18,371 INFO L475 AbstractCegarLoop]: Abstraction has 663062 states and 1065947 transitions. [2019-09-10 06:26:18,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:26:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 663062 states and 1065947 transitions. [2019-09-10 06:26:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 06:26:18,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:18,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:18,803 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2078598738, now seen corresponding path program 1 times [2019-09-10 06:26:18,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:18,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:19,081 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 06:26:19,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:19,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:19,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:19,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:19,083 INFO L87 Difference]: Start difference. First operand 663062 states and 1065947 transitions. Second operand 3 states. [2019-09-10 06:26:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:21,978 INFO L93 Difference]: Finished difference Result 325335 states and 526867 transitions. [2019-09-10 06:26:21,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:21,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-10 06:26:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:22,385 INFO L225 Difference]: With dead ends: 325335 [2019-09-10 06:26:22,386 INFO L226 Difference]: Without dead ends: 325335 [2019-09-10 06:26:22,386 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 06:26:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325335 states. [2019-09-10 06:26:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325335 to 325333. [2019-09-10 06:26:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325333 states. [2019-09-10 06:26:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325333 states to 325333 states and 526866 transitions. [2019-09-10 06:26:33,866 INFO L78 Accepts]: Start accepts. Automaton has 325333 states and 526866 transitions. Word has length 232 [2019-09-10 06:26:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:33,866 INFO L475 AbstractCegarLoop]: Abstraction has 325333 states and 526866 transitions. [2019-09-10 06:26:33,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 325333 states and 526866 transitions. [2019-09-10 06:26:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:26:35,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:35,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:35,102 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash 91813434, now seen corresponding path program 1 times [2019-09-10 06:26:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:35,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:35,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:35,300 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 06:26:35,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:35,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:35,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:35,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:35,302 INFO L87 Difference]: Start difference. First operand 325333 states and 526866 transitions. Second operand 3 states. [2019-09-10 06:26:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:35,612 INFO L93 Difference]: Finished difference Result 132164 states and 214158 transitions. [2019-09-10 06:26:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:35,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 06:26:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:35,751 INFO L225 Difference]: With dead ends: 132164 [2019-09-10 06:26:35,752 INFO L226 Difference]: Without dead ends: 132164 [2019-09-10 06:26:35,752 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 06:26:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132164 states. [2019-09-10 06:26:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132164 to 132162. [2019-09-10 06:26:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132162 states. [2019-09-10 06:26:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132162 states to 132162 states and 214157 transitions. [2019-09-10 06:26:41,450 INFO L78 Accepts]: Start accepts. Automaton has 132162 states and 214157 transitions. Word has length 238 [2019-09-10 06:26:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:41,450 INFO L475 AbstractCegarLoop]: Abstraction has 132162 states and 214157 transitions. [2019-09-10 06:26:41,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 132162 states and 214157 transitions. [2019-09-10 06:26:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 06:26:41,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:41,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:41,545 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash -169996818, now seen corresponding path program 1 times [2019-09-10 06:26:41,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:41,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:41,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:41,807 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 06:26:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:41,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:41,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:41,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:41,809 INFO L87 Difference]: Start difference. First operand 132162 states and 214157 transitions. Second operand 3 states. [2019-09-10 06:26:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:42,419 INFO L93 Difference]: Finished difference Result 57713 states and 93139 transitions. [2019-09-10 06:26:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:42,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-10 06:26:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:42,492 INFO L225 Difference]: With dead ends: 57713 [2019-09-10 06:26:42,492 INFO L226 Difference]: Without dead ends: 57713 [2019-09-10 06:26:42,493 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 06:26:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57713 states. [2019-09-10 06:26:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57713 to 57711. [2019-09-10 06:26:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57711 states. [2019-09-10 06:26:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57711 states to 57711 states and 93138 transitions. [2019-09-10 06:26:43,041 INFO L78 Accepts]: Start accepts. Automaton has 57711 states and 93138 transitions. Word has length 244 [2019-09-10 06:26:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:43,041 INFO L475 AbstractCegarLoop]: Abstraction has 57711 states and 93138 transitions. [2019-09-10 06:26:43,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57711 states and 93138 transitions. [2019-09-10 06:26:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 06:26:43,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:43,072 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:43,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1356364358, now seen corresponding path program 1 times [2019-09-10 06:26:43,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:43,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:43,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:43,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:43,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:43,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 06:26:43,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:43,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:43,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:43,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:43,471 INFO L87 Difference]: Start difference. First operand 57711 states and 93138 transitions. Second operand 4 states. [2019-09-10 06:26:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:43,670 INFO L93 Difference]: Finished difference Result 49718 states and 80195 transitions. [2019-09-10 06:26:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:43,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-10 06:26:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:43,735 INFO L225 Difference]: With dead ends: 49718 [2019-09-10 06:26:43,735 INFO L226 Difference]: Without dead ends: 49718 [2019-09-10 06:26:43,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49718 states. [2019-09-10 06:26:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49718 to 49718. [2019-09-10 06:26:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49718 states. [2019-09-10 06:26:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49718 states to 49718 states and 80195 transitions. [2019-09-10 06:26:44,835 INFO L78 Accepts]: Start accepts. Automaton has 49718 states and 80195 transitions. Word has length 250 [2019-09-10 06:26:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:44,835 INFO L475 AbstractCegarLoop]: Abstraction has 49718 states and 80195 transitions. [2019-09-10 06:26:44,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 49718 states and 80195 transitions. [2019-09-10 06:26:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 06:26:44,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:44,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:44,863 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash -458841138, now seen corresponding path program 1 times [2019-09-10 06:26:44,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:44,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:44,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:45,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:45,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:45,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:45,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:45,103 INFO L87 Difference]: Start difference. First operand 49718 states and 80195 transitions. Second operand 3 states. [2019-09-10 06:26:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:45,191 INFO L93 Difference]: Finished difference Result 20314 states and 32743 transitions. [2019-09-10 06:26:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:45,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 06:26:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:45,216 INFO L225 Difference]: With dead ends: 20314 [2019-09-10 06:26:45,216 INFO L226 Difference]: Without dead ends: 20314 [2019-09-10 06:26:45,217 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 06:26:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20314 states. [2019-09-10 06:26:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20314 to 20312. [2019-09-10 06:26:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20312 states. [2019-09-10 06:26:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20312 states to 20312 states and 32742 transitions. [2019-09-10 06:26:45,494 INFO L78 Accepts]: Start accepts. Automaton has 20312 states and 32742 transitions. Word has length 253 [2019-09-10 06:26:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:45,494 INFO L475 AbstractCegarLoop]: Abstraction has 20312 states and 32742 transitions. [2019-09-10 06:26:45,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20312 states and 32742 transitions. [2019-09-10 06:26:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 06:26:45,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:45,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:45,512 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1177906378, now seen corresponding path program 1 times [2019-09-10 06:26:45,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:45,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:45,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:45,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:45,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:46,145 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 06:26:46,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:46,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:46,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:46,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:46,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:46,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:46,147 INFO L87 Difference]: Start difference. First operand 20312 states and 32742 transitions. Second operand 4 states. [2019-09-10 06:26:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:46,240 INFO L93 Difference]: Finished difference Result 17722 states and 28585 transitions. [2019-09-10 06:26:46,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:46,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-10 06:26:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:46,264 INFO L225 Difference]: With dead ends: 17722 [2019-09-10 06:26:46,265 INFO L226 Difference]: Without dead ends: 17722 [2019-09-10 06:26:46,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17722 states. [2019-09-10 06:26:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17722 to 17722. [2019-09-10 06:26:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17722 states. [2019-09-10 06:26:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17722 states to 17722 states and 28585 transitions. [2019-09-10 06:26:46,472 INFO L78 Accepts]: Start accepts. Automaton has 17722 states and 28585 transitions. Word has length 259 [2019-09-10 06:26:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:46,473 INFO L475 AbstractCegarLoop]: Abstraction has 17722 states and 28585 transitions. [2019-09-10 06:26:46,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 17722 states and 28585 transitions. [2019-09-10 06:26:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 06:26:46,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:46,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:46,483 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:46,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash 281434320, now seen corresponding path program 1 times [2019-09-10 06:26:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:46,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:46,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:46,922 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 06:26:46,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:26:46,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:46,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:26:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:26:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:26:46,924 INFO L87 Difference]: Start difference. First operand 17722 states and 28585 transitions. Second operand 6 states. [2019-09-10 06:26:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:47,531 INFO L93 Difference]: Finished difference Result 24767 states and 39984 transitions. [2019-09-10 06:26:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:26:47,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-09-10 06:26:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:47,558 INFO L225 Difference]: With dead ends: 24767 [2019-09-10 06:26:47,559 INFO L226 Difference]: Without dead ends: 24767 [2019-09-10 06:26:47,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:26:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-09-10 06:26:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 17722. [2019-09-10 06:26:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17722 states. [2019-09-10 06:26:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17722 states to 17722 states and 28496 transitions. [2019-09-10 06:26:47,772 INFO L78 Accepts]: Start accepts. Automaton has 17722 states and 28496 transitions. Word has length 262 [2019-09-10 06:26:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:47,773 INFO L475 AbstractCegarLoop]: Abstraction has 17722 states and 28496 transitions. [2019-09-10 06:26:47,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:26:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17722 states and 28496 transitions. [2019-09-10 06:26:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 06:26:47,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:47,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:47,782 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1128256860, now seen corresponding path program 1 times [2019-09-10 06:26:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:47,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:48,039 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 06:26:48,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:48,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:26:48,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:48,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:26:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:26:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:48,041 INFO L87 Difference]: Start difference. First operand 17722 states and 28496 transitions. Second operand 5 states. [2019-09-10 06:26:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:48,713 INFO L93 Difference]: Finished difference Result 28503 states and 46043 transitions. [2019-09-10 06:26:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:26:48,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265 [2019-09-10 06:26:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:48,750 INFO L225 Difference]: With dead ends: 28503 [2019-09-10 06:26:48,750 INFO L226 Difference]: Without dead ends: 28503 [2019-09-10 06:26:48,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:26:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28503 states. [2019-09-10 06:26:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28503 to 28495. [2019-09-10 06:26:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28495 states. [2019-09-10 06:26:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28495 states to 28495 states and 46039 transitions. [2019-09-10 06:26:49,056 INFO L78 Accepts]: Start accepts. Automaton has 28495 states and 46039 transitions. Word has length 265 [2019-09-10 06:26:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:49,056 INFO L475 AbstractCegarLoop]: Abstraction has 28495 states and 46039 transitions. [2019-09-10 06:26:49,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:26:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 28495 states and 46039 transitions. [2019-09-10 06:26:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 06:26:49,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:49,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:49,070 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash -905871944, now seen corresponding path program 1 times [2019-09-10 06:26:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:49,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:49,398 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 06:26:49,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:49,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:26:49,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:49,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:26:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:26:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:26:49,400 INFO L87 Difference]: Start difference. First operand 28495 states and 46039 transitions. Second operand 6 states. [2019-09-10 06:26:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:49,923 INFO L93 Difference]: Finished difference Result 57311 states and 92498 transitions. [2019-09-10 06:26:49,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:26:49,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2019-09-10 06:26:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:49,984 INFO L225 Difference]: With dead ends: 57311 [2019-09-10 06:26:49,984 INFO L226 Difference]: Without dead ends: 57311 [2019-09-10 06:26:49,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:26:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57311 states. [2019-09-10 06:26:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57311 to 57303. [2019-09-10 06:26:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57303 states. [2019-09-10 06:26:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57303 states to 57303 states and 92494 transitions. [2019-09-10 06:26:50,791 INFO L78 Accepts]: Start accepts. Automaton has 57303 states and 92494 transitions. Word has length 265 [2019-09-10 06:26:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:50,791 INFO L475 AbstractCegarLoop]: Abstraction has 57303 states and 92494 transitions. [2019-09-10 06:26:50,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:26:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 57303 states and 92494 transitions. [2019-09-10 06:26:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 06:26:50,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:50,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:50,818 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1166167999, now seen corresponding path program 1 times [2019-09-10 06:26:50,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:50,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:51,105 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 06:26:51,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:51,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:51,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:51,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:51,108 INFO L87 Difference]: Start difference. First operand 57303 states and 92494 transitions. Second operand 4 states. [2019-09-10 06:26:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:51,268 INFO L93 Difference]: Finished difference Result 53192 states and 85879 transitions. [2019-09-10 06:26:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:51,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-09-10 06:26:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:51,322 INFO L225 Difference]: With dead ends: 53192 [2019-09-10 06:26:51,322 INFO L226 Difference]: Without dead ends: 53192 [2019-09-10 06:26:51,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53192 states. [2019-09-10 06:26:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53192 to 53192. [2019-09-10 06:26:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53192 states. [2019-09-10 06:26:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53192 states to 53192 states and 85879 transitions. [2019-09-10 06:26:52,158 INFO L78 Accepts]: Start accepts. Automaton has 53192 states and 85879 transitions. Word has length 266 [2019-09-10 06:26:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:52,158 INFO L475 AbstractCegarLoop]: Abstraction has 53192 states and 85879 transitions. [2019-09-10 06:26:52,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53192 states and 85879 transitions. [2019-09-10 06:26:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-10 06:26:52,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:52,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:52,183 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:52,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1679455338, now seen corresponding path program 1 times [2019-09-10 06:26:52,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:52,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:52,454 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 06:26:52,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:52,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:26:52,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:52,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:26:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:26:52,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:26:52,456 INFO L87 Difference]: Start difference. First operand 53192 states and 85879 transitions. Second operand 9 states. [2019-09-10 06:26:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:56,774 INFO L93 Difference]: Finished difference Result 305269 states and 494907 transitions. [2019-09-10 06:26:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:26:56,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 272 [2019-09-10 06:26:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:57,216 INFO L225 Difference]: With dead ends: 305269 [2019-09-10 06:26:57,216 INFO L226 Difference]: Without dead ends: 305269 [2019-09-10 06:26:57,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:26:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305269 states. [2019-09-10 06:27:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305269 to 302936. [2019-09-10 06:27:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302936 states. [2019-09-10 06:27:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302936 states to 302936 states and 490956 transitions. [2019-09-10 06:27:03,429 INFO L78 Accepts]: Start accepts. Automaton has 302936 states and 490956 transitions. Word has length 272 [2019-09-10 06:27:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:03,430 INFO L475 AbstractCegarLoop]: Abstraction has 302936 states and 490956 transitions. [2019-09-10 06:27:03,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:27:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 302936 states and 490956 transitions. [2019-09-10 06:27:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-10 06:27:03,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:03,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:03,571 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash 405955967, now seen corresponding path program 1 times [2019-09-10 06:27:03,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:03,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:03,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:03,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:03,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:03,713 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 06:27:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:03,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:03,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:03,715 INFO L87 Difference]: Start difference. First operand 302936 states and 490956 transitions. Second operand 3 states. [2019-09-10 06:27:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:06,031 INFO L93 Difference]: Finished difference Result 359379 states and 572715 transitions. [2019-09-10 06:27:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:06,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-10 06:27:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:06,513 INFO L225 Difference]: With dead ends: 359379 [2019-09-10 06:27:06,513 INFO L226 Difference]: Without dead ends: 359379 [2019-09-10 06:27:06,513 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 06:27:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359379 states. [2019-09-10 06:27:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359379 to 354857. [2019-09-10 06:27:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354857 states. [2019-09-10 06:27:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354857 states to 354857 states and 567297 transitions. [2019-09-10 06:27:13,955 INFO L78 Accepts]: Start accepts. Automaton has 354857 states and 567297 transitions. Word has length 282 [2019-09-10 06:27:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:13,956 INFO L475 AbstractCegarLoop]: Abstraction has 354857 states and 567297 transitions. [2019-09-10 06:27:13,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 354857 states and 567297 transitions. [2019-09-10 06:27:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-10 06:27:15,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:15,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:15,603 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash -873207398, now seen corresponding path program 1 times [2019-09-10 06:27:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:15,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:15,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:15,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:15,908 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 06:27:15,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:15,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:27:15,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:15,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:27:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:27:15,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:27:15,910 INFO L87 Difference]: Start difference. First operand 354857 states and 567297 transitions. Second operand 6 states. [2019-09-10 06:27:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:17,406 INFO L93 Difference]: Finished difference Result 450871 states and 721561 transitions. [2019-09-10 06:27:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:27:17,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2019-09-10 06:27:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:19,316 INFO L225 Difference]: With dead ends: 450871 [2019-09-10 06:27:19,316 INFO L226 Difference]: Without dead ends: 450871 [2019-09-10 06:27:19,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:27:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450871 states. [2019-09-10 06:27:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450871 to 414352. [2019-09-10 06:27:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414352 states. [2019-09-10 06:27:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414352 states to 414352 states and 662422 transitions. [2019-09-10 06:27:32,125 INFO L78 Accepts]: Start accepts. Automaton has 414352 states and 662422 transitions. Word has length 283 [2019-09-10 06:27:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:32,125 INFO L475 AbstractCegarLoop]: Abstraction has 414352 states and 662422 transitions. [2019-09-10 06:27:32,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:27:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 414352 states and 662422 transitions. [2019-09-10 06:27:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-10 06:27:32,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:32,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:32,200 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 219415174, now seen corresponding path program 1 times [2019-09-10 06:27:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:32,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:32,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:32,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:32,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:27:32,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:32,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:27:32,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:27:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:27:32,531 INFO L87 Difference]: Start difference. First operand 414352 states and 662422 transitions. Second operand 6 states. [2019-09-10 06:27:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:40,176 INFO L93 Difference]: Finished difference Result 652489 states and 1045325 transitions. [2019-09-10 06:27:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:27:40,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2019-09-10 06:27:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:41,126 INFO L225 Difference]: With dead ends: 652489 [2019-09-10 06:27:41,126 INFO L226 Difference]: Without dead ends: 652489 [2019-09-10 06:27:41,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:27:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652489 states. [2019-09-10 06:27:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652489 to 461562. [2019-09-10 06:27:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461562 states. [2019-09-10 06:27:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461562 states to 461562 states and 738117 transitions. [2019-09-10 06:27:50,379 INFO L78 Accepts]: Start accepts. Automaton has 461562 states and 738117 transitions. Word has length 283 [2019-09-10 06:27:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:50,379 INFO L475 AbstractCegarLoop]: Abstraction has 461562 states and 738117 transitions. [2019-09-10 06:27:50,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:27:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 461562 states and 738117 transitions. [2019-09-10 06:27:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-10 06:27:50,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:50,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:50,465 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -628975310, now seen corresponding path program 1 times [2019-09-10 06:27:50,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:50,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:50,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:50,739 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 06:27:50,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:50,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:27:50,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:50,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:27:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:27:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:27:50,741 INFO L87 Difference]: Start difference. First operand 461562 states and 738117 transitions. Second operand 6 states. [2019-09-10 06:27:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:58,096 INFO L93 Difference]: Finished difference Result 693488 states and 1110821 transitions. [2019-09-10 06:27:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:27:58,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2019-09-10 06:27:58,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:00,119 INFO L225 Difference]: With dead ends: 693488 [2019-09-10 06:28:00,119 INFO L226 Difference]: Without dead ends: 693488 [2019-09-10 06:28:00,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:28:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693488 states. [2019-09-10 06:28:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693488 to 514232. [2019-09-10 06:28:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514232 states. [2019-09-10 06:28:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514232 states to 514232 states and 822528 transitions. [2019-09-10 06:28:14,227 INFO L78 Accepts]: Start accepts. Automaton has 514232 states and 822528 transitions. Word has length 283 [2019-09-10 06:28:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:14,228 INFO L475 AbstractCegarLoop]: Abstraction has 514232 states and 822528 transitions. [2019-09-10 06:28:14,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 514232 states and 822528 transitions. [2019-09-10 06:28:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-10 06:28:14,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:14,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:14,307 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash -649612493, now seen corresponding path program 1 times [2019-09-10 06:28:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:14,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:14,566 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 06:28:14,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:14,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:14,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:14,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:14,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:14,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:14,567 INFO L87 Difference]: Start difference. First operand 514232 states and 822528 transitions. Second operand 6 states. [2019-09-10 06:28:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:23,665 INFO L93 Difference]: Finished difference Result 627289 states and 1000269 transitions. [2019-09-10 06:28:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:23,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-09-10 06:28:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:24,541 INFO L225 Difference]: With dead ends: 627289 [2019-09-10 06:28:24,542 INFO L226 Difference]: Without dead ends: 627289 [2019-09-10 06:28:24,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:28:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627289 states. [2019-09-10 06:28:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627289 to 588197. [2019-09-10 06:28:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588197 states. [2019-09-10 06:28:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588197 states to 588197 states and 939480 transitions. [2019-09-10 06:28:33,923 INFO L78 Accepts]: Start accepts. Automaton has 588197 states and 939480 transitions. Word has length 284 [2019-09-10 06:28:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:33,923 INFO L475 AbstractCegarLoop]: Abstraction has 588197 states and 939480 transitions. [2019-09-10 06:28:33,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 588197 states and 939480 transitions. [2019-09-10 06:28:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-10 06:28:34,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:34,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:34,005 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash -232752165, now seen corresponding path program 1 times [2019-09-10 06:28:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:34,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:34,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:35,794 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 06:28:35,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:35,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:35,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:35,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:35,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:35,795 INFO L87 Difference]: Start difference. First operand 588197 states and 939480 transitions. Second operand 6 states. [2019-09-10 06:28:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:46,100 INFO L93 Difference]: Finished difference Result 835468 states and 1327458 transitions. [2019-09-10 06:28:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:46,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-09-10 06:28:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:47,326 INFO L225 Difference]: With dead ends: 835468 [2019-09-10 06:28:47,326 INFO L226 Difference]: Without dead ends: 835468 [2019-09-10 06:28:47,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835468 states. [2019-09-10 06:28:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835468 to 520376. [2019-09-10 06:28:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520376 states. [2019-09-10 06:28:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520376 states to 520376 states and 829379 transitions. [2019-09-10 06:28:57,097 INFO L78 Accepts]: Start accepts. Automaton has 520376 states and 829379 transitions. Word has length 284 [2019-09-10 06:28:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:57,097 INFO L475 AbstractCegarLoop]: Abstraction has 520376 states and 829379 transitions. [2019-09-10 06:28:57,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 520376 states and 829379 transitions. [2019-09-10 06:28:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-10 06:28:57,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:57,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:57,128 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 700413629, now seen corresponding path program 1 times [2019-09-10 06:28:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:57,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:28:57,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:57,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:28:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:28:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:28:57,650 INFO L87 Difference]: Start difference. First operand 520376 states and 829379 transitions. Second operand 8 states. [2019-09-10 06:29:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:06,121 INFO L93 Difference]: Finished difference Result 896123 states and 1407450 transitions. [2019-09-10 06:29:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:29:06,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 287 [2019-09-10 06:29:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:07,699 INFO L225 Difference]: With dead ends: 896123 [2019-09-10 06:29:07,700 INFO L226 Difference]: Without dead ends: 896123 [2019-09-10 06:29:07,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:29:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896123 states. [2019-09-10 06:29:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896123 to 521014. [2019-09-10 06:29:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521014 states. [2019-09-10 06:29:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521014 states to 521014 states and 830117 transitions. [2019-09-10 06:29:26,270 INFO L78 Accepts]: Start accepts. Automaton has 521014 states and 830117 transitions. Word has length 287 [2019-09-10 06:29:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:26,271 INFO L475 AbstractCegarLoop]: Abstraction has 521014 states and 830117 transitions. [2019-09-10 06:29:26,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:29:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 521014 states and 830117 transitions. [2019-09-10 06:29:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-10 06:29:26,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:26,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:26,302 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1168040303, now seen corresponding path program 1 times [2019-09-10 06:29:26,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:26,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:26,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:26,736 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 06:29:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:26,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:29:26,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:26,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:29:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:29:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:26,738 INFO L87 Difference]: Start difference. First operand 521014 states and 830117 transitions. Second operand 5 states. [2019-09-10 06:29:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:30,172 INFO L93 Difference]: Finished difference Result 633263 states and 1016145 transitions. [2019-09-10 06:29:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:29:30,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 287 [2019-09-10 06:29:30,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:31,107 INFO L225 Difference]: With dead ends: 633263 [2019-09-10 06:29:31,107 INFO L226 Difference]: Without dead ends: 633263 [2019-09-10 06:29:31,108 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 06:29:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633263 states. [2019-09-10 06:29:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633263 to 490966. [2019-09-10 06:29:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490966 states. [2019-09-10 06:29:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490966 states to 490966 states and 782047 transitions. [2019-09-10 06:29:49,504 INFO L78 Accepts]: Start accepts. Automaton has 490966 states and 782047 transitions. Word has length 287 [2019-09-10 06:29:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:49,505 INFO L475 AbstractCegarLoop]: Abstraction has 490966 states and 782047 transitions. [2019-09-10 06:29:49,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:29:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 490966 states and 782047 transitions. [2019-09-10 06:29:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:29:49,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:49,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:49,515 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash 398082229, now seen corresponding path program 1 times [2019-09-10 06:29:49,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:49,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:49,778 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 06:29:49,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:49,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:49,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:49,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:49,780 INFO L87 Difference]: Start difference. First operand 490966 states and 782047 transitions. Second operand 4 states. [2019-09-10 06:29:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:57,315 INFO L93 Difference]: Finished difference Result 482646 states and 768778 transitions. [2019-09-10 06:29:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:57,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-09-10 06:29:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:58,076 INFO L225 Difference]: With dead ends: 482646 [2019-09-10 06:29:58,076 INFO L226 Difference]: Without dead ends: 482646 [2019-09-10 06:29:58,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482646 states. [2019-09-10 06:30:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482646 to 482646. [2019-09-10 06:30:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482646 states. [2019-09-10 06:30:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482646 states to 482646 states and 768778 transitions. [2019-09-10 06:30:05,133 INFO L78 Accepts]: Start accepts. Automaton has 482646 states and 768778 transitions. Word has length 290 [2019-09-10 06:30:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:05,133 INFO L475 AbstractCegarLoop]: Abstraction has 482646 states and 768778 transitions. [2019-09-10 06:30:05,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 482646 states and 768778 transitions. [2019-09-10 06:30:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-10 06:30:05,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:05,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:05,139 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash 599354399, now seen corresponding path program 1 times [2019-09-10 06:30:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:05,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:05,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:05,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:05,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:06,813 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2019-09-10 06:30:06,972 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 06:30:06,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:30:06,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:06,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:30:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:30:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:30:06,974 INFO L87 Difference]: Start difference. First operand 482646 states and 768778 transitions. Second operand 8 states. [2019-09-10 06:30:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:15,831 INFO L93 Difference]: Finished difference Result 773813 states and 1190303 transitions. [2019-09-10 06:30:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:30:15,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 299 [2019-09-10 06:30:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:17,122 INFO L225 Difference]: With dead ends: 773813 [2019-09-10 06:30:17,122 INFO L226 Difference]: Without dead ends: 773677 [2019-09-10 06:30:17,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:30:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773677 states. [2019-09-10 06:30:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773677 to 567433. [2019-09-10 06:30:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567433 states. [2019-09-10 06:30:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567433 states to 567433 states and 884775 transitions. [2019-09-10 06:30:27,613 INFO L78 Accepts]: Start accepts. Automaton has 567433 states and 884775 transitions. Word has length 299 [2019-09-10 06:30:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:27,613 INFO L475 AbstractCegarLoop]: Abstraction has 567433 states and 884775 transitions. [2019-09-10 06:30:27,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:30:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 567433 states and 884775 transitions. [2019-09-10 06:30:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:30:27,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:27,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:27,617 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1640728235, now seen corresponding path program 1 times [2019-09-10 06:30:27,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:27,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:27,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:29,498 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 06:30:29,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:29,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:30:29,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:29,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:30:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:30:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:30:29,500 INFO L87 Difference]: Start difference. First operand 567433 states and 884775 transitions. Second operand 7 states. [2019-09-10 06:30:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:44,096 INFO L93 Difference]: Finished difference Result 1758292 states and 2732114 transitions. [2019-09-10 06:30:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:30:44,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 306 [2019-09-10 06:30:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:47,373 INFO L225 Difference]: With dead ends: 1758292 [2019-09-10 06:30:47,374 INFO L226 Difference]: Without dead ends: 1758292 [2019-09-10 06:30:47,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:30:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758292 states. [2019-09-10 06:31:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758292 to 1529615. [2019-09-10 06:31:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1529615 states. [2019-09-10 06:31:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529615 states to 1529615 states and 2377992 transitions. [2019-09-10 06:31:36,214 INFO L78 Accepts]: Start accepts. Automaton has 1529615 states and 2377992 transitions. Word has length 306 [2019-09-10 06:31:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:36,214 INFO L475 AbstractCegarLoop]: Abstraction has 1529615 states and 2377992 transitions. [2019-09-10 06:31:36,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:31:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1529615 states and 2377992 transitions. [2019-09-10 06:31:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:31:36,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:36,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:31:36,220 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash 839687136, now seen corresponding path program 1 times [2019-09-10 06:31:36,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:36,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:36,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:36,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:36,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:36,583 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 06:31:36,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:31:36,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:36,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:31:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:31:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:31:36,590 INFO L87 Difference]: Start difference. First operand 1529615 states and 2377992 transitions. Second operand 5 states. [2019-09-10 06:31:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:56,851 INFO L93 Difference]: Finished difference Result 1557497 states and 2410595 transitions. [2019-09-10 06:31:56,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:31:56,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2019-09-10 06:31:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:59,608 INFO L225 Difference]: With dead ends: 1557497 [2019-09-10 06:31:59,608 INFO L226 Difference]: Without dead ends: 1557497 [2019-09-10 06:31:59,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:32:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557497 states. [2019-09-10 06:32:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557497 to 1526863. [2019-09-10 06:32:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526863 states.