java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:55:14,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:55:14,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:55:14,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:55:14,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:55:14,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:55:14,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:55:14,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:55:14,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:55:14,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:55:14,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:55:14,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:55:14,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:55:14,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:55:14,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:55:14,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:55:14,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:55:14,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:55:14,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:55:14,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:55:14,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:55:14,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:55:14,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:55:14,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:55:14,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:55:14,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:55:14,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:55:14,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:55:14,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:55:14,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:55:14,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:55:14,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:55:14,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:55:14,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:55:14,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:55:14,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:55:14,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:55:14,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:55:14,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:55:14,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:55:14,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:55:14,274 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 07:55:14,289 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:55:14,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:55:14,289 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:55:14,290 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:55:14,290 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:55:14,290 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:55:14,291 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:55:14,291 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:55:14,291 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:55:14,291 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:55:14,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:55:14,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:55:14,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:55:14,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:55:14,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:55:14,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:55:14,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:55:14,293 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:55:14,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:55:14,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:55:14,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:55:14,294 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:55:14,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:55:14,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:55:14,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:55:14,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:55:14,295 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:55:14,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:55:14,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:55:14,296 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:55:14,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:55:14,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:55:14,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:55:14,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:55:14,357 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:55:14,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:55:14,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f263e57/7321ac3d51e34d6cbffc674cd6b36757/FLAG5003aac08 [2019-09-10 07:55:15,059 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:55:15,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:55:15,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f263e57/7321ac3d51e34d6cbffc674cd6b36757/FLAG5003aac08 [2019-09-10 07:55:15,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f263e57/7321ac3d51e34d6cbffc674cd6b36757 [2019-09-10 07:55:15,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:55:15,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:55:15,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:55:15,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:55:15,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:55:15,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:55:15" (1/1) ... [2019-09-10 07:55:15,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff4ec7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:15, skipping insertion in model container [2019-09-10 07:55:15,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:55:15" (1/1) ... [2019-09-10 07:55:15,228 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:55:15,340 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:55:16,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:55:16,238 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:55:16,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:55:16,797 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:55:16,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16 WrapperNode [2019-09-10 07:55:16,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:55:16,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:55:16,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:55:16,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:55:16,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:16,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:16,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:16,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:16,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:16,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:16,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (1/1) ... [2019-09-10 07:55:17,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:55:17,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:55:17,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:55:17,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:55:17,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (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 07:55:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:55:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:55:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:55:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:55:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:55:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:55:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:55:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:55:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:55:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:55:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:55:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:55:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:55:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:55:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:55:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:55:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:55:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:55:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:55:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:55:19,415 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:55:19,416 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:55:19,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:55:19 BoogieIcfgContainer [2019-09-10 07:55:19,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:55:19,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:55:19,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:55:19,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:55:19,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:55:15" (1/3) ... [2019-09-10 07:55:19,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54080435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:55:19, skipping insertion in model container [2019-09-10 07:55:19,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:55:16" (2/3) ... [2019-09-10 07:55:19,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54080435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:55:19, skipping insertion in model container [2019-09-10 07:55:19,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:55:19" (3/3) ... [2019-09-10 07:55:19,431 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:55:19,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:55:19,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 07:55:19,492 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 07:55:19,531 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:55:19,531 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:55:19,531 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:55:19,531 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:55:19,531 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:55:19,531 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:55:19,532 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:55:19,532 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:55:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states. [2019-09-10 07:55:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:55:19,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:19,619 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] [2019-09-10 07:55:19,621 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 446132065, now seen corresponding path program 1 times [2019-09-10 07:55:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:19,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:19,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:19,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:20,214 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 07:55:20,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:20,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:55:20,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:20,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:55:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:55:20,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:55:20,239 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 5 states. [2019-09-10 07:55:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:21,172 INFO L93 Difference]: Finished difference Result 731 states and 1211 transitions. [2019-09-10 07:55:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:55:21,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 07:55:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:21,193 INFO L225 Difference]: With dead ends: 731 [2019-09-10 07:55:21,193 INFO L226 Difference]: Without dead ends: 719 [2019-09-10 07:55:21,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:55:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-10 07:55:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 659. [2019-09-10 07:55:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-10 07:55:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 873 transitions. [2019-09-10 07:55:21,286 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 873 transitions. Word has length 76 [2019-09-10 07:55:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:21,287 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 873 transitions. [2019-09-10 07:55:21,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:55:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 873 transitions. [2019-09-10 07:55:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:55:21,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:21,297 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] [2019-09-10 07:55:21,297 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1643184449, now seen corresponding path program 1 times [2019-09-10 07:55:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:21,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:21,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:21,510 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 07:55:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:55:21,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:21,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:55:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:55:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:55:21,514 INFO L87 Difference]: Start difference. First operand 659 states and 873 transitions. Second operand 5 states. [2019-09-10 07:55:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:21,880 INFO L93 Difference]: Finished difference Result 598 states and 802 transitions. [2019-09-10 07:55:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:55:21,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 07:55:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:21,890 INFO L225 Difference]: With dead ends: 598 [2019-09-10 07:55:21,891 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 07:55:21,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:55:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 07:55:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 07:55:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 07:55:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 802 transitions. [2019-09-10 07:55:21,917 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 802 transitions. Word has length 77 [2019-09-10 07:55:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:21,918 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 802 transitions. [2019-09-10 07:55:21,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:55:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 802 transitions. [2019-09-10 07:55:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:55:21,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:21,920 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] [2019-09-10 07:55:21,921 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash -98932957, now seen corresponding path program 1 times [2019-09-10 07:55:21,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:21,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:21,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:21,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:22,107 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 07:55:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:22,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:55:22,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:22,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:55:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:55:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:55:22,109 INFO L87 Difference]: Start difference. First operand 598 states and 802 transitions. Second operand 5 states. [2019-09-10 07:55:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:22,449 INFO L93 Difference]: Finished difference Result 572 states and 770 transitions. [2019-09-10 07:55:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:55:22,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 07:55:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:22,454 INFO L225 Difference]: With dead ends: 572 [2019-09-10 07:55:22,454 INFO L226 Difference]: Without dead ends: 572 [2019-09-10 07:55:22,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:55:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-10 07:55:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-09-10 07:55:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-10 07:55:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 770 transitions. [2019-09-10 07:55:22,471 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 770 transitions. Word has length 78 [2019-09-10 07:55:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:22,471 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 770 transitions. [2019-09-10 07:55:22,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:55:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 770 transitions. [2019-09-10 07:55:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:55:22,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:22,474 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] [2019-09-10 07:55:22,475 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1520302037, now seen corresponding path program 1 times [2019-09-10 07:55:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:22,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:22,589 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 07:55:22,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:22,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:55:22,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:22,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:55:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:55:22,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:55:22,591 INFO L87 Difference]: Start difference. First operand 572 states and 770 transitions. Second operand 5 states. [2019-09-10 07:55:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:23,021 INFO L93 Difference]: Finished difference Result 562 states and 756 transitions. [2019-09-10 07:55:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:55:23,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 07:55:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:23,025 INFO L225 Difference]: With dead ends: 562 [2019-09-10 07:55:23,025 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 07:55:23,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:55:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 07:55:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 07:55:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 07:55:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 756 transitions. [2019-09-10 07:55:23,040 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 756 transitions. Word has length 79 [2019-09-10 07:55:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:23,040 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 756 transitions. [2019-09-10 07:55:23,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:55:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 756 transitions. [2019-09-10 07:55:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:55:23,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:23,042 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] [2019-09-10 07:55:23,043 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1777858629, now seen corresponding path program 1 times [2019-09-10 07:55:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:23,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:23,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:23,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:23,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:23,176 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 07:55:23,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:23,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:55:23,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:23,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:55:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:55:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:55:23,180 INFO L87 Difference]: Start difference. First operand 562 states and 756 transitions. Second operand 5 states. [2019-09-10 07:55:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:23,540 INFO L93 Difference]: Finished difference Result 551 states and 742 transitions. [2019-09-10 07:55:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:55:23,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 07:55:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:23,544 INFO L225 Difference]: With dead ends: 551 [2019-09-10 07:55:23,544 INFO L226 Difference]: Without dead ends: 551 [2019-09-10 07:55:23,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:55:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-10 07:55:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-10 07:55:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 742 transitions. [2019-09-10 07:55:23,558 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 742 transitions. Word has length 80 [2019-09-10 07:55:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:23,558 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 742 transitions. [2019-09-10 07:55:23,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:55:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 742 transitions. [2019-09-10 07:55:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:55:23,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:23,560 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] [2019-09-10 07:55:23,561 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1690487197, now seen corresponding path program 1 times [2019-09-10 07:55:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:23,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:23,769 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 07:55:23,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:23,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:23,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:23,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:23,771 INFO L87 Difference]: Start difference. First operand 551 states and 742 transitions. Second operand 9 states. [2019-09-10 07:55:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:25,337 INFO L93 Difference]: Finished difference Result 1140 states and 1578 transitions. [2019-09-10 07:55:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:25,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 07:55:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:25,347 INFO L225 Difference]: With dead ends: 1140 [2019-09-10 07:55:25,348 INFO L226 Difference]: Without dead ends: 1140 [2019-09-10 07:55:25,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-10 07:55:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-10 07:55:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 741 transitions. [2019-09-10 07:55:25,369 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 741 transitions. Word has length 81 [2019-09-10 07:55:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:25,371 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 741 transitions. [2019-09-10 07:55:25,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 741 transitions. [2019-09-10 07:55:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:55:25,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:25,377 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] [2019-09-10 07:55:25,378 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash 533330474, now seen corresponding path program 1 times [2019-09-10 07:55:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:25,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:25,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:25,584 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 07:55:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:25,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:25,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:25,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:25,587 INFO L87 Difference]: Start difference. First operand 551 states and 741 transitions. Second operand 9 states. [2019-09-10 07:55:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:27,357 INFO L93 Difference]: Finished difference Result 1097 states and 1508 transitions. [2019-09-10 07:55:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:55:27,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 07:55:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:27,366 INFO L225 Difference]: With dead ends: 1097 [2019-09-10 07:55:27,366 INFO L226 Difference]: Without dead ends: 1097 [2019-09-10 07:55:27,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:55:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-09-10 07:55:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 551. [2019-09-10 07:55:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 740 transitions. [2019-09-10 07:55:27,396 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 740 transitions. Word has length 81 [2019-09-10 07:55:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:27,397 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 740 transitions. [2019-09-10 07:55:27,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 740 transitions. [2019-09-10 07:55:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:55:27,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:27,399 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] [2019-09-10 07:55:27,400 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1325711291, now seen corresponding path program 1 times [2019-09-10 07:55:27,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:27,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:27,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:27,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:27,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:55:27,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:27,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:55:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:55:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:55:27,627 INFO L87 Difference]: Start difference. First operand 551 states and 740 transitions. Second operand 8 states. [2019-09-10 07:55:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:28,534 INFO L93 Difference]: Finished difference Result 782 states and 1026 transitions. [2019-09-10 07:55:28,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:55:28,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-09-10 07:55:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:28,539 INFO L225 Difference]: With dead ends: 782 [2019-09-10 07:55:28,539 INFO L226 Difference]: Without dead ends: 782 [2019-09-10 07:55:28,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:55:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-09-10 07:55:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 551. [2019-09-10 07:55:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 739 transitions. [2019-09-10 07:55:28,555 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 739 transitions. Word has length 81 [2019-09-10 07:55:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:28,556 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 739 transitions. [2019-09-10 07:55:28,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:55:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2019-09-10 07:55:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:28,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:28,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:28,558 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1670879057, now seen corresponding path program 1 times [2019-09-10 07:55:28,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:28,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:28,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:28,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:28,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:28,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:28,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:28,730 INFO L87 Difference]: Start difference. First operand 551 states and 739 transitions. Second operand 9 states. [2019-09-10 07:55:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:30,264 INFO L93 Difference]: Finished difference Result 1116 states and 1534 transitions. [2019-09-10 07:55:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:30,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:30,270 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:55:30,271 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:55:30,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:55:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:55:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2019-09-10 07:55:30,289 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 83 [2019-09-10 07:55:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:30,289 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2019-09-10 07:55:30,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2019-09-10 07:55:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:30,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:30,291 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] [2019-09-10 07:55:30,292 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2064402550, now seen corresponding path program 1 times [2019-09-10 07:55:30,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:30,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:30,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:30,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:30,504 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 07:55:30,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:30,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:30,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:30,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:30,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:30,509 INFO L87 Difference]: Start difference. First operand 551 states and 738 transitions. Second operand 9 states. [2019-09-10 07:55:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:31,853 INFO L93 Difference]: Finished difference Result 1116 states and 1532 transitions. [2019-09-10 07:55:31,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:31,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:31,860 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:55:31,860 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:55:31,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:55:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:55:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 737 transitions. [2019-09-10 07:55:31,882 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 737 transitions. Word has length 83 [2019-09-10 07:55:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:31,882 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 737 transitions. [2019-09-10 07:55:31,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 737 transitions. [2019-09-10 07:55:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:31,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:31,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:31,885 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:31,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:31,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1181772490, now seen corresponding path program 1 times [2019-09-10 07:55:31,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:31,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:31,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:32,109 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 07:55:32,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:32,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:32,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:32,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:32,111 INFO L87 Difference]: Start difference. First operand 551 states and 737 transitions. Second operand 9 states. [2019-09-10 07:55:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:33,431 INFO L93 Difference]: Finished difference Result 1116 states and 1531 transitions. [2019-09-10 07:55:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:33,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:33,438 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:55:33,438 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:55:33,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:55:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:55:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 736 transitions. [2019-09-10 07:55:33,455 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 736 transitions. Word has length 83 [2019-09-10 07:55:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:33,456 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 736 transitions. [2019-09-10 07:55:33,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2019-09-10 07:55:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:33,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:33,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:33,458 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -876834767, now seen corresponding path program 1 times [2019-09-10 07:55:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:33,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:33,605 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 07:55:33,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:33,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:33,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:33,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:33,607 INFO L87 Difference]: Start difference. First operand 551 states and 736 transitions. Second operand 9 states. [2019-09-10 07:55:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:35,243 INFO L93 Difference]: Finished difference Result 1140 states and 1570 transitions. [2019-09-10 07:55:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:35,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:35,251 INFO L225 Difference]: With dead ends: 1140 [2019-09-10 07:55:35,251 INFO L226 Difference]: Without dead ends: 1140 [2019-09-10 07:55:35,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-10 07:55:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-10 07:55:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 735 transitions. [2019-09-10 07:55:35,268 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 735 transitions. Word has length 83 [2019-09-10 07:55:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:35,268 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 735 transitions. [2019-09-10 07:55:35,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 735 transitions. [2019-09-10 07:55:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:35,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:35,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:35,271 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash 287644134, now seen corresponding path program 1 times [2019-09-10 07:55:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:35,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:35,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:35,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:35,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:35,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:35,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:35,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:35,453 INFO L87 Difference]: Start difference. First operand 551 states and 735 transitions. Second operand 9 states. [2019-09-10 07:55:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:36,748 INFO L93 Difference]: Finished difference Result 1116 states and 1528 transitions. [2019-09-10 07:55:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:36,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:36,753 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:55:36,753 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:55:36,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:55:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:55:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 733 transitions. [2019-09-10 07:55:36,768 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 733 transitions. Word has length 83 [2019-09-10 07:55:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:36,768 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 733 transitions. [2019-09-10 07:55:36,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2019-09-10 07:55:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:36,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:36,770 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] [2019-09-10 07:55:36,770 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1062374831, now seen corresponding path program 1 times [2019-09-10 07:55:36,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:36,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:36,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:36,917 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 07:55:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:36,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:36,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:36,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:36,919 INFO L87 Difference]: Start difference. First operand 551 states and 733 transitions. Second operand 9 states. [2019-09-10 07:55:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:38,491 INFO L93 Difference]: Finished difference Result 1140 states and 1566 transitions. [2019-09-10 07:55:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:38,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:38,498 INFO L225 Difference]: With dead ends: 1140 [2019-09-10 07:55:38,498 INFO L226 Difference]: Without dead ends: 1140 [2019-09-10 07:55:38,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-10 07:55:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-10 07:55:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 731 transitions. [2019-09-10 07:55:38,513 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 731 transitions. Word has length 83 [2019-09-10 07:55:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:38,513 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 731 transitions. [2019-09-10 07:55:38,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 731 transitions. [2019-09-10 07:55:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:55:38,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:38,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] [2019-09-10 07:55:38,515 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1850218341, now seen corresponding path program 1 times [2019-09-10 07:55:38,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:38,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:38,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:38,697 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 07:55:38,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:38,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:38,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:38,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:38,699 INFO L87 Difference]: Start difference. First operand 551 states and 731 transitions. Second operand 9 states. [2019-09-10 07:55:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:39,872 INFO L93 Difference]: Finished difference Result 883 states and 1215 transitions. [2019-09-10 07:55:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:55:39,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:55:39,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:39,876 INFO L225 Difference]: With dead ends: 883 [2019-09-10 07:55:39,876 INFO L226 Difference]: Without dead ends: 883 [2019-09-10 07:55:39,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:55:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-10 07:55:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 551. [2019-09-10 07:55:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 729 transitions. [2019-09-10 07:55:39,889 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 729 transitions. Word has length 83 [2019-09-10 07:55:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:39,889 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 729 transitions. [2019-09-10 07:55:39,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 729 transitions. [2019-09-10 07:55:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:39,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:39,891 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] [2019-09-10 07:55:39,892 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1299527057, now seen corresponding path program 1 times [2019-09-10 07:55:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:39,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:39,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:40,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:40,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:40,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:40,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:40,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:40,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:40,049 INFO L87 Difference]: Start difference. First operand 551 states and 729 transitions. Second operand 9 states. [2019-09-10 07:55:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:41,736 INFO L93 Difference]: Finished difference Result 1092 states and 1481 transitions. [2019-09-10 07:55:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:41,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:41,742 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:41,742 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:41,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 728 transitions. [2019-09-10 07:55:41,756 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 728 transitions. Word has length 85 [2019-09-10 07:55:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:41,756 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 728 transitions. [2019-09-10 07:55:41,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 728 transitions. [2019-09-10 07:55:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:41,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:41,758 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] [2019-09-10 07:55:41,759 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -716975399, now seen corresponding path program 1 times [2019-09-10 07:55:41,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:41,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:41,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:41,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:41,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:41,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:41,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:41,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:41,909 INFO L87 Difference]: Start difference. First operand 551 states and 728 transitions. Second operand 9 states. [2019-09-10 07:55:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:43,404 INFO L93 Difference]: Finished difference Result 1092 states and 1480 transitions. [2019-09-10 07:55:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:43,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:43,410 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:43,410 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:43,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 727 transitions. [2019-09-10 07:55:43,423 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 727 transitions. Word has length 85 [2019-09-10 07:55:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:43,424 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 727 transitions. [2019-09-10 07:55:43,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 727 transitions. [2019-09-10 07:55:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:43,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:43,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:43,426 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 777191179, now seen corresponding path program 1 times [2019-09-10 07:55:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:43,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:43,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:43,575 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 07:55:43,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:43,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:43,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:43,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:43,577 INFO L87 Difference]: Start difference. First operand 551 states and 727 transitions. Second operand 9 states. [2019-09-10 07:55:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:45,081 INFO L93 Difference]: Finished difference Result 1092 states and 1479 transitions. [2019-09-10 07:55:45,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:45,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:45,087 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:45,087 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:45,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 726 transitions. [2019-09-10 07:55:45,099 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 726 transitions. Word has length 85 [2019-09-10 07:55:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:45,100 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 726 transitions. [2019-09-10 07:55:45,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 726 transitions. [2019-09-10 07:55:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:45,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:45,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] [2019-09-10 07:55:45,103 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash -496308349, now seen corresponding path program 1 times [2019-09-10 07:55:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:45,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:45,266 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 07:55:45,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:45,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:45,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:45,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:45,267 INFO L87 Difference]: Start difference. First operand 551 states and 726 transitions. Second operand 9 states. [2019-09-10 07:55:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:46,803 INFO L93 Difference]: Finished difference Result 1092 states and 1477 transitions. [2019-09-10 07:55:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:46,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:46,808 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:46,808 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:46,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 725 transitions. [2019-09-10 07:55:46,823 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 725 transitions. Word has length 85 [2019-09-10 07:55:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:46,823 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 725 transitions. [2019-09-10 07:55:46,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 725 transitions. [2019-09-10 07:55:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:46,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:46,826 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] [2019-09-10 07:55:46,827 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2124094268, now seen corresponding path program 1 times [2019-09-10 07:55:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:46,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:46,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:46,974 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 07:55:46,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:46,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:46,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:46,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:46,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:46,976 INFO L87 Difference]: Start difference. First operand 551 states and 725 transitions. Second operand 9 states. [2019-09-10 07:55:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:48,434 INFO L93 Difference]: Finished difference Result 1092 states and 1476 transitions. [2019-09-10 07:55:48,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:48,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:48,440 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:48,440 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:48,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 724 transitions. [2019-09-10 07:55:48,453 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 724 transitions. Word has length 85 [2019-09-10 07:55:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:48,453 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 724 transitions. [2019-09-10 07:55:48,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 724 transitions. [2019-09-10 07:55:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:48,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:48,455 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] [2019-09-10 07:55:48,456 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash -194937756, now seen corresponding path program 1 times [2019-09-10 07:55:48,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:48,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:48,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:48,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 07:55:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:48,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:48,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:48,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:48,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:48,651 INFO L87 Difference]: Start difference. First operand 551 states and 724 transitions. Second operand 9 states. [2019-09-10 07:55:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:49,969 INFO L93 Difference]: Finished difference Result 1116 states and 1514 transitions. [2019-09-10 07:55:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:49,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:49,975 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:55:49,975 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:55:49,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:55:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:55:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 723 transitions. [2019-09-10 07:55:49,987 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 723 transitions. Word has length 85 [2019-09-10 07:55:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:49,988 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 723 transitions. [2019-09-10 07:55:49,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 723 transitions. [2019-09-10 07:55:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:49,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:49,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:49,990 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1160181619, now seen corresponding path program 1 times [2019-09-10 07:55:49,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:49,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:49,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:50,153 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 07:55:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:50,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:50,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:50,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:50,155 INFO L87 Difference]: Start difference. First operand 551 states and 723 transitions. Second operand 9 states. [2019-09-10 07:55:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:51,498 INFO L93 Difference]: Finished difference Result 1092 states and 1474 transitions. [2019-09-10 07:55:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:51,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:51,506 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:51,507 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:51,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 722 transitions. [2019-09-10 07:55:51,516 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 722 transitions. Word has length 85 [2019-09-10 07:55:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:51,516 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 722 transitions. [2019-09-10 07:55:51,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 722 transitions. [2019-09-10 07:55:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:51,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:51,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:51,518 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1009658424, now seen corresponding path program 1 times [2019-09-10 07:55:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:51,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:51,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:51,658 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 07:55:51,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:51,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:51,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:51,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:51,660 INFO L87 Difference]: Start difference. First operand 551 states and 722 transitions. Second operand 9 states. [2019-09-10 07:55:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:53,179 INFO L93 Difference]: Finished difference Result 1092 states and 1472 transitions. [2019-09-10 07:55:53,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:53,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:53,185 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:53,185 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:53,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 721 transitions. [2019-09-10 07:55:53,194 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 721 transitions. Word has length 85 [2019-09-10 07:55:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:53,194 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 721 transitions. [2019-09-10 07:55:53,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 721 transitions. [2019-09-10 07:55:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:53,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:53,196 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] [2019-09-10 07:55:53,196 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -527052732, now seen corresponding path program 1 times [2019-09-10 07:55:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:53,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:53,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:53,336 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 07:55:53,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:53,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:53,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:53,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:53,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:53,338 INFO L87 Difference]: Start difference. First operand 551 states and 721 transitions. Second operand 9 states. [2019-09-10 07:55:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:54,745 INFO L93 Difference]: Finished difference Result 1092 states and 1470 transitions. [2019-09-10 07:55:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:54,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:54,751 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:54,751 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:54,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 719 transitions. [2019-09-10 07:55:54,762 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 719 transitions. Word has length 85 [2019-09-10 07:55:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:54,762 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 719 transitions. [2019-09-10 07:55:54,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 719 transitions. [2019-09-10 07:55:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:54,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:54,764 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] [2019-09-10 07:55:54,764 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1402103780, now seen corresponding path program 1 times [2019-09-10 07:55:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:54,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:54,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:54,911 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 07:55:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:54,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:54,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:54,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:54,912 INFO L87 Difference]: Start difference. First operand 551 states and 719 transitions. Second operand 9 states. [2019-09-10 07:55:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:56,147 INFO L93 Difference]: Finished difference Result 1116 states and 1508 transitions. [2019-09-10 07:55:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:56,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:56,154 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:55:56,154 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:55:56,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:55:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:55:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 717 transitions. [2019-09-10 07:55:56,165 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 717 transitions. Word has length 85 [2019-09-10 07:55:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:56,165 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 717 transitions. [2019-09-10 07:55:56,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 717 transitions. [2019-09-10 07:55:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:56,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:56,166 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] [2019-09-10 07:55:56,167 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1985070686, now seen corresponding path program 1 times [2019-09-10 07:55:56,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:56,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:56,383 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 07:55:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:56,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:56,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:56,386 INFO L87 Difference]: Start difference. First operand 551 states and 717 transitions. Second operand 9 states. [2019-09-10 07:55:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:57,807 INFO L93 Difference]: Finished difference Result 1140 states and 1540 transitions. [2019-09-10 07:55:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:57,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:57,813 INFO L225 Difference]: With dead ends: 1140 [2019-09-10 07:55:57,813 INFO L226 Difference]: Without dead ends: 1140 [2019-09-10 07:55:57,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-10 07:55:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-10 07:55:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 715 transitions. [2019-09-10 07:55:57,825 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 715 transitions. Word has length 85 [2019-09-10 07:55:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:57,825 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 715 transitions. [2019-09-10 07:55:57,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 715 transitions. [2019-09-10 07:55:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:57,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:57,826 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] [2019-09-10 07:55:57,826 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:57,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1621426561, now seen corresponding path program 1 times [2019-09-10 07:55:57,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:57,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:57,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:57,969 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 07:55:57,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:57,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:57,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:57,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:57,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:57,970 INFO L87 Difference]: Start difference. First operand 551 states and 715 transitions. Second operand 9 states. [2019-09-10 07:55:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:59,345 INFO L93 Difference]: Finished difference Result 1092 states and 1464 transitions. [2019-09-10 07:55:59,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:55:59,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:55:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:59,351 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:55:59,351 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:55:59,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:55:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:55:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:55:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:55:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 713 transitions. [2019-09-10 07:55:59,363 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 713 transitions. Word has length 85 [2019-09-10 07:55:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:59,363 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 713 transitions. [2019-09-10 07:55:59,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:55:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 713 transitions. [2019-09-10 07:55:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:55:59,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:59,365 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] [2019-09-10 07:55:59,365 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1236378400, now seen corresponding path program 1 times [2019-09-10 07:55:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:59,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:59,504 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 07:55:59,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:59,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:55:59,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:59,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:55:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:55:59,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:55:59,506 INFO L87 Difference]: Start difference. First operand 551 states and 713 transitions. Second operand 9 states. [2019-09-10 07:56:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:01,019 INFO L93 Difference]: Finished difference Result 1116 states and 1498 transitions. [2019-09-10 07:56:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:01,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:01,023 INFO L225 Difference]: With dead ends: 1116 [2019-09-10 07:56:01,023 INFO L226 Difference]: Without dead ends: 1116 [2019-09-10 07:56:01,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-10 07:56:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-10 07:56:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:56:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 711 transitions. [2019-09-10 07:56:01,035 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 711 transitions. Word has length 85 [2019-09-10 07:56:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:01,035 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 711 transitions. [2019-09-10 07:56:01,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 711 transitions. [2019-09-10 07:56:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:01,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:01,037 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] [2019-09-10 07:56:01,037 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:01,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1585291813, now seen corresponding path program 1 times [2019-09-10 07:56:01,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:01,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:01,176 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 07:56:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:01,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:01,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:01,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:01,178 INFO L87 Difference]: Start difference. First operand 551 states and 711 transitions. Second operand 9 states. [2019-09-10 07:56:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:02,503 INFO L93 Difference]: Finished difference Result 1092 states and 1460 transitions. [2019-09-10 07:56:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:02,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:02,509 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:56:02,509 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:56:02,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:56:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:56:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:56:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 709 transitions. [2019-09-10 07:56:02,520 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 709 transitions. Word has length 85 [2019-09-10 07:56:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:02,520 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 709 transitions. [2019-09-10 07:56:02,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 709 transitions. [2019-09-10 07:56:02,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:02,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:02,522 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] [2019-09-10 07:56:02,522 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1435826419, now seen corresponding path program 1 times [2019-09-10 07:56:02,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:02,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:02,654 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 07:56:02,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:02,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:02,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:02,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:02,658 INFO L87 Difference]: Start difference. First operand 551 states and 709 transitions. Second operand 9 states. [2019-09-10 07:56:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:04,326 INFO L93 Difference]: Finished difference Result 1092 states and 1456 transitions. [2019-09-10 07:56:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:04,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:04,335 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 07:56:04,335 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 07:56:04,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 07:56:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-10 07:56:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 07:56:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 707 transitions. [2019-09-10 07:56:04,346 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 707 transitions. Word has length 85 [2019-09-10 07:56:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:04,346 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 707 transitions. [2019-09-10 07:56:04,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 707 transitions. [2019-09-10 07:56:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:04,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:04,348 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] [2019-09-10 07:56:04,348 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1981907169, now seen corresponding path program 1 times [2019-09-10 07:56:04,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:04,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:05,696 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 07:56:05,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:05,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:56:05,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:05,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:56:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:56:05,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:56:05,701 INFO L87 Difference]: Start difference. First operand 551 states and 707 transitions. Second operand 22 states. [2019-09-10 07:56:06,718 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:56:06,975 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 07:56:07,360 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:56:07,569 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:56:07,769 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:56:07,951 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:56:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:11,716 INFO L93 Difference]: Finished difference Result 1105 states and 1451 transitions. [2019-09-10 07:56:11,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:56:11,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-10 07:56:11,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:11,719 INFO L225 Difference]: With dead ends: 1105 [2019-09-10 07:56:11,719 INFO L226 Difference]: Without dead ends: 1105 [2019-09-10 07:56:11,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:56:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-09-10 07:56:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 557. [2019-09-10 07:56:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-10 07:56:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 713 transitions. [2019-09-10 07:56:11,730 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 713 transitions. Word has length 87 [2019-09-10 07:56:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:11,730 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 713 transitions. [2019-09-10 07:56:11,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:56:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 713 transitions. [2019-09-10 07:56:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:11,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:11,732 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] [2019-09-10 07:56:11,732 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash 500673725, now seen corresponding path program 1 times [2019-09-10 07:56:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:11,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:11,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:12,483 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 07:56:12,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:56:12,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:12,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:56:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:56:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:56:12,485 INFO L87 Difference]: Start difference. First operand 557 states and 713 transitions. Second operand 17 states. [2019-09-10 07:56:13,083 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:56:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:14,513 INFO L93 Difference]: Finished difference Result 855 states and 1139 transitions. [2019-09-10 07:56:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:56:14,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 07:56:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:14,516 INFO L225 Difference]: With dead ends: 855 [2019-09-10 07:56:14,516 INFO L226 Difference]: Without dead ends: 855 [2019-09-10 07:56:14,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:56:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-09-10 07:56:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 532. [2019-09-10 07:56:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-09-10 07:56:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 680 transitions. [2019-09-10 07:56:14,524 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 680 transitions. Word has length 87 [2019-09-10 07:56:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:14,524 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 680 transitions. [2019-09-10 07:56:14,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:56:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 680 transitions. [2019-09-10 07:56:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:14,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:14,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:14,527 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2120669208, now seen corresponding path program 1 times [2019-09-10 07:56:14,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:14,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:15,438 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 07:56:15,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:15,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:56:15,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:15,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:56:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:56:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:56:15,440 INFO L87 Difference]: Start difference. First operand 532 states and 680 transitions. Second operand 17 states. [2019-09-10 07:56:16,107 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:56:16,268 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 07:56:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:18,802 INFO L93 Difference]: Finished difference Result 1136 states and 1509 transitions. [2019-09-10 07:56:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:56:18,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 07:56:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:18,806 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 07:56:18,806 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 07:56:18,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:56:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 07:56:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 531. [2019-09-10 07:56:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-10 07:56:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 677 transitions. [2019-09-10 07:56:18,815 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 677 transitions. Word has length 87 [2019-09-10 07:56:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:18,816 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 677 transitions. [2019-09-10 07:56:18,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:56:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 677 transitions. [2019-09-10 07:56:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:18,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:18,818 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] [2019-09-10 07:56:18,818 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash 607545151, now seen corresponding path program 1 times [2019-09-10 07:56:18,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:18,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:19,661 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:56:20,303 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 07:56:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 07:56:20,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:20,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:56:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:56:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:56:20,304 INFO L87 Difference]: Start difference. First operand 531 states and 677 transitions. Second operand 25 states. [2019-09-10 07:56:20,450 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:56:21,309 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 07:56:21,610 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:56:21,878 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 07:56:22,225 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-09-10 07:56:22,453 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:56:22,661 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:56:22,838 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:56:23,072 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:56:23,251 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:56:23,512 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:56:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:26,842 INFO L93 Difference]: Finished difference Result 824 states and 1075 transitions. [2019-09-10 07:56:26,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:56:26,842 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-10 07:56:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:26,845 INFO L225 Difference]: With dead ends: 824 [2019-09-10 07:56:26,845 INFO L226 Difference]: Without dead ends: 824 [2019-09-10 07:56:26,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:56:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-09-10 07:56:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 542. [2019-09-10 07:56:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-10 07:56:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 689 transitions. [2019-09-10 07:56:26,855 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 689 transitions. Word has length 87 [2019-09-10 07:56:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:26,856 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 689 transitions. [2019-09-10 07:56:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:56:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 689 transitions. [2019-09-10 07:56:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:26,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:26,858 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] [2019-09-10 07:56:26,858 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1697656993, now seen corresponding path program 1 times [2019-09-10 07:56:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:26,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:26,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:27,418 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 07:56:27,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:27,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:56:27,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:27,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:56:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:56:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:56:27,420 INFO L87 Difference]: Start difference. First operand 542 states and 689 transitions. Second operand 15 states. [2019-09-10 07:56:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:28,989 INFO L93 Difference]: Finished difference Result 711 states and 941 transitions. [2019-09-10 07:56:28,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:56:28,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-09-10 07:56:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:28,992 INFO L225 Difference]: With dead ends: 711 [2019-09-10 07:56:28,992 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 07:56:28,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:56:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 07:56:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 501. [2019-09-10 07:56:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-10 07:56:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 640 transitions. [2019-09-10 07:56:29,023 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 640 transitions. Word has length 87 [2019-09-10 07:56:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:29,023 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 640 transitions. [2019-09-10 07:56:29,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:56:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 640 transitions. [2019-09-10 07:56:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:29,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:29,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:29,027 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2061124639, now seen corresponding path program 1 times [2019-09-10 07:56:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:29,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:29,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:29,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:56:29,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:29,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:56:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:56:29,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:56:29,756 INFO L87 Difference]: Start difference. First operand 501 states and 640 transitions. Second operand 17 states. [2019-09-10 07:56:30,369 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:56:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:32,119 INFO L93 Difference]: Finished difference Result 1063 states and 1418 transitions. [2019-09-10 07:56:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:56:32,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 07:56:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:32,122 INFO L225 Difference]: With dead ends: 1063 [2019-09-10 07:56:32,122 INFO L226 Difference]: Without dead ends: 1063 [2019-09-10 07:56:32,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:56:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-09-10 07:56:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 481. [2019-09-10 07:56:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-10 07:56:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 611 transitions. [2019-09-10 07:56:32,131 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 611 transitions. Word has length 87 [2019-09-10 07:56:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:32,132 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 611 transitions. [2019-09-10 07:56:32,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:56:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 611 transitions. [2019-09-10 07:56:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:32,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:32,133 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] [2019-09-10 07:56:32,134 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash 555238255, now seen corresponding path program 1 times [2019-09-10 07:56:32,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:32,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:32,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:32,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:32,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:33,966 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 07:56:33,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:33,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 07:56:33,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:33,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:56:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:56:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:56:33,968 INFO L87 Difference]: Start difference. First operand 481 states and 611 transitions. Second operand 26 states. [2019-09-10 07:56:34,116 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 07:56:35,132 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:56:35,371 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 07:56:35,670 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-10 07:56:36,042 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 88 [2019-09-10 07:56:36,252 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:56:36,466 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:56:36,727 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:56:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:39,469 INFO L93 Difference]: Finished difference Result 631 states and 803 transitions. [2019-09-10 07:56:39,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:56:39,470 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2019-09-10 07:56:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:39,472 INFO L225 Difference]: With dead ends: 631 [2019-09-10 07:56:39,472 INFO L226 Difference]: Without dead ends: 631 [2019-09-10 07:56:39,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:56:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-10 07:56:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 496. [2019-09-10 07:56:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-10 07:56:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 632 transitions. [2019-09-10 07:56:39,478 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 632 transitions. Word has length 87 [2019-09-10 07:56:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:39,478 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 632 transitions. [2019-09-10 07:56:39,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:56:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 632 transitions. [2019-09-10 07:56:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:39,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:39,480 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] [2019-09-10 07:56:39,480 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1881074051, now seen corresponding path program 1 times [2019-09-10 07:56:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:40,210 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 07:56:40,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:40,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:56:40,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:40,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:56:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:56:40,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:56:40,211 INFO L87 Difference]: Start difference. First operand 496 states and 632 transitions. Second operand 16 states. [2019-09-10 07:56:40,815 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:56:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:42,520 INFO L93 Difference]: Finished difference Result 798 states and 1006 transitions. [2019-09-10 07:56:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:56:42,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-09-10 07:56:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:42,524 INFO L225 Difference]: With dead ends: 798 [2019-09-10 07:56:42,525 INFO L226 Difference]: Without dead ends: 798 [2019-09-10 07:56:42,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:56:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-10 07:56:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 502. [2019-09-10 07:56:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 07:56:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 640 transitions. [2019-09-10 07:56:42,533 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 640 transitions. Word has length 87 [2019-09-10 07:56:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:42,533 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 640 transitions. [2019-09-10 07:56:42,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:56:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 640 transitions. [2019-09-10 07:56:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:42,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:42,535 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] [2019-09-10 07:56:42,535 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash -525959545, now seen corresponding path program 1 times [2019-09-10 07:56:42,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:42,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:42,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:42,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:43,080 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-09-10 07:56:43,325 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 07:56:43,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:56:43,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:43,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:56:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:56:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:56:43,327 INFO L87 Difference]: Start difference. First operand 502 states and 640 transitions. Second operand 17 states. [2019-09-10 07:56:43,917 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:56:44,064 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:56:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:44,818 INFO L93 Difference]: Finished difference Result 656 states and 871 transitions. [2019-09-10 07:56:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:56:44,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 07:56:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:44,820 INFO L225 Difference]: With dead ends: 656 [2019-09-10 07:56:44,820 INFO L226 Difference]: Without dead ends: 656 [2019-09-10 07:56:44,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:56:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-10 07:56:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 460. [2019-09-10 07:56:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-10 07:56:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 583 transitions. [2019-09-10 07:56:44,827 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 583 transitions. Word has length 87 [2019-09-10 07:56:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:44,828 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 583 transitions. [2019-09-10 07:56:44,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:56:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 583 transitions. [2019-09-10 07:56:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:56:44,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:44,829 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] [2019-09-10 07:56:44,829 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash -285902363, now seen corresponding path program 1 times [2019-09-10 07:56:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:44,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:45,277 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 07:56:45,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:45,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:56:45,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:45,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:56:45,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:56:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:56:45,278 INFO L87 Difference]: Start difference. First operand 460 states and 583 transitions. Second operand 13 states. [2019-09-10 07:56:45,834 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 07:56:45,967 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 07:56:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:47,350 INFO L93 Difference]: Finished difference Result 2117 states and 2953 transitions. [2019-09-10 07:56:47,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:56:47,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-10 07:56:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:47,353 INFO L225 Difference]: With dead ends: 2117 [2019-09-10 07:56:47,353 INFO L226 Difference]: Without dead ends: 2117 [2019-09-10 07:56:47,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:56:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-09-10 07:56:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 423. [2019-09-10 07:56:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-10 07:56:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 532 transitions. [2019-09-10 07:56:47,366 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 532 transitions. Word has length 88 [2019-09-10 07:56:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:47,366 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 532 transitions. [2019-09-10 07:56:47,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:56:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 532 transitions. [2019-09-10 07:56:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:56:47,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:47,368 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] [2019-09-10 07:56:47,368 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1241895498, now seen corresponding path program 1 times [2019-09-10 07:56:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:47,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:47,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:47,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:47,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:56:47,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:47,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:56:47,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:56:47,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:56:47,774 INFO L87 Difference]: Start difference. First operand 423 states and 532 transitions. Second operand 12 states. [2019-09-10 07:56:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:48,986 INFO L93 Difference]: Finished difference Result 646 states and 825 transitions. [2019-09-10 07:56:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:56:48,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-10 07:56:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:48,988 INFO L225 Difference]: With dead ends: 646 [2019-09-10 07:56:48,988 INFO L226 Difference]: Without dead ends: 646 [2019-09-10 07:56:48,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:56:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-10 07:56:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 419. [2019-09-10 07:56:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-10 07:56:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 527 transitions. [2019-09-10 07:56:48,994 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 527 transitions. Word has length 88 [2019-09-10 07:56:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:48,994 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 527 transitions. [2019-09-10 07:56:48,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:56:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 527 transitions. [2019-09-10 07:56:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:56:48,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:48,995 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] [2019-09-10 07:56:48,995 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash 747869654, now seen corresponding path program 1 times [2019-09-10 07:56:48,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:48,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:49,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:49,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:56:49,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:49,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:56:49,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:56:49,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:56:49,546 INFO L87 Difference]: Start difference. First operand 419 states and 527 transitions. Second operand 13 states. [2019-09-10 07:56:50,020 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-10 07:56:50,155 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-10 07:56:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:51,181 INFO L93 Difference]: Finished difference Result 1755 states and 2454 transitions. [2019-09-10 07:56:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:56:51,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-10 07:56:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:51,184 INFO L225 Difference]: With dead ends: 1755 [2019-09-10 07:56:51,184 INFO L226 Difference]: Without dead ends: 1755 [2019-09-10 07:56:51,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:56:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-10 07:56:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 395. [2019-09-10 07:56:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-10 07:56:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 496 transitions. [2019-09-10 07:56:51,195 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 496 transitions. Word has length 88 [2019-09-10 07:56:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:51,195 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 496 transitions. [2019-09-10 07:56:51,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:56:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 496 transitions. [2019-09-10 07:56:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:56:51,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:51,196 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] [2019-09-10 07:56:51,197 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:51,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -493449678, now seen corresponding path program 1 times [2019-09-10 07:56:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:51,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:51,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:51,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:56:51,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:51,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:56:51,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:56:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:56:51,574 INFO L87 Difference]: Start difference. First operand 395 states and 496 transitions. Second operand 12 states. [2019-09-10 07:56:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:52,905 INFO L93 Difference]: Finished difference Result 1431 states and 1990 transitions. [2019-09-10 07:56:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:56:52,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-10 07:56:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:52,907 INFO L225 Difference]: With dead ends: 1431 [2019-09-10 07:56:52,907 INFO L226 Difference]: Without dead ends: 1431 [2019-09-10 07:56:52,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-10 07:56:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 361. [2019-09-10 07:56:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-10 07:56:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 454 transitions. [2019-09-10 07:56:52,917 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 454 transitions. Word has length 88 [2019-09-10 07:56:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:52,917 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 454 transitions. [2019-09-10 07:56:52,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:56:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2019-09-10 07:56:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:56:52,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:52,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:52,919 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:52,919 INFO L82 PathProgramCache]: Analyzing trace with hash 479313184, now seen corresponding path program 1 times [2019-09-10 07:56:52,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:52,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:52,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:53,064 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 07:56:53,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:53,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:53,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:53,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:53,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:53,066 INFO L87 Difference]: Start difference. First operand 361 states and 454 transitions. Second operand 9 states. [2019-09-10 07:56:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:53,989 INFO L93 Difference]: Finished difference Result 827 states and 1114 transitions. [2019-09-10 07:56:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:53,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:56:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:53,990 INFO L225 Difference]: With dead ends: 827 [2019-09-10 07:56:53,990 INFO L226 Difference]: Without dead ends: 827 [2019-09-10 07:56:53,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-10 07:56:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 361. [2019-09-10 07:56:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-10 07:56:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 452 transitions. [2019-09-10 07:56:53,997 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 452 transitions. Word has length 88 [2019-09-10 07:56:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:53,998 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 452 transitions. [2019-09-10 07:56:53,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 452 transitions. [2019-09-10 07:56:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:56:53,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:53,999 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] [2019-09-10 07:56:53,999 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash -134912059, now seen corresponding path program 1 times [2019-09-10 07:56:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:54,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:54,365 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 07:56:54,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:56:54,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:54,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:56:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:56:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:56:54,366 INFO L87 Difference]: Start difference. First operand 361 states and 452 transitions. Second operand 11 states. [2019-09-10 07:56:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:54,924 INFO L93 Difference]: Finished difference Result 699 states and 922 transitions. [2019-09-10 07:56:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:56:54,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-10 07:56:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:54,926 INFO L225 Difference]: With dead ends: 699 [2019-09-10 07:56:54,926 INFO L226 Difference]: Without dead ends: 699 [2019-09-10 07:56:54,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:56:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-10 07:56:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 345. [2019-09-10 07:56:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-10 07:56:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 431 transitions. [2019-09-10 07:56:54,932 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 431 transitions. Word has length 88 [2019-09-10 07:56:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:54,933 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 431 transitions. [2019-09-10 07:56:54,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:56:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 431 transitions. [2019-09-10 07:56:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:56:54,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:54,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:54,934 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1795581947, now seen corresponding path program 1 times [2019-09-10 07:56:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:54,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:54,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:55,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:55,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:56:55,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:55,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:56:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:56:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:56:55,561 INFO L87 Difference]: Start difference. First operand 345 states and 431 transitions. Second operand 14 states. [2019-09-10 07:56:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:56,866 INFO L93 Difference]: Finished difference Result 742 states and 1012 transitions. [2019-09-10 07:56:56,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:56:56,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-10 07:56:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:56,868 INFO L225 Difference]: With dead ends: 742 [2019-09-10 07:56:56,868 INFO L226 Difference]: Without dead ends: 742 [2019-09-10 07:56:56,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:56:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-10 07:56:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 325. [2019-09-10 07:56:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-10 07:56:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 407 transitions. [2019-09-10 07:56:56,874 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 407 transitions. Word has length 89 [2019-09-10 07:56:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:56,874 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 407 transitions. [2019-09-10 07:56:56,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:56:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 407 transitions. [2019-09-10 07:56:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:56:56,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:56,875 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] [2019-09-10 07:56:56,875 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash -842661870, now seen corresponding path program 1 times [2019-09-10 07:56:56,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:56,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:57,438 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 07:56:57,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:57,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:56:57,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:57,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:56:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:56:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:56:57,439 INFO L87 Difference]: Start difference. First operand 325 states and 407 transitions. Second operand 15 states. [2019-09-10 07:56:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:58,857 INFO L93 Difference]: Finished difference Result 506 states and 656 transitions. [2019-09-10 07:56:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:56:58,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-09-10 07:56:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:58,866 INFO L225 Difference]: With dead ends: 506 [2019-09-10 07:56:58,866 INFO L226 Difference]: Without dead ends: 503 [2019-09-10 07:56:58,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:56:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-10 07:56:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 315. [2019-09-10 07:56:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-10 07:56:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 396 transitions. [2019-09-10 07:56:58,871 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 396 transitions. Word has length 89 [2019-09-10 07:56:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:58,872 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 396 transitions. [2019-09-10 07:56:58,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:56:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 396 transitions. [2019-09-10 07:56:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:56:58,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:58,873 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] [2019-09-10 07:56:58,873 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash -898185746, now seen corresponding path program 1 times [2019-09-10 07:56:58,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:58,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:58,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:58,992 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 07:56:58,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:58,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:58,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:58,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:58,993 INFO L87 Difference]: Start difference. First operand 315 states and 396 transitions. Second operand 9 states. [2019-09-10 07:56:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:59,800 INFO L93 Difference]: Finished difference Result 507 states and 655 transitions. [2019-09-10 07:56:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:56:59,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:56:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:59,803 INFO L225 Difference]: With dead ends: 507 [2019-09-10 07:56:59,803 INFO L226 Difference]: Without dead ends: 507 [2019-09-10 07:56:59,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:56:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-10 07:56:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 315. [2019-09-10 07:56:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-10 07:56:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 395 transitions. [2019-09-10 07:56:59,810 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 395 transitions. Word has length 89 [2019-09-10 07:56:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:59,810 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 395 transitions. [2019-09-10 07:56:59,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 395 transitions. [2019-09-10 07:56:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:56:59,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:59,811 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] [2019-09-10 07:56:59,811 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash -887818152, now seen corresponding path program 1 times [2019-09-10 07:56:59,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:59,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:59,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:59,959 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 07:56:59,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:59,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:59,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:59,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:59,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:59,960 INFO L87 Difference]: Start difference. First operand 315 states and 395 transitions. Second operand 9 states. [2019-09-10 07:57:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:00,756 INFO L93 Difference]: Finished difference Result 507 states and 653 transitions. [2019-09-10 07:57:00,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:57:00,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:57:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:00,758 INFO L225 Difference]: With dead ends: 507 [2019-09-10 07:57:00,758 INFO L226 Difference]: Without dead ends: 507 [2019-09-10 07:57:00,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:57:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-10 07:57:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 315. [2019-09-10 07:57:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-10 07:57:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2019-09-10 07:57:00,764 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 89 [2019-09-10 07:57:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:00,765 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2019-09-10 07:57:00,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:57:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2019-09-10 07:57:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:57:00,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:00,766 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] [2019-09-10 07:57:00,766 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 576556054, now seen corresponding path program 1 times [2019-09-10 07:57:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:00,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:00,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:01,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:01,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:57:01,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:01,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:57:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:57:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:57:01,213 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 13 states. [2019-09-10 07:57:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:02,656 INFO L93 Difference]: Finished difference Result 1059 states and 1449 transitions. [2019-09-10 07:57:02,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:57:02,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-10 07:57:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:02,659 INFO L225 Difference]: With dead ends: 1059 [2019-09-10 07:57:02,659 INFO L226 Difference]: Without dead ends: 1059 [2019-09-10 07:57:02,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:57:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-09-10 07:57:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 309. [2019-09-10 07:57:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-10 07:57:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 387 transitions. [2019-09-10 07:57:02,665 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 387 transitions. Word has length 90 [2019-09-10 07:57:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:02,666 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 387 transitions. [2019-09-10 07:57:02,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:57:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 387 transitions. [2019-09-10 07:57:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:57:02,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:02,667 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] [2019-09-10 07:57:02,667 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1811224677, now seen corresponding path program 1 times [2019-09-10 07:57:02,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:02,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:02,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:02,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:02,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:03,266 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 07:57:03,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:03,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:57:03,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:03,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:57:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:57:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:57:03,268 INFO L87 Difference]: Start difference. First operand 309 states and 387 transitions. Second operand 15 states. [2019-09-10 07:57:03,920 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 07:57:04,079 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:57:04,222 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:57:04,359 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:57:04,528 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:57:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:04,870 INFO L93 Difference]: Finished difference Result 282 states and 357 transitions. [2019-09-10 07:57:04,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:57:04,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-09-10 07:57:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:04,871 INFO L225 Difference]: With dead ends: 282 [2019-09-10 07:57:04,872 INFO L226 Difference]: Without dead ends: 279 [2019-09-10 07:57:04,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:57:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-10 07:57:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2019-09-10 07:57:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-10 07:57:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 354 transitions. [2019-09-10 07:57:04,876 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 354 transitions. Word has length 91 [2019-09-10 07:57:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:04,876 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 354 transitions. [2019-09-10 07:57:04,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:57:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 354 transitions. [2019-09-10 07:57:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:57:04,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:04,877 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] [2019-09-10 07:57:04,877 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1377085776, now seen corresponding path program 1 times [2019-09-10 07:57:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:04,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:04,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:04,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:06,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:06,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 07:57:06,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:06,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:57:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:57:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:57:06,776 INFO L87 Difference]: Start difference. First operand 279 states and 354 transitions. Second operand 28 states. [2019-09-10 07:57:06,994 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:57:07,697 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-09-10 07:57:07,860 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-10 07:57:08,064 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 07:57:08,265 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:57:08,541 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:57:09,071 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:57:09,477 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:57:09,929 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-10 07:57:10,438 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 07:57:10,814 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-10 07:57:11,175 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-10 07:57:11,366 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:57:11,898 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:57:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:13,942 INFO L93 Difference]: Finished difference Result 471 states and 615 transitions. [2019-09-10 07:57:13,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:57:13,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-09-10 07:57:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:13,944 INFO L225 Difference]: With dead ends: 471 [2019-09-10 07:57:13,944 INFO L226 Difference]: Without dead ends: 471 [2019-09-10 07:57:13,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=453, Invalid=2409, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:57:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-10 07:57:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 284. [2019-09-10 07:57:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-10 07:57:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2019-09-10 07:57:13,948 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 91 [2019-09-10 07:57:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:13,948 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2019-09-10 07:57:13,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:57:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2019-09-10 07:57:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:57:13,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:13,949 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] [2019-09-10 07:57:13,949 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash 122315771, now seen corresponding path program 1 times [2019-09-10 07:57:13,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:13,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:13,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:13,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:13,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:14,329 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 07:57:14,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:14,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:57:14,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:14,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:57:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:57:14,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:57:14,330 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand 12 states. [2019-09-10 07:57:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:14,821 INFO L93 Difference]: Finished difference Result 433 states and 576 transitions. [2019-09-10 07:57:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:57:14,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-09-10 07:57:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:14,824 INFO L225 Difference]: With dead ends: 433 [2019-09-10 07:57:14,824 INFO L226 Difference]: Without dead ends: 433 [2019-09-10 07:57:14,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:57:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-10 07:57:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 255. [2019-09-10 07:57:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 07:57:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 328 transitions. [2019-09-10 07:57:14,828 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 328 transitions. Word has length 92 [2019-09-10 07:57:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:14,832 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 328 transitions. [2019-09-10 07:57:14,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:57:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 328 transitions. [2019-09-10 07:57:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:57:14,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:14,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:14,834 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1222425115, now seen corresponding path program 1 times [2019-09-10 07:57:14,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:14,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:14,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:14,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:14,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:14,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:14,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:14,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:14,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:14,917 INFO L87 Difference]: Start difference. First operand 255 states and 328 transitions. Second operand 3 states. [2019-09-10 07:57:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:14,946 INFO L93 Difference]: Finished difference Result 375 states and 500 transitions. [2019-09-10 07:57:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:14,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 07:57:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:14,947 INFO L225 Difference]: With dead ends: 375 [2019-09-10 07:57:14,947 INFO L226 Difference]: Without dead ends: 375 [2019-09-10 07:57:14,948 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 07:57:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-10 07:57:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-09-10 07:57:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 07:57:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 499 transitions. [2019-09-10 07:57:14,952 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 499 transitions. Word has length 118 [2019-09-10 07:57:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:14,953 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 499 transitions. [2019-09-10 07:57:14,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 499 transitions. [2019-09-10 07:57:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:14,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:14,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:14,954 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash -547792204, now seen corresponding path program 1 times [2019-09-10 07:57:14,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:14,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:14,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:14,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:14,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:15,055 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 07:57:15,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:15,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:57:15,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:15,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:57:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:57:15,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:57:15,057 INFO L87 Difference]: Start difference. First operand 373 states and 499 transitions. Second operand 7 states. [2019-09-10 07:57:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:15,480 INFO L93 Difference]: Finished difference Result 895 states and 1234 transitions. [2019-09-10 07:57:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:57:15,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 07:57:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:15,482 INFO L225 Difference]: With dead ends: 895 [2019-09-10 07:57:15,482 INFO L226 Difference]: Without dead ends: 895 [2019-09-10 07:57:15,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:57:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-09-10 07:57:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 433. [2019-09-10 07:57:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-09-10 07:57:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 581 transitions. [2019-09-10 07:57:15,489 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 581 transitions. Word has length 120 [2019-09-10 07:57:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:15,490 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 581 transitions. [2019-09-10 07:57:15,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:57:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 581 transitions. [2019-09-10 07:57:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:15,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:15,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:15,491 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 479664936, now seen corresponding path program 1 times [2019-09-10 07:57:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:15,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:15,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:15,598 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 07:57:15,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:15,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:57:15,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:15,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:57:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:57:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:57:15,599 INFO L87 Difference]: Start difference. First operand 433 states and 581 transitions. Second operand 7 states. [2019-09-10 07:57:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:16,061 INFO L93 Difference]: Finished difference Result 1559 states and 2182 transitions. [2019-09-10 07:57:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:57:16,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 07:57:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:16,064 INFO L225 Difference]: With dead ends: 1559 [2019-09-10 07:57:16,064 INFO L226 Difference]: Without dead ends: 1559 [2019-09-10 07:57:16,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:57:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-09-10 07:57:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 777. [2019-09-10 07:57:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-10 07:57:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1079 transitions. [2019-09-10 07:57:16,075 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1079 transitions. Word has length 120 [2019-09-10 07:57:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:16,075 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1079 transitions. [2019-09-10 07:57:16,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:57:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1079 transitions. [2019-09-10 07:57:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:16,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:16,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:16,077 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2044549086, now seen corresponding path program 1 times [2019-09-10 07:57:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:16,186 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 07:57:16,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:16,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:57:16,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:16,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:57:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:57:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:57:16,189 INFO L87 Difference]: Start difference. First operand 777 states and 1079 transitions. Second operand 7 states. [2019-09-10 07:57:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:16,642 INFO L93 Difference]: Finished difference Result 2983 states and 4206 transitions. [2019-09-10 07:57:16,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:57:16,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 07:57:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:16,647 INFO L225 Difference]: With dead ends: 2983 [2019-09-10 07:57:16,647 INFO L226 Difference]: Without dead ends: 2983 [2019-09-10 07:57:16,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:57:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2019-09-10 07:57:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1505. [2019-09-10 07:57:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-09-10 07:57:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2131 transitions. [2019-09-10 07:57:16,669 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2131 transitions. Word has length 120 [2019-09-10 07:57:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:16,669 INFO L475 AbstractCegarLoop]: Abstraction has 1505 states and 2131 transitions. [2019-09-10 07:57:16,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:57:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2131 transitions. [2019-09-10 07:57:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:16,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:16,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:16,671 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1636775367, now seen corresponding path program 1 times [2019-09-10 07:57:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:16,752 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 07:57:16,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:16,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:16,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:16,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:16,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:16,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:16,753 INFO L87 Difference]: Start difference. First operand 1505 states and 2131 transitions. Second operand 3 states. [2019-09-10 07:57:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:16,788 INFO L93 Difference]: Finished difference Result 2227 states and 3152 transitions. [2019-09-10 07:57:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:16,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 07:57:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:16,791 INFO L225 Difference]: With dead ends: 2227 [2019-09-10 07:57:16,791 INFO L226 Difference]: Without dead ends: 2227 [2019-09-10 07:57:16,791 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 07:57:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-09-10 07:57:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2225. [2019-09-10 07:57:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2019-09-10 07:57:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3151 transitions. [2019-09-10 07:57:16,806 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3151 transitions. Word has length 120 [2019-09-10 07:57:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:16,806 INFO L475 AbstractCegarLoop]: Abstraction has 2225 states and 3151 transitions. [2019-09-10 07:57:16,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3151 transitions. [2019-09-10 07:57:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:16,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:16,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:16,808 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:16,808 INFO L82 PathProgramCache]: Analyzing trace with hash 897035046, now seen corresponding path program 1 times [2019-09-10 07:57:16,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:16,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:16,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:16,852 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 07:57:16,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:16,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:16,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:16,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:16,853 INFO L87 Difference]: Start difference. First operand 2225 states and 3151 transitions. Second operand 3 states. [2019-09-10 07:57:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:16,883 INFO L93 Difference]: Finished difference Result 4099 states and 5732 transitions. [2019-09-10 07:57:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:16,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 07:57:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:16,887 INFO L225 Difference]: With dead ends: 4099 [2019-09-10 07:57:16,887 INFO L226 Difference]: Without dead ends: 4099 [2019-09-10 07:57:16,888 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 07:57:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2019-09-10 07:57:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4097. [2019-09-10 07:57:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4097 states. [2019-09-10 07:57:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5731 transitions. [2019-09-10 07:57:16,915 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5731 transitions. Word has length 120 [2019-09-10 07:57:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:16,916 INFO L475 AbstractCegarLoop]: Abstraction has 4097 states and 5731 transitions. [2019-09-10 07:57:16,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5731 transitions. [2019-09-10 07:57:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:16,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:16,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:16,918 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash 268696988, now seen corresponding path program 1 times [2019-09-10 07:57:16,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:17,029 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 07:57:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:57:17,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:17,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:57:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:57:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:57:17,031 INFO L87 Difference]: Start difference. First operand 4097 states and 5731 transitions. Second operand 7 states. [2019-09-10 07:57:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:17,507 INFO L93 Difference]: Finished difference Result 15015 states and 20878 transitions. [2019-09-10 07:57:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:57:17,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 07:57:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:17,520 INFO L225 Difference]: With dead ends: 15015 [2019-09-10 07:57:17,521 INFO L226 Difference]: Without dead ends: 15015 [2019-09-10 07:57:17,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:57:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2019-09-10 07:57:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 8545. [2019-09-10 07:57:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2019-09-10 07:57:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 11995 transitions. [2019-09-10 07:57:17,620 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 11995 transitions. Word has length 120 [2019-09-10 07:57:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:17,621 INFO L475 AbstractCegarLoop]: Abstraction has 8545 states and 11995 transitions. [2019-09-10 07:57:17,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:57:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 11995 transitions. [2019-09-10 07:57:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:57:17,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:17,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:17,623 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1180739922, now seen corresponding path program 1 times [2019-09-10 07:57:17,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:17,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:17,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:17,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:17,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:57:17,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:17,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:57:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:57:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:57:17,708 INFO L87 Difference]: Start difference. First operand 8545 states and 11995 transitions. Second operand 7 states. [2019-09-10 07:57:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:18,231 INFO L93 Difference]: Finished difference Result 24359 states and 34072 transitions. [2019-09-10 07:57:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:57:18,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 07:57:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:18,251 INFO L225 Difference]: With dead ends: 24359 [2019-09-10 07:57:18,252 INFO L226 Difference]: Without dead ends: 24359 [2019-09-10 07:57:18,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:57:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24359 states. [2019-09-10 07:57:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24359 to 14225. [2019-09-10 07:57:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14225 states. [2019-09-10 07:57:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14225 states to 14225 states and 20003 transitions. [2019-09-10 07:57:18,423 INFO L78 Accepts]: Start accepts. Automaton has 14225 states and 20003 transitions. Word has length 120 [2019-09-10 07:57:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:18,423 INFO L475 AbstractCegarLoop]: Abstraction has 14225 states and 20003 transitions. [2019-09-10 07:57:18,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:57:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 14225 states and 20003 transitions. [2019-09-10 07:57:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:57:18,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:18,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:18,425 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -858738670, now seen corresponding path program 1 times [2019-09-10 07:57:18,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:18,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:18,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:18,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:18,516 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 07:57:18,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:57:18,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:18,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:57:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:57:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:57:18,517 INFO L87 Difference]: Start difference. First operand 14225 states and 20003 transitions. Second operand 6 states. [2019-09-10 07:57:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:18,636 INFO L93 Difference]: Finished difference Result 23573 states and 32614 transitions. [2019-09-10 07:57:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:57:18,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-10 07:57:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:18,656 INFO L225 Difference]: With dead ends: 23573 [2019-09-10 07:57:18,656 INFO L226 Difference]: Without dead ends: 23573 [2019-09-10 07:57:18,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:57:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23573 states. [2019-09-10 07:57:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23573 to 14417. [2019-09-10 07:57:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14417 states. [2019-09-10 07:57:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14417 states to 14417 states and 20131 transitions. [2019-09-10 07:57:18,859 INFO L78 Accepts]: Start accepts. Automaton has 14417 states and 20131 transitions. Word has length 121 [2019-09-10 07:57:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:18,859 INFO L475 AbstractCegarLoop]: Abstraction has 14417 states and 20131 transitions. [2019-09-10 07:57:18,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:57:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14417 states and 20131 transitions. [2019-09-10 07:57:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:57:18,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:18,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:18,862 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:18,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1840238826, now seen corresponding path program 1 times [2019-09-10 07:57:18,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:18,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:18,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:18,927 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 07:57:18,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:18,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:18,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:18,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:18,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:18,928 INFO L87 Difference]: Start difference. First operand 14417 states and 20131 transitions. Second operand 3 states. [2019-09-10 07:57:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:18,965 INFO L93 Difference]: Finished difference Result 13555 states and 18692 transitions. [2019-09-10 07:57:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:18,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 07:57:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:18,976 INFO L225 Difference]: With dead ends: 13555 [2019-09-10 07:57:18,976 INFO L226 Difference]: Without dead ends: 13555 [2019-09-10 07:57:18,976 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 07:57:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2019-09-10 07:57:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 10305. [2019-09-10 07:57:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10305 states. [2019-09-10 07:57:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10305 states to 10305 states and 14197 transitions. [2019-09-10 07:57:19,060 INFO L78 Accepts]: Start accepts. Automaton has 10305 states and 14197 transitions. Word has length 121 [2019-09-10 07:57:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:19,061 INFO L475 AbstractCegarLoop]: Abstraction has 10305 states and 14197 transitions. [2019-09-10 07:57:19,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10305 states and 14197 transitions. [2019-09-10 07:57:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 07:57:19,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:19,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:19,062 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash -878954728, now seen corresponding path program 1 times [2019-09-10 07:57:19,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:19,196 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 07:57:19,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:19,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:19,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:19,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:19,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:19,198 INFO L87 Difference]: Start difference. First operand 10305 states and 14197 transitions. Second operand 3 states. [2019-09-10 07:57:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:19,241 INFO L93 Difference]: Finished difference Result 16139 states and 22256 transitions. [2019-09-10 07:57:19,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:19,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 07:57:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:19,255 INFO L225 Difference]: With dead ends: 16139 [2019-09-10 07:57:19,255 INFO L226 Difference]: Without dead ends: 16139 [2019-09-10 07:57:19,255 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 07:57:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2019-09-10 07:57:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 15273. [2019-09-10 07:57:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15273 states. [2019-09-10 07:57:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 21211 transitions. [2019-09-10 07:57:19,369 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 21211 transitions. Word has length 122 [2019-09-10 07:57:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:19,369 INFO L475 AbstractCegarLoop]: Abstraction has 15273 states and 21211 transitions. [2019-09-10 07:57:19,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 21211 transitions. [2019-09-10 07:57:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:57:19,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:19,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:19,371 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 305451551, now seen corresponding path program 1 times [2019-09-10 07:57:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:19,423 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 07:57:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:19,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:19,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:19,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:19,424 INFO L87 Difference]: Start difference. First operand 15273 states and 21211 transitions. Second operand 3 states. [2019-09-10 07:57:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:19,471 INFO L93 Difference]: Finished difference Result 14663 states and 20192 transitions. [2019-09-10 07:57:19,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:19,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 07:57:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:19,483 INFO L225 Difference]: With dead ends: 14663 [2019-09-10 07:57:19,483 INFO L226 Difference]: Without dead ends: 14663 [2019-09-10 07:57:19,483 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 07:57:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14663 states. [2019-09-10 07:57:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14663 to 14661. [2019-09-10 07:57:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14661 states. [2019-09-10 07:57:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14661 states to 14661 states and 20191 transitions. [2019-09-10 07:57:19,605 INFO L78 Accepts]: Start accepts. Automaton has 14661 states and 20191 transitions. Word has length 123 [2019-09-10 07:57:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:19,606 INFO L475 AbstractCegarLoop]: Abstraction has 14661 states and 20191 transitions. [2019-09-10 07:57:19,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 14661 states and 20191 transitions. [2019-09-10 07:57:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:57:19,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:19,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:19,607 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1983664206, now seen corresponding path program 1 times [2019-09-10 07:57:19,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:19,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:19,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:19,663 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 07:57:19,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:19,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:19,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:19,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:19,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:19,665 INFO L87 Difference]: Start difference. First operand 14661 states and 20191 transitions. Second operand 3 states. [2019-09-10 07:57:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:19,713 INFO L93 Difference]: Finished difference Result 16079 states and 22096 transitions. [2019-09-10 07:57:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:19,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 07:57:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:19,729 INFO L225 Difference]: With dead ends: 16079 [2019-09-10 07:57:19,729 INFO L226 Difference]: Without dead ends: 16079 [2019-09-10 07:57:19,729 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 07:57:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16079 states. [2019-09-10 07:57:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16079 to 16077. [2019-09-10 07:57:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16077 states. [2019-09-10 07:57:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16077 states to 16077 states and 22095 transitions. [2019-09-10 07:57:19,871 INFO L78 Accepts]: Start accepts. Automaton has 16077 states and 22095 transitions. Word has length 124 [2019-09-10 07:57:19,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:19,871 INFO L475 AbstractCegarLoop]: Abstraction has 16077 states and 22095 transitions. [2019-09-10 07:57:19,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 16077 states and 22095 transitions. [2019-09-10 07:57:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 07:57:19,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:19,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:19,875 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash 419309208, now seen corresponding path program 1 times [2019-09-10 07:57:19,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:19,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:19,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:19,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:19,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:19,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:19,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:19,944 INFO L87 Difference]: Start difference. First operand 16077 states and 22095 transitions. Second operand 3 states. [2019-09-10 07:57:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:19,990 INFO L93 Difference]: Finished difference Result 14819 states and 19996 transitions. [2019-09-10 07:57:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:19,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 07:57:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:20,006 INFO L225 Difference]: With dead ends: 14819 [2019-09-10 07:57:20,006 INFO L226 Difference]: Without dead ends: 14819 [2019-09-10 07:57:20,006 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 07:57:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14819 states. [2019-09-10 07:57:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14819 to 14457. [2019-09-10 07:57:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-09-10 07:57:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 19545 transitions. [2019-09-10 07:57:20,603 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 19545 transitions. Word has length 155 [2019-09-10 07:57:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:20,603 INFO L475 AbstractCegarLoop]: Abstraction has 14457 states and 19545 transitions. [2019-09-10 07:57:20,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 19545 transitions. [2019-09-10 07:57:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 07:57:20,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:20,606 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:20,606 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash -430845502, now seen corresponding path program 1 times [2019-09-10 07:57:20,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:20,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:20,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:20,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:20,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:20,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:20,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:20,672 INFO L87 Difference]: Start difference. First operand 14457 states and 19545 transitions. Second operand 3 states. [2019-09-10 07:57:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:20,724 INFO L93 Difference]: Finished difference Result 17555 states and 23348 transitions. [2019-09-10 07:57:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:20,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 07:57:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:20,743 INFO L225 Difference]: With dead ends: 17555 [2019-09-10 07:57:20,743 INFO L226 Difference]: Without dead ends: 17555 [2019-09-10 07:57:20,743 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 07:57:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17555 states. [2019-09-10 07:57:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17555 to 16753. [2019-09-10 07:57:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16753 states. [2019-09-10 07:57:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16753 states to 16753 states and 22387 transitions. [2019-09-10 07:57:20,880 INFO L78 Accepts]: Start accepts. Automaton has 16753 states and 22387 transitions. Word has length 156 [2019-09-10 07:57:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:20,881 INFO L475 AbstractCegarLoop]: Abstraction has 16753 states and 22387 transitions. [2019-09-10 07:57:20,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:57:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16753 states and 22387 transitions. [2019-09-10 07:57:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:57:20,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:20,884 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:20,884 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1504022855, now seen corresponding path program 1 times [2019-09-10 07:57:20,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:20,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:20,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:57:20,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:20,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:57:20,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:20,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:57:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:57:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:57:20,982 INFO L87 Difference]: Start difference. First operand 16753 states and 22387 transitions. Second operand 5 states. [2019-09-10 07:57:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:21,096 INFO L93 Difference]: Finished difference Result 28101 states and 37389 transitions. [2019-09-10 07:57:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:57:21,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 07:57:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:21,120 INFO L225 Difference]: With dead ends: 28101 [2019-09-10 07:57:21,120 INFO L226 Difference]: Without dead ends: 28101 [2019-09-10 07:57:21,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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 07:57:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2019-09-10 07:57:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 22121. [2019-09-10 07:57:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22121 states. [2019-09-10 07:57:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22121 states to 22121 states and 29555 transitions. [2019-09-10 07:57:21,294 INFO L78 Accepts]: Start accepts. Automaton has 22121 states and 29555 transitions. Word has length 157 [2019-09-10 07:57:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:21,294 INFO L475 AbstractCegarLoop]: Abstraction has 22121 states and 29555 transitions. [2019-09-10 07:57:21,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:57:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22121 states and 29555 transitions. [2019-09-10 07:57:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:57:21,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:21,299 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:21,299 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:21,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1763487301, now seen corresponding path program 1 times [2019-09-10 07:57:21,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:21,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:21,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:21,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:21,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:57:21,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:21,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:57:21,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:21,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:57:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:57:21,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:57:21,400 INFO L87 Difference]: Start difference. First operand 22121 states and 29555 transitions. Second operand 5 states. [2019-09-10 07:57:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:21,514 INFO L93 Difference]: Finished difference Result 33657 states and 44773 transitions. [2019-09-10 07:57:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:57:21,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 07:57:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:21,673 INFO L225 Difference]: With dead ends: 33657 [2019-09-10 07:57:21,673 INFO L226 Difference]: Without dead ends: 33657 [2019-09-10 07:57:21,674 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 07:57:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33657 states. [2019-09-10 07:57:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33657 to 27489. [2019-09-10 07:57:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27489 states. [2019-09-10 07:57:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 36723 transitions. [2019-09-10 07:57:21,874 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 36723 transitions. Word has length 157 [2019-09-10 07:57:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:21,874 INFO L475 AbstractCegarLoop]: Abstraction has 27489 states and 36723 transitions. [2019-09-10 07:57:21,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:57:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 36723 transitions. [2019-09-10 07:57:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:57:21,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:21,879 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:21,879 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 7265973, now seen corresponding path program 1 times [2019-09-10 07:57:21,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:21,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:57:21,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:57:21,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:21,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:57:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:57:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:57:21,988 INFO L87 Difference]: Start difference. First operand 27489 states and 36723 transitions. Second operand 5 states. [2019-09-10 07:57:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:22,123 INFO L93 Difference]: Finished difference Result 38629 states and 51389 transitions. [2019-09-10 07:57:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:57:22,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 07:57:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:22,155 INFO L225 Difference]: With dead ends: 38629 [2019-09-10 07:57:22,155 INFO L226 Difference]: Without dead ends: 38629 [2019-09-10 07:57:22,156 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 07:57:22,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38629 states. [2019-09-10 07:57:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38629 to 32857. [2019-09-10 07:57:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32857 states. [2019-09-10 07:57:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32857 states to 32857 states and 43891 transitions. [2019-09-10 07:57:22,412 INFO L78 Accepts]: Start accepts. Automaton has 32857 states and 43891 transitions. Word has length 157 [2019-09-10 07:57:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:22,412 INFO L475 AbstractCegarLoop]: Abstraction has 32857 states and 43891 transitions. [2019-09-10 07:57:22,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:57:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32857 states and 43891 transitions. [2019-09-10 07:57:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:57:22,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:22,417 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:22,417 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1974455249, now seen corresponding path program 1 times [2019-09-10 07:57:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:22,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:22,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:57:22,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:22,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:57:22,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:22,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:57:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:57:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:57:22,518 INFO L87 Difference]: Start difference. First operand 32857 states and 43891 transitions. Second operand 5 states. [2019-09-10 07:57:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:23,241 INFO L93 Difference]: Finished difference Result 43709 states and 58149 transitions. [2019-09-10 07:57:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:57:23,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 07:57:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:23,274 INFO L225 Difference]: With dead ends: 43709 [2019-09-10 07:57:23,275 INFO L226 Difference]: Without dead ends: 43709 [2019-09-10 07:57:23,275 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 07:57:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43709 states. [2019-09-10 07:57:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43709 to 38225. [2019-09-10 07:57:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38225 states. [2019-09-10 07:57:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38225 states to 38225 states and 51059 transitions. [2019-09-10 07:57:23,560 INFO L78 Accepts]: Start accepts. Automaton has 38225 states and 51059 transitions. Word has length 157 [2019-09-10 07:57:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:23,560 INFO L475 AbstractCegarLoop]: Abstraction has 38225 states and 51059 transitions. [2019-09-10 07:57:23,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:57:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 38225 states and 51059 transitions. [2019-09-10 07:57:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:57:23,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:23,566 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:23,566 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash 871075137, now seen corresponding path program 1 times [2019-09-10 07:57:23,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:23,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:57:23,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:23,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:57:23,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:23,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:57:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:57:23,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:57:23,679 INFO L87 Difference]: Start difference. First operand 38225 states and 51059 transitions. Second operand 7 states. [2019-09-10 07:57:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:24,080 INFO L93 Difference]: Finished difference Result 137483 states and 183432 transitions. [2019-09-10 07:57:24,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:57:24,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-09-10 07:57:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:24,216 INFO L225 Difference]: With dead ends: 137483 [2019-09-10 07:57:24,216 INFO L226 Difference]: Without dead ends: 137483 [2019-09-10 07:57:24,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:57:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137483 states. [2019-09-10 07:57:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137483 to 48833. [2019-09-10 07:57:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48833 states. [2019-09-10 07:57:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48833 states to 48833 states and 65075 transitions. [2019-09-10 07:57:25,268 INFO L78 Accepts]: Start accepts. Automaton has 48833 states and 65075 transitions. Word has length 157 [2019-09-10 07:57:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:25,269 INFO L475 AbstractCegarLoop]: Abstraction has 48833 states and 65075 transitions. [2019-09-10 07:57:25,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:57:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 48833 states and 65075 transitions. [2019-09-10 07:57:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 07:57:25,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:25,275 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:25,276 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1636485859, now seen corresponding path program 1 times [2019-09-10 07:57:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:25,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:25,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 07:57:25,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:25,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:57:25,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:25,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:57:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:57:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:57:25,404 INFO L87 Difference]: Start difference. First operand 48833 states and 65075 transitions. Second operand 9 states. [2019-09-10 07:57:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:26,144 INFO L93 Difference]: Finished difference Result 98909 states and 131382 transitions. [2019-09-10 07:57:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:57:26,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-10 07:57:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:26,246 INFO L225 Difference]: With dead ends: 98909 [2019-09-10 07:57:26,246 INFO L226 Difference]: Without dead ends: 98909 [2019-09-10 07:57:26,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:57:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98909 states. [2019-09-10 07:57:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98909 to 48833. [2019-09-10 07:57:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48833 states. [2019-09-10 07:57:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48833 states to 48833 states and 65073 transitions. [2019-09-10 07:57:28,076 INFO L78 Accepts]: Start accepts. Automaton has 48833 states and 65073 transitions. Word has length 158 [2019-09-10 07:57:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:28,076 INFO L475 AbstractCegarLoop]: Abstraction has 48833 states and 65073 transitions. [2019-09-10 07:57:28,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:57:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 48833 states and 65073 transitions. [2019-09-10 07:57:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 07:57:28,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:28,083 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:28,083 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash -831728092, now seen corresponding path program 1 times [2019-09-10 07:57:28,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:28,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:57:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:57:28,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:57:28,212 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2019-09-10 07:57:28,214 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [206], [208], [210], [213], [216], [219], [221], [223], [226], [229], [232], [234], [236], [239], [243], [246], [249], [253], [255], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [327], [330], [333], [337], [339], [341], [344], [345], [347], [349], [351], [356], [358], [361], [374], [376], [379], [382], [384], [399], [401], [404], [407], [409], [424], [426], [429], [432], [434], [449], [451], [454], [457], [459], [474], [476], [479], [482], [484], [2376], [2377], [2381], [2382], [2383] [2019-09-10 07:57:28,261 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:57:28,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:57:28,513 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:57:29,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:57:29,773 INFO L272 AbstractInterpreter]: Visited 148 different actions 935 times. Merged at 57 different actions 682 times. Widened at 29 different actions 143 times. Performed 3490 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3490 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 108 fixpoints after 29 different actions. Largest state had 285 variables. [2019-09-10 07:57:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:29,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:57:29,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:57:29,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:57:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:29,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:57:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:30,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:57:30,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:57:30,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:31,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:57:31,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:57:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:57:32,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 25 [2019-09-10 07:57:32,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:57:32,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:57:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:57:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:57:32,742 INFO L87 Difference]: Start difference. First operand 48833 states and 65073 transitions. Second operand 15 states. [2019-09-10 07:57:33,119 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 07:57:33,952 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:57:34,292 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:35,617 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:36,050 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:57:36,776 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:57:37,079 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:37,460 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:57:37,868 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:57:38,126 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:38,507 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:38,812 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:39,160 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:57:39,574 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:39,835 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:40,084 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:40,479 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:57:40,769 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:41,034 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:41,289 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:57:41,542 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:57:42,050 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:42,519 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:42,967 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:57:43,404 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:57:45,888 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:57:46,259 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:57:46,519 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:46,935 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:57:47,887 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:57:48,133 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:57:48,516 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:57:48,866 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:57:49,171 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:57:49,512 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:57:49,815 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:57:50,243 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:57:50,847 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:57:51,174 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:57:51,666 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:57:51,829 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:57:52,366 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:57:52,611 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:57:52,837 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:57:53,032 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:57:53,275 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:57:53,497 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:57:53,748 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:57:54,279 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:57:54,543 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:57:54,764 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:57:54,974 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:57:55,346 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:57:55,608 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:57:56,227 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:57:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:56,647 INFO L93 Difference]: Finished difference Result 388837 states and 515535 transitions. [2019-09-10 07:57:56,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 07:57:56,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 160 [2019-09-10 07:57:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:57,399 INFO L225 Difference]: With dead ends: 388837 [2019-09-10 07:57:57,399 INFO L226 Difference]: Without dead ends: 388837 [2019-09-10 07:57:57,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 273 SyntacticMatches, 29 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=1712, Invalid=5094, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 07:57:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388837 states. [2019-09-10 07:58:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388837 to 171563. [2019-09-10 07:58:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171563 states. [2019-09-10 07:58:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171563 states to 171563 states and 229239 transitions. [2019-09-10 07:58:03,012 INFO L78 Accepts]: Start accepts. Automaton has 171563 states and 229239 transitions. Word has length 160 [2019-09-10 07:58:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:03,012 INFO L475 AbstractCegarLoop]: Abstraction has 171563 states and 229239 transitions. [2019-09-10 07:58:03,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:58:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 171563 states and 229239 transitions. [2019-09-10 07:58:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 07:58:03,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:03,040 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:03,041 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1460892393, now seen corresponding path program 1 times [2019-09-10 07:58:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:03,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:03,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:03,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:03,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-10 07:58:03,368 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [206], [208], [210], [213], [216], [219], [221], [223], [226], [229], [232], [234], [236], [239], [243], [246], [249], [253], [255], [258], [261], [264], [269], [271], [274], [282], [284], [287], [290], [295], [297], [300], [308], [310], [313], [321], [323], [325], [327], [330], [337], [339], [341], [344], [345], [347], [349], [358], [361], [365], [374], [376], [379], [382], [384], [399], [401], [404], [407], [409], [417], [420], [426], [429], [432], [434], [449], [451], [454], [457], [459], [467], [470], [476], [479], [482], [484], [2376], [2377], [2381], [2382], [2383] [2019-09-10 07:58:03,384 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:03,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:03,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:04,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:04,146 INFO L272 AbstractInterpreter]: Visited 150 different actions 760 times. Merged at 59 different actions 537 times. Widened at 21 different actions 96 times. Performed 2858 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2858 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 58 fixpoints after 16 different actions. Largest state had 285 variables. [2019-09-10 07:58:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:04,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:04,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:04,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:04,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:04,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:04,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:58:04,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:04,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:04,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:05,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:05,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:07,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:07,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:58:07,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:58:07,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:58:07,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:58:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:58:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:58:07,490 INFO L87 Difference]: Start difference. First operand 171563 states and 229239 transitions. Second operand 21 states. [2019-09-10 07:58:07,792 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:58:08,403 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:58:09,131 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:09,382 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:58:09,748 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:58:09,990 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:58:10,583 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:58:10,889 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:58:11,753 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:58:12,201 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:58:12,483 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 07:58:13,163 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:58:13,453 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:58:13,813 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:58:14,259 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:58:14,592 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:58:15,405 WARN L188 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:58:15,711 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:58:17,196 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:58:17,509 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:58:17,920 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:58:18,262 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:58:18,633 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:58:19,048 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:19,599 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:58:19,938 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:58:20,320 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:58:20,738 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:58:21,105 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:21,438 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:58:21,734 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:58:22,699 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:58:23,094 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:58:23,476 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:58:23,878 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:58:24,325 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:58:24,784 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:58:25,129 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 07:58:25,545 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:58:25,992 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:58:26,446 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:58:26,769 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 07:58:27,563 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:28,050 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:58:28,495 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:58:29,053 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:58:29,502 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 07:58:29,925 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:58:30,210 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 07:58:30,606 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:31,345 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:58:31,680 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:58:34,176 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:58:34,698 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:58:35,122 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:58:35,447 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:58:35,865 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 07:58:36,278 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:58:36,826 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:58:37,239 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:58:37,590 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:58:38,005 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:58:38,331 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:58:38,832 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 07:58:39,198 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:58:39,588 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:58:39,927 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:58:40,448 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:58:40,821 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:58:41,240 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:58:41,695 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:58:42,123 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:58:42,818 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:58:43,220 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 07:58:43,488 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:58:43,982 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 07:58:44,412 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:58:44,835 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:45,220 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:58:45,674 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:58:46,068 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:58:46,444 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:58:46,826 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:58:47,193 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:58:47,627 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:58:48,209 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:58:48,656 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:49,099 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:58:49,826 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:58:50,357 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:58:50,766 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:58:51,114 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:58:51,604 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 07:58:52,340 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:58:52,777 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:58:53,112 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:58:53,707 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:58:54,100 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:58:54,449 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:58:55,155 WARN L188 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:58:55,599 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:56,099 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:58:56,482 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:58:56,892 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 07:58:57,406 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:58:57,870 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:58:58,241 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:58:58,620 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:58:59,236 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:58:59,686 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:58:59,988 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:00,380 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:59:00,883 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:59:01,264 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:01,700 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:59:02,143 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 07:59:02,945 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 07:59:03,377 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:03,770 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:59:04,410 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:59:05,608 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 07:59:06,481 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:59:07,525 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:59:07,931 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:59:08,442 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:08,842 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 07:59:09,610 WARN L188 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:59:10,060 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:59:10,473 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:59:10,899 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:59:11,345 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:59:11,677 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:59:12,072 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:59:12,404 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:59:12,827 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:59:13,271 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:59:13,777 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 07:59:14,307 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:59:14,730 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:59:15,096 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:59:15,461 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:59:15,939 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:59:16,457 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 07:59:16,823 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:59:17,251 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:59:17,578 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:59:17,942 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:18,434 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:59:18,885 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:19,326 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:19,669 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:59:23,538 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 07:59:24,044 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:59:24,386 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:59:24,885 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 07:59:25,271 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:59:25,667 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:59:25,970 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 07:59:26,479 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 07:59:26,853 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:59:27,233 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:59:27,629 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:59:27,973 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:59:28,313 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:59:28,734 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:59:29,105 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:59:29,410 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:59:29,860 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:59:30,272 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:59:30,669 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:59:31,096 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:31,572 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 07:59:32,009 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 07:59:32,370 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:59:33,499 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:59:34,024 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 07:59:34,418 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:59:34,793 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:59:35,088 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:59:35,556 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:59:35,907 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:36,285 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:36,653 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:59:37,002 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:37,420 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 07:59:37,764 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:38,132 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:38,496 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:38,809 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:59:39,137 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:39,467 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:59:39,943 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-09-10 07:59:40,369 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:59:40,807 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:59:41,229 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 07:59:41,582 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:59:42,004 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:42,508 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 07:59:42,987 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:43,476 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:59:43,922 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:44,727 WARN L188 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 07:59:45,144 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:45,622 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 07:59:46,922 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:47,593 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:59:48,152 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:59:48,556 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:59:49,024 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:59:49,453 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:59:49,987 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:50,531 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 07:59:51,049 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:59:51,570 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:51,971 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:52,454 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:52,937 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:53,343 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 07:59:53,790 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:54,250 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:59:54,722 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 07:59:55,180 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:55,579 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:56,070 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 07:59:56,510 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:59:56,912 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:59:57,375 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:59:57,755 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:59:58,731 WARN L188 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 07:59:59,303 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:59:59,724 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:00:00,206 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:00:00,653 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:00:01,866 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:00:02,417 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:00:03,832 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:00:04,341 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:00:04,774 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:00:05,244 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:00:05,712 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:00:06,116 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:00:06,494 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:00:06,880 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:00:07,376 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:00:07,838 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:00:08,320 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:00:08,818 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:00:09,202 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 08:00:09,619 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:00:10,163 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 08:00:10,640 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 08:00:11,163 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:00:11,631 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:00:12,149 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:00:12,539 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:00:13,081 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:00:13,467 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:00:13,922 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:00:14,446 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:00:14,973 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:00:15,382 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:00:15,780 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:00:16,984 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:00:17,428 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:00:17,867 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:00:18,473 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:00:19,036 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 08:00:19,471 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:00:20,013 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:00:20,452 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:00:20,828 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:00:21,562 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:00:22,018 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:00:22,412 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:00:22,951 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:00:23,381 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:00:23,775 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 08:00:24,138 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:00:24,649 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 08:00:25,253 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:00:25,889 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 08:00:26,376 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:00:26,960 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 08:00:27,495 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 08:00:28,182 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:00:28,992 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 08:00:29,577 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 08:00:30,042 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 08:00:30,461 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:00:31,867 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:00:32,257 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:00:32,644 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:00:33,216 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 08:00:33,761 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:00:34,289 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 08:00:34,758 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:00:35,090 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:00:35,612 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:00:36,172 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:00:36,709 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:00:37,154 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 08:00:37,953 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:00:40,743 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:00:41,224 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 08:00:41,673 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:00:42,173 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 08:00:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:56,895 INFO L93 Difference]: Finished difference Result 2908799 states and 3801545 transitions. [2019-09-10 08:00:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2019-09-10 08:00:56,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 161 [2019-09-10 08:00:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:13,928 INFO L225 Difference]: With dead ends: 2908799 [2019-09-10 08:01:13,928 INFO L226 Difference]: Without dead ends: 2908799 [2019-09-10 08:01:13,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 276 SyntacticMatches, 28 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46607 ImplicationChecksByTransitivity, 139.2s TimeCoverageRelationStatistics Valid=15891, Invalid=99369, Unknown=0, NotChecked=0, Total=115260 [2019-09-10 08:01:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908799 states. [2019-09-10 08:02:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908799 to 981563. [2019-09-10 08:02:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981563 states. [2019-09-10 08:02:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981563 states to 981563 states and 1304398 transitions. [2019-09-10 08:02:29,417 INFO L78 Accepts]: Start accepts. Automaton has 981563 states and 1304398 transitions. Word has length 161 [2019-09-10 08:02:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:29,418 INFO L475 AbstractCegarLoop]: Abstraction has 981563 states and 1304398 transitions. [2019-09-10 08:02:29,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:02:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 981563 states and 1304398 transitions. [2019-09-10 08:02:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:02:29,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:29,490 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:29,490 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:29,490 INFO L82 PathProgramCache]: Analyzing trace with hash 983242338, now seen corresponding path program 1 times [2019-09-10 08:02:29,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:29,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:29,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:29,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:29,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:02:29,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-09-10 08:02:29,796 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [208], [210], [213], [216], [219], [221], [223], [226], [229], [232], [234], [236], [239], [243], [246], [249], [253], [255], [258], [261], [269], [271], [274], [282], [284], [287], [290], [295], [297], [300], [308], [310], [313], [316], [321], [323], [325], [327], [330], [337], [339], [341], [344], [345], [347], [349], [358], [361], [365], [367], [370], [376], [379], [382], [384], [399], [401], [404], [407], [409], [417], [420], [426], [429], [432], [434], [449], [451], [454], [457], [459], [474], [476], [479], [482], [484], [583], [698], [2376], [2377], [2381], [2382], [2383] [2019-09-10 08:02:29,805 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:02:29,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:02:29,878 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:02:30,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:02:30,578 INFO L272 AbstractInterpreter]: Visited 151 different actions 816 times. Merged at 59 different actions 585 times. Widened at 26 different actions 122 times. Performed 2978 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 61 fixpoints after 20 different actions. Largest state had 285 variables. [2019-09-10 08:02:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:30,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:02:30,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:30,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:02:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:30,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:02:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:30,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:02:30,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:02:30,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:30,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:32,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:02:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:33,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:33,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:34,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:34,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:02:34,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 08:02:34,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:02:34,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:02:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:02:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:02:34,688 INFO L87 Difference]: Start difference. First operand 981563 states and 1304398 transitions. Second operand 20 states. [2019-09-10 08:03:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:16,374 INFO L93 Difference]: Finished difference Result 3752353 states and 4928386 transitions. [2019-09-10 08:03:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 08:03:16,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 162 [2019-09-10 08:03:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:39,987 INFO L225 Difference]: With dead ends: 3752353 [2019-09-10 08:03:39,987 INFO L226 Difference]: Without dead ends: 3752353 [2019-09-10 08:03:39,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 278 SyntacticMatches, 27 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7996 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3722, Invalid=17740, Unknown=0, NotChecked=0, Total=21462 [2019-09-10 08:03:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752353 states. [2019-09-10 08:04:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752353 to 981411. [2019-09-10 08:04:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981411 states.