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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:19:47,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:19:47,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:19:47,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:19:47,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:19:47,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:19:47,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:19:47,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:19:47,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:19:47,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:19:47,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:19:47,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:19:47,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:19:47,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:19:47,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:19:47,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:19:47,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:19:47,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:19:47,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:19:47,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:19:47,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:19:47,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:19:47,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:19:47,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:19:47,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:19:47,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:19:47,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:19:47,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:19:47,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:19:47,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:19:47,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:19:47,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:19:47,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:19:47,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:19:47,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:19:47,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:19:47,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:19:47,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:19:47,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:19:47,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:19:47,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:19:47,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:19:47,488 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:19:47,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:19:47,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:19:47,489 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:19:47,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:19:47,490 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:19:47,490 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:19:47,491 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:19:47,491 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:19:47,491 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:19:47,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:19:47,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:19:47,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:19:47,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:19:47,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:19:47,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:19:47,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:19:47,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:19:47,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:19:47,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:19:47,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:19:47,497 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:19:47,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:19:47,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:19:47,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:19:47,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:19:47,498 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:19:47,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:19:47,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:19:47,499 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:19:47,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:19:47,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:19:47,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:19:47,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:19:47,570 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:19:47,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:19:47,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/866682160/ce844c6eb60442b2bb700e7f235222d1/FLAGda901b578 [2019-09-10 08:19:48,342 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:19:48,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:19:48,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/866682160/ce844c6eb60442b2bb700e7f235222d1/FLAGda901b578 [2019-09-10 08:19:48,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/866682160/ce844c6eb60442b2bb700e7f235222d1 [2019-09-10 08:19:48,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:19:48,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:19:48,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:19:48,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:19:48,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:19:48,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:19:48" (1/1) ... [2019-09-10 08:19:48,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:48, skipping insertion in model container [2019-09-10 08:19:48,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:19:48" (1/1) ... [2019-09-10 08:19:48,509 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:19:48,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:19:50,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:19:50,031 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:19:50,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:19:50,761 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:19:50,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50 WrapperNode [2019-09-10 08:19:50,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:19:50,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:19:50,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:19:50,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:19:50,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... [2019-09-10 08:19:50,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:19:50,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:19:50,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:19:50,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:19:50,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:19:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:19:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:19:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:19:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:19:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:19:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:19:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:19:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:19:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:19:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:19:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:19:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:19:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:19:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:19:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:19:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:19:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:19:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:19:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:19:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:19:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:19:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:19:54,613 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:19:54,613 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:19:54,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:19:54 BoogieIcfgContainer [2019-09-10 08:19:54,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:19:54,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:19:54,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:19:54,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:19:54,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:19:48" (1/3) ... [2019-09-10 08:19:54,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537ccf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:19:54, skipping insertion in model container [2019-09-10 08:19:54,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:50" (2/3) ... [2019-09-10 08:19:54,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537ccf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:19:54, skipping insertion in model container [2019-09-10 08:19:54,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:19:54" (3/3) ... [2019-09-10 08:19:54,625 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:19:54,636 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:19:54,646 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:19:54,664 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:19:54,696 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:19:54,696 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:19:54,696 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:19:54,697 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:19:54,697 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:19:54,697 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:19:54,697 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:19:54,697 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:19:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states. [2019-09-10 08:19:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:19:54,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:54,824 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 08:19:54,827 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:54,834 INFO L82 PathProgramCache]: Analyzing trace with hash -583578649, now seen corresponding path program 1 times [2019-09-10 08:19:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:54,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:54,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:54,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:54,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:55,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:55,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:55,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:55,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:55,577 INFO L87 Difference]: Start difference. First operand 1129 states. Second operand 5 states. [2019-09-10 08:19:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:56,530 INFO L93 Difference]: Finished difference Result 884 states and 1529 transitions. [2019-09-10 08:19:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:56,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 08:19:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:56,574 INFO L225 Difference]: With dead ends: 884 [2019-09-10 08:19:56,575 INFO L226 Difference]: Without dead ends: 872 [2019-09-10 08:19:56,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-09-10 08:19:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-09-10 08:19:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-10 08:19:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1122 transitions. [2019-09-10 08:19:56,682 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1122 transitions. Word has length 89 [2019-09-10 08:19:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:56,683 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1122 transitions. [2019-09-10 08:19:56,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1122 transitions. [2019-09-10 08:19:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:19:56,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:56,693 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 08:19:56,694 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2090250761, now seen corresponding path program 1 times [2019-09-10 08:19:56,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:56,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:56,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:57,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 08:19:57,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:57,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:57,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:57,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:57,072 INFO L87 Difference]: Start difference. First operand 872 states and 1122 transitions. Second operand 5 states. [2019-09-10 08:19:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:57,671 INFO L93 Difference]: Finished difference Result 747 states and 980 transitions. [2019-09-10 08:19:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:57,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:19:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:57,677 INFO L225 Difference]: With dead ends: 747 [2019-09-10 08:19:57,677 INFO L226 Difference]: Without dead ends: 747 [2019-09-10 08:19:57,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-10 08:19:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-09-10 08:19:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-09-10 08:19:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 980 transitions. [2019-09-10 08:19:57,702 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 980 transitions. Word has length 90 [2019-09-10 08:19:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:57,703 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 980 transitions. [2019-09-10 08:19:57,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 980 transitions. [2019-09-10 08:19:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:19:57,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:57,706 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 08:19:57,707 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -592131867, now seen corresponding path program 1 times [2019-09-10 08:19:57,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:57,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:57,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:57,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:57,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:57,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:57,944 INFO L87 Difference]: Start difference. First operand 747 states and 980 transitions. Second operand 5 states. [2019-09-10 08:19:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:58,599 INFO L93 Difference]: Finished difference Result 689 states and 913 transitions. [2019-09-10 08:19:58,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:58,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:19:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:58,603 INFO L225 Difference]: With dead ends: 689 [2019-09-10 08:19:58,604 INFO L226 Difference]: Without dead ends: 689 [2019-09-10 08:19:58,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-10 08:19:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-09-10 08:19:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-10 08:19:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 913 transitions. [2019-09-10 08:19:58,621 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 913 transitions. Word has length 91 [2019-09-10 08:19:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:58,622 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 913 transitions. [2019-09-10 08:19:58,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 913 transitions. [2019-09-10 08:19:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:19:58,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:58,625 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 08:19:58,626 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash -21106018, now seen corresponding path program 1 times [2019-09-10 08:19:58,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:58,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:58,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:58,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:58,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:58,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:58,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:58,841 INFO L87 Difference]: Start difference. First operand 689 states and 913 transitions. Second operand 5 states. [2019-09-10 08:19:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:59,520 INFO L93 Difference]: Finished difference Result 663 states and 882 transitions. [2019-09-10 08:19:59,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:59,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 08:19:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:59,524 INFO L225 Difference]: With dead ends: 663 [2019-09-10 08:19:59,524 INFO L226 Difference]: Without dead ends: 663 [2019-09-10 08:19:59,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-10 08:19:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-09-10 08:19:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-10 08:19:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 882 transitions. [2019-09-10 08:19:59,541 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 882 transitions. Word has length 92 [2019-09-10 08:19:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:59,542 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 882 transitions. [2019-09-10 08:19:59,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 882 transitions. [2019-09-10 08:19:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:19:59,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:59,548 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] [2019-09-10 08:19:59,549 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1839633213, now seen corresponding path program 1 times [2019-09-10 08:19:59,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:59,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:59,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:59,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:59,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:59,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:59,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:59,731 INFO L87 Difference]: Start difference. First operand 663 states and 882 transitions. Second operand 5 states. [2019-09-10 08:20:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:00,383 INFO L93 Difference]: Finished difference Result 644 states and 860 transitions. [2019-09-10 08:20:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:00,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:20:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:00,388 INFO L225 Difference]: With dead ends: 644 [2019-09-10 08:20:00,388 INFO L226 Difference]: Without dead ends: 644 [2019-09-10 08:20:00,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-10 08:20:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-10 08:20:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-10 08:20:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 860 transitions. [2019-09-10 08:20:00,403 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 860 transitions. Word has length 93 [2019-09-10 08:20:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:00,404 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 860 transitions. [2019-09-10 08:20:00,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 860 transitions. [2019-09-10 08:20:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:20:00,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:00,407 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] [2019-09-10 08:20:00,408 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1412961549, now seen corresponding path program 1 times [2019-09-10 08:20:00,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:00,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:00,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:00,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:00,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:00,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:00,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:00,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:00,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:00,645 INFO L87 Difference]: Start difference. First operand 644 states and 860 transitions. Second operand 5 states. [2019-09-10 08:20:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:01,386 INFO L93 Difference]: Finished difference Result 639 states and 853 transitions. [2019-09-10 08:20:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:01,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 08:20:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:01,390 INFO L225 Difference]: With dead ends: 639 [2019-09-10 08:20:01,391 INFO L226 Difference]: Without dead ends: 639 [2019-09-10 08:20:01,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-10 08:20:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-10 08:20:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 853 transitions. [2019-09-10 08:20:01,409 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 853 transitions. Word has length 94 [2019-09-10 08:20:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:01,410 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 853 transitions. [2019-09-10 08:20:01,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 853 transitions. [2019-09-10 08:20:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:20:01,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:01,412 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] [2019-09-10 08:20:01,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1447378303, now seen corresponding path program 1 times [2019-09-10 08:20:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:01,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:01,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:01,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:01,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:01,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:01,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:01,668 INFO L87 Difference]: Start difference. First operand 639 states and 853 transitions. Second operand 9 states. [2019-09-10 08:20:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:04,031 INFO L93 Difference]: Finished difference Result 1133 states and 1539 transitions. [2019-09-10 08:20:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:04,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 08:20:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:04,037 INFO L225 Difference]: With dead ends: 1133 [2019-09-10 08:20:04,037 INFO L226 Difference]: Without dead ends: 1133 [2019-09-10 08:20:04,038 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 08:20:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-10 08:20:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-10 08:20:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 852 transitions. [2019-09-10 08:20:04,055 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 852 transitions. Word has length 95 [2019-09-10 08:20:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:04,056 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 852 transitions. [2019-09-10 08:20:04,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 852 transitions. [2019-09-10 08:20:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:20:04,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:04,058 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] [2019-09-10 08:20:04,059 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash -102853389, now seen corresponding path program 1 times [2019-09-10 08:20:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:04,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:04,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:04,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:04,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:04,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:04,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:04,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:04,306 INFO L87 Difference]: Start difference. First operand 639 states and 852 transitions. Second operand 9 states. [2019-09-10 08:20:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:06,713 INFO L93 Difference]: Finished difference Result 1137 states and 1541 transitions. [2019-09-10 08:20:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:06,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 08:20:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:06,720 INFO L225 Difference]: With dead ends: 1137 [2019-09-10 08:20:06,720 INFO L226 Difference]: Without dead ends: 1137 [2019-09-10 08:20:06,721 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 08:20:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-10 08:20:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 639. [2019-09-10 08:20:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 851 transitions. [2019-09-10 08:20:06,739 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 851 transitions. Word has length 95 [2019-09-10 08:20:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:06,739 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 851 transitions. [2019-09-10 08:20:06,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 851 transitions. [2019-09-10 08:20:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:20:06,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:06,742 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] [2019-09-10 08:20:06,743 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1602183325, now seen corresponding path program 1 times [2019-09-10 08:20:06,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:06,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:06,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:06,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:06,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:06,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:20:06,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:06,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:20:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:20:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:20:06,941 INFO L87 Difference]: Start difference. First operand 639 states and 851 transitions. Second operand 8 states. [2019-09-10 08:20:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:08,394 INFO L93 Difference]: Finished difference Result 856 states and 1094 transitions. [2019-09-10 08:20:08,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:20:08,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-09-10 08:20:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:08,400 INFO L225 Difference]: With dead ends: 856 [2019-09-10 08:20:08,400 INFO L226 Difference]: Without dead ends: 856 [2019-09-10 08:20:08,400 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 08:20:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-10 08:20:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 639. [2019-09-10 08:20:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 850 transitions. [2019-09-10 08:20:08,414 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 850 transitions. Word has length 95 [2019-09-10 08:20:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:08,414 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 850 transitions. [2019-09-10 08:20:08,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:20:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 850 transitions. [2019-09-10 08:20:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:08,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:08,417 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] [2019-09-10 08:20:08,418 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1113047675, now seen corresponding path program 1 times [2019-09-10 08:20:08,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:08,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:08,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:08,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:08,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:08,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:08,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:08,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:08,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:08,683 INFO L87 Difference]: Start difference. First operand 639 states and 850 transitions. Second operand 9 states. [2019-09-10 08:20:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:10,610 INFO L93 Difference]: Finished difference Result 1109 states and 1490 transitions. [2019-09-10 08:20:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:10,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:10,618 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:10,618 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:10,619 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 08:20:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 849 transitions. [2019-09-10 08:20:10,634 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 849 transitions. Word has length 97 [2019-09-10 08:20:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:10,635 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 849 transitions. [2019-09-10 08:20:10,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 849 transitions. [2019-09-10 08:20:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:10,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:10,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:10,638 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1446852495, now seen corresponding path program 1 times [2019-09-10 08:20:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:10,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:10,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:10,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:10,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:10,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:10,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:10,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:10,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:10,869 INFO L87 Difference]: Start difference. First operand 639 states and 849 transitions. Second operand 9 states. [2019-09-10 08:20:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:12,845 INFO L93 Difference]: Finished difference Result 1125 states and 1515 transitions. [2019-09-10 08:20:12,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:12,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:12,853 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:20:12,853 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:20:12,854 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 08:20:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:20:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:20:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 848 transitions. [2019-09-10 08:20:12,869 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 848 transitions. Word has length 97 [2019-09-10 08:20:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:12,869 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 848 transitions. [2019-09-10 08:20:12,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 848 transitions. [2019-09-10 08:20:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:12,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:12,872 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] [2019-09-10 08:20:12,872 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash 794751107, now seen corresponding path program 1 times [2019-09-10 08:20:12,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:12,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:12,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:13,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:13,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:13,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:13,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:13,059 INFO L87 Difference]: Start difference. First operand 639 states and 848 transitions. Second operand 9 states. [2019-09-10 08:20:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:15,056 INFO L93 Difference]: Finished difference Result 1109 states and 1487 transitions. [2019-09-10 08:20:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:15,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:15,064 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:15,064 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:15,065 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 08:20:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 847 transitions. [2019-09-10 08:20:15,081 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 847 transitions. Word has length 97 [2019-09-10 08:20:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:15,081 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 847 transitions. [2019-09-10 08:20:15,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 847 transitions. [2019-09-10 08:20:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:15,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:15,084 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] [2019-09-10 08:20:15,084 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1280890073, now seen corresponding path program 1 times [2019-09-10 08:20:15,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:15,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:15,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:15,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:15,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:15,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:15,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:15,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:15,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:15,289 INFO L87 Difference]: Start difference. First operand 639 states and 847 transitions. Second operand 9 states. [2019-09-10 08:20:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:17,627 INFO L93 Difference]: Finished difference Result 1137 states and 1532 transitions. [2019-09-10 08:20:17,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:17,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:17,634 INFO L225 Difference]: With dead ends: 1137 [2019-09-10 08:20:17,634 INFO L226 Difference]: Without dead ends: 1137 [2019-09-10 08:20:17,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-10 08:20:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 639. [2019-09-10 08:20:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2019-09-10 08:20:17,649 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 97 [2019-09-10 08:20:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:17,650 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2019-09-10 08:20:17,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2019-09-10 08:20:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:17,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:17,652 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] [2019-09-10 08:20:17,653 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash 299483909, now seen corresponding path program 1 times [2019-09-10 08:20:17,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:17,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:17,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:17,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:17,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:17,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:17,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:17,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:17,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:17,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:17,837 INFO L87 Difference]: Start difference. First operand 639 states and 846 transitions. Second operand 9 states. [2019-09-10 08:20:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:19,832 INFO L93 Difference]: Finished difference Result 1077 states and 1429 transitions. [2019-09-10 08:20:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:19,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:19,838 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:20:19,838 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:20:19,839 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 08:20:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:20:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:20:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 845 transitions. [2019-09-10 08:20:19,851 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 845 transitions. Word has length 97 [2019-09-10 08:20:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:19,852 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 845 transitions. [2019-09-10 08:20:19,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 845 transitions. [2019-09-10 08:20:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:19,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:19,854 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] [2019-09-10 08:20:19,855 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash 990068976, now seen corresponding path program 1 times [2019-09-10 08:20:19,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:19,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:19,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:19,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:20,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 08:20:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:20,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:20,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:20,030 INFO L87 Difference]: Start difference. First operand 639 states and 845 transitions. Second operand 9 states. [2019-09-10 08:20:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:21,905 INFO L93 Difference]: Finished difference Result 1109 states and 1482 transitions. [2019-09-10 08:20:21,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:21,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:21,911 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:21,912 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:21,912 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 08:20:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 844 transitions. [2019-09-10 08:20:21,926 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 844 transitions. Word has length 97 [2019-09-10 08:20:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:21,926 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 844 transitions. [2019-09-10 08:20:21,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 844 transitions. [2019-09-10 08:20:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:21,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:21,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:21,929 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1326473449, now seen corresponding path program 1 times [2019-09-10 08:20:21,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:21,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:21,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:21,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:21,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:22,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:22,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:22,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:22,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:22,104 INFO L87 Difference]: Start difference. First operand 639 states and 844 transitions. Second operand 9 states. [2019-09-10 08:20:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:24,464 INFO L93 Difference]: Finished difference Result 1125 states and 1509 transitions. [2019-09-10 08:20:24,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:24,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:24,471 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:20:24,471 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:20:24,472 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 08:20:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:20:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:20:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 843 transitions. [2019-09-10 08:20:24,486 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 843 transitions. Word has length 97 [2019-09-10 08:20:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:24,486 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 843 transitions. [2019-09-10 08:20:24,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 843 transitions. [2019-09-10 08:20:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:24,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:24,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:24,489 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -975840379, now seen corresponding path program 1 times [2019-09-10 08:20:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:24,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:24,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:24,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 08:20:24,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:24,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:24,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:24,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:24,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:24,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:24,665 INFO L87 Difference]: Start difference. First operand 639 states and 843 transitions. Second operand 9 states. [2019-09-10 08:20:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:26,471 INFO L93 Difference]: Finished difference Result 1125 states and 1507 transitions. [2019-09-10 08:20:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:26,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:26,478 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:20:26,478 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:20:26,479 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 08:20:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:20:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:20:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 842 transitions. [2019-09-10 08:20:26,492 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 842 transitions. Word has length 97 [2019-09-10 08:20:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:26,493 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 842 transitions. [2019-09-10 08:20:26,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 842 transitions. [2019-09-10 08:20:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:20:26,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:26,495 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] [2019-09-10 08:20:26,496 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash -846389634, now seen corresponding path program 1 times [2019-09-10 08:20:26,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:26,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:26,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:26,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:26,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:26,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:26,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:26,674 INFO L87 Difference]: Start difference. First operand 639 states and 842 transitions. Second operand 9 states. [2019-09-10 08:20:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:29,440 INFO L93 Difference]: Finished difference Result 1133 states and 1525 transitions. [2019-09-10 08:20:29,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:29,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:20:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:29,444 INFO L225 Difference]: With dead ends: 1133 [2019-09-10 08:20:29,444 INFO L226 Difference]: Without dead ends: 1133 [2019-09-10 08:20:29,445 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 08:20:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-10 08:20:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-10 08:20:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 841 transitions. [2019-09-10 08:20:29,458 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 841 transitions. Word has length 97 [2019-09-10 08:20:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:29,459 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 841 transitions. [2019-09-10 08:20:29,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 841 transitions. [2019-09-10 08:20:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:29,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:29,461 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] [2019-09-10 08:20:29,462 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -614722141, now seen corresponding path program 1 times [2019-09-10 08:20:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:29,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:29,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:29,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 08:20:29,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:29,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:29,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:29,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:29,651 INFO L87 Difference]: Start difference. First operand 639 states and 841 transitions. Second operand 9 states. [2019-09-10 08:20:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:31,619 INFO L93 Difference]: Finished difference Result 1125 states and 1504 transitions. [2019-09-10 08:20:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:31,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:31,625 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:20:31,625 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:20:31,626 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 08:20:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:20:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:20:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 840 transitions. [2019-09-10 08:20:31,638 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 840 transitions. Word has length 99 [2019-09-10 08:20:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:31,638 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 840 transitions. [2019-09-10 08:20:31,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 840 transitions. [2019-09-10 08:20:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:31,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:31,641 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] [2019-09-10 08:20:31,641 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1600456637, now seen corresponding path program 1 times [2019-09-10 08:20:31,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:31,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:31,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:31,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:31,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:31,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:31,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:31,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:31,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:31,818 INFO L87 Difference]: Start difference. First operand 639 states and 840 transitions. Second operand 9 states. [2019-09-10 08:20:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:34,268 INFO L93 Difference]: Finished difference Result 1133 states and 1521 transitions. [2019-09-10 08:20:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:34,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:34,274 INFO L225 Difference]: With dead ends: 1133 [2019-09-10 08:20:34,274 INFO L226 Difference]: Without dead ends: 1133 [2019-09-10 08:20:34,275 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 08:20:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-10 08:20:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-10 08:20:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 839 transitions. [2019-09-10 08:20:34,286 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 839 transitions. Word has length 99 [2019-09-10 08:20:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:34,286 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 839 transitions. [2019-09-10 08:20:34,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 839 transitions. [2019-09-10 08:20:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:34,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:34,288 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] [2019-09-10 08:20:34,289 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:34,289 INFO L82 PathProgramCache]: Analyzing trace with hash -16190442, now seen corresponding path program 1 times [2019-09-10 08:20:34,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:34,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:34,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:34,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:34,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:34,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:34,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:34,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:34,470 INFO L87 Difference]: Start difference. First operand 639 states and 839 transitions. Second operand 9 states. [2019-09-10 08:20:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:36,836 INFO L93 Difference]: Finished difference Result 1125 states and 1502 transitions. [2019-09-10 08:20:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:36,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:36,843 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:20:36,843 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:20:36,844 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 08:20:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:20:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:20:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 838 transitions. [2019-09-10 08:20:36,855 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 838 transitions. Word has length 99 [2019-09-10 08:20:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:36,856 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 838 transitions. [2019-09-10 08:20:36,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 838 transitions. [2019-09-10 08:20:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:36,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:36,858 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 113260303, now seen corresponding path program 1 times [2019-09-10 08:20:36,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:36,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:36,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:37,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:37,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:37,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:37,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:37,042 INFO L87 Difference]: Start difference. First operand 639 states and 838 transitions. Second operand 9 states. [2019-09-10 08:20:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:39,228 INFO L93 Difference]: Finished difference Result 1109 states and 1475 transitions. [2019-09-10 08:20:39,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:39,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:39,236 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:39,236 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:39,236 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 08:20:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 837 transitions. [2019-09-10 08:20:39,246 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 837 transitions. Word has length 99 [2019-09-10 08:20:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:39,246 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 837 transitions. [2019-09-10 08:20:39,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 837 transitions. [2019-09-10 08:20:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:39,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:39,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:39,249 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:39,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:39,249 INFO L82 PathProgramCache]: Analyzing trace with hash -503675873, now seen corresponding path program 1 times [2019-09-10 08:20:39,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:39,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:39,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:39,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:39,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 08:20:39,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:39,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:39,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:39,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:39,420 INFO L87 Difference]: Start difference. First operand 639 states and 837 transitions. Second operand 9 states. [2019-09-10 08:20:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:41,538 INFO L93 Difference]: Finished difference Result 1109 states and 1473 transitions. [2019-09-10 08:20:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:41,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:41,543 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:41,543 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:41,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 836 transitions. [2019-09-10 08:20:41,555 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 836 transitions. Word has length 99 [2019-09-10 08:20:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:41,555 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 836 transitions. [2019-09-10 08:20:41,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 836 transitions. [2019-09-10 08:20:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:41,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:41,557 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] [2019-09-10 08:20:41,558 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash -118627712, now seen corresponding path program 1 times [2019-09-10 08:20:41,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:41,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:41,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:41,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:41,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:41,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:41,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:41,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:41,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:41,725 INFO L87 Difference]: Start difference. First operand 639 states and 836 transitions. Second operand 9 states. [2019-09-10 08:20:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:44,185 INFO L93 Difference]: Finished difference Result 1133 states and 1515 transitions. [2019-09-10 08:20:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:44,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:44,191 INFO L225 Difference]: With dead ends: 1133 [2019-09-10 08:20:44,191 INFO L226 Difference]: Without dead ends: 1133 [2019-09-10 08:20:44,191 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 08:20:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-10 08:20:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-10 08:20:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 835 transitions. [2019-09-10 08:20:44,201 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 835 transitions. Word has length 99 [2019-09-10 08:20:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:44,201 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 835 transitions. [2019-09-10 08:20:44,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 835 transitions. [2019-09-10 08:20:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:44,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:44,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:44,204 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:44,204 INFO L82 PathProgramCache]: Analyzing trace with hash 412844447, now seen corresponding path program 1 times [2019-09-10 08:20:44,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:44,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:44,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:44,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:44,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:44,402 INFO L87 Difference]: Start difference. First operand 639 states and 835 transitions. Second operand 9 states. [2019-09-10 08:20:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:46,304 INFO L93 Difference]: Finished difference Result 1077 states and 1418 transitions. [2019-09-10 08:20:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:46,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:46,310 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:20:46,310 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:20:46,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:20:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:20:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 834 transitions. [2019-09-10 08:20:46,320 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 834 transitions. Word has length 99 [2019-09-10 08:20:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:46,321 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 834 transitions. [2019-09-10 08:20:46,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 834 transitions. [2019-09-10 08:20:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:46,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:46,323 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] [2019-09-10 08:20:46,323 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -860630256, now seen corresponding path program 1 times [2019-09-10 08:20:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:46,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:46,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:46,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:46,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:46,550 INFO L87 Difference]: Start difference. First operand 639 states and 834 transitions. Second operand 9 states. [2019-09-10 08:20:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:48,501 INFO L93 Difference]: Finished difference Result 1077 states and 1416 transitions. [2019-09-10 08:20:48,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:48,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:48,506 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:20:48,506 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:20:48,507 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 08:20:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:20:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:20:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 833 transitions. [2019-09-10 08:20:48,518 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 833 transitions. Word has length 99 [2019-09-10 08:20:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:48,518 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 833 transitions. [2019-09-10 08:20:48,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 833 transitions. [2019-09-10 08:20:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:48,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:48,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:48,521 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 155343894, now seen corresponding path program 1 times [2019-09-10 08:20:48,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:48,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:48,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:48,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:48,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:48,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:48,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:48,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:48,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:48,701 INFO L87 Difference]: Start difference. First operand 639 states and 833 transitions. Second operand 9 states. [2019-09-10 08:20:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:50,867 INFO L93 Difference]: Finished difference Result 1077 states and 1414 transitions. [2019-09-10 08:20:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:50,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:50,873 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:20:50,873 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:20:50,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:20:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:20:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 832 transitions. [2019-09-10 08:20:50,885 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 832 transitions. Word has length 99 [2019-09-10 08:20:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:50,885 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 832 transitions. [2019-09-10 08:20:50,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 832 transitions. [2019-09-10 08:20:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:50,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:50,887 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] [2019-09-10 08:20:50,888 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 396427883, now seen corresponding path program 1 times [2019-09-10 08:20:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:50,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:50,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:51,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:51,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:51,062 INFO L87 Difference]: Start difference. First operand 639 states and 832 transitions. Second operand 9 states. [2019-09-10 08:20:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:53,150 INFO L93 Difference]: Finished difference Result 1125 states and 1493 transitions. [2019-09-10 08:20:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:53,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:53,155 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:20:53,155 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:20:53,156 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 08:20:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:20:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:20:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 831 transitions. [2019-09-10 08:20:53,167 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 831 transitions. Word has length 99 [2019-09-10 08:20:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:53,167 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 831 transitions. [2019-09-10 08:20:53,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 831 transitions. [2019-09-10 08:20:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:53,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:53,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:53,169 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 944309900, now seen corresponding path program 1 times [2019-09-10 08:20:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:53,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:53,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:53,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:53,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:53,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:53,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:53,409 INFO L87 Difference]: Start difference. First operand 639 states and 831 transitions. Second operand 9 states. [2019-09-10 08:20:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:55,452 INFO L93 Difference]: Finished difference Result 1109 states and 1465 transitions. [2019-09-10 08:20:55,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:55,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:55,456 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:55,456 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:55,457 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 08:20:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 830 transitions. [2019-09-10 08:20:55,476 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 830 transitions. Word has length 99 [2019-09-10 08:20:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:55,476 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 830 transitions. [2019-09-10 08:20:55,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 830 transitions. [2019-09-10 08:20:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:55,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:55,478 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] [2019-09-10 08:20:55,481 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash -724838198, now seen corresponding path program 1 times [2019-09-10 08:20:55,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:55,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:55,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:55,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:55,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:55,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:55,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:55,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:55,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:55,657 INFO L87 Difference]: Start difference. First operand 639 states and 830 transitions. Second operand 9 states. [2019-09-10 08:20:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:57,770 INFO L93 Difference]: Finished difference Result 1109 states and 1464 transitions. [2019-09-10 08:20:57,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:57,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:57,773 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:20:57,774 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:20:57,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:20:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:20:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 829 transitions. [2019-09-10 08:20:57,783 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 829 transitions. Word has length 99 [2019-09-10 08:20:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:57,783 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 829 transitions. [2019-09-10 08:20:57,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 829 transitions. [2019-09-10 08:20:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:57,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:57,785 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] [2019-09-10 08:20:57,785 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash -695001007, now seen corresponding path program 1 times [2019-09-10 08:20:57,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:57,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:57,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:57,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:57,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:57,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:57,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:57,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:57,952 INFO L87 Difference]: Start difference. First operand 639 states and 829 transitions. Second operand 9 states. [2019-09-10 08:20:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:59,942 INFO L93 Difference]: Finished difference Result 1077 states and 1409 transitions. [2019-09-10 08:20:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:59,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:20:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:59,946 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:20:59,946 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:20:59,946 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 08:20:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:20:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:20:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:20:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 828 transitions. [2019-09-10 08:20:59,957 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 828 transitions. Word has length 99 [2019-09-10 08:20:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:59,958 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 828 transitions. [2019-09-10 08:20:59,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 828 transitions. [2019-09-10 08:20:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:20:59,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:59,960 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] [2019-09-10 08:20:59,960 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1931265789, now seen corresponding path program 1 times [2019-09-10 08:20:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:59,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:00,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:00,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:00,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:00,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:00,152 INFO L87 Difference]: Start difference. First operand 639 states and 828 transitions. Second operand 9 states. [2019-09-10 08:21:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:02,655 INFO L93 Difference]: Finished difference Result 1125 states and 1488 transitions. [2019-09-10 08:21:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:02,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:21:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:02,659 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:21:02,659 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:21:02,659 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 08:21:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:21:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:21:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 827 transitions. [2019-09-10 08:21:02,670 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 827 transitions. Word has length 99 [2019-09-10 08:21:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:02,671 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 827 transitions. [2019-09-10 08:21:02,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 827 transitions. [2019-09-10 08:21:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:21:02,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:02,672 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] [2019-09-10 08:21:02,673 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1879307074, now seen corresponding path program 1 times [2019-09-10 08:21:02,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:02,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:02,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:02,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:02,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:02,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:02,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:02,863 INFO L87 Difference]: Start difference. First operand 639 states and 827 transitions. Second operand 9 states. [2019-09-10 08:21:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:04,915 INFO L93 Difference]: Finished difference Result 1109 states and 1460 transitions. [2019-09-10 08:21:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:04,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:21:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:04,919 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:04,919 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:04,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 826 transitions. [2019-09-10 08:21:04,930 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 826 transitions. Word has length 99 [2019-09-10 08:21:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:04,930 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 826 transitions. [2019-09-10 08:21:04,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 826 transitions. [2019-09-10 08:21:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:21:04,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:04,932 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] [2019-09-10 08:21:04,932 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash 747056842, now seen corresponding path program 1 times [2019-09-10 08:21:04,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:04,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:04,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:05,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:05,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:05,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:05,100 INFO L87 Difference]: Start difference. First operand 639 states and 826 transitions. Second operand 9 states. [2019-09-10 08:21:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:07,213 INFO L93 Difference]: Finished difference Result 1109 states and 1458 transitions. [2019-09-10 08:21:07,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:07,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:21:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:07,217 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:07,217 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:07,218 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 08:21:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 825 transitions. [2019-09-10 08:21:07,229 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 825 transitions. Word has length 99 [2019-09-10 08:21:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:07,229 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 825 transitions. [2019-09-10 08:21:07,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 825 transitions. [2019-09-10 08:21:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:21:07,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:07,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:07,231 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 358054313, now seen corresponding path program 1 times [2019-09-10 08:21:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:07,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:07,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:07,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:07,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:07,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:07,391 INFO L87 Difference]: Start difference. First operand 639 states and 825 transitions. Second operand 9 states. [2019-09-10 08:21:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:09,387 INFO L93 Difference]: Finished difference Result 1109 states and 1457 transitions. [2019-09-10 08:21:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:09,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:21:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:09,390 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:09,390 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:09,391 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 08:21:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 824 transitions. [2019-09-10 08:21:09,402 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 824 transitions. Word has length 99 [2019-09-10 08:21:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:09,402 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 824 transitions. [2019-09-10 08:21:09,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 824 transitions. [2019-09-10 08:21:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:09,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:09,404 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] [2019-09-10 08:21:09,404 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1803814491, now seen corresponding path program 1 times [2019-09-10 08:21:09,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:09,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:09,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:09,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:09,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:09,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:09,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:09,578 INFO L87 Difference]: Start difference. First operand 639 states and 824 transitions. Second operand 9 states. [2019-09-10 08:21:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:11,487 INFO L93 Difference]: Finished difference Result 1077 states and 1404 transitions. [2019-09-10 08:21:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:11,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:11,491 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:11,491 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:11,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 823 transitions. [2019-09-10 08:21:11,503 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 823 transitions. Word has length 101 [2019-09-10 08:21:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:11,503 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 823 transitions. [2019-09-10 08:21:11,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 823 transitions. [2019-09-10 08:21:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:11,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:11,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:11,505 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 125342021, now seen corresponding path program 1 times [2019-09-10 08:21:11,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:11,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:11,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:11,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:11,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:11,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:11,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:11,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:11,676 INFO L87 Difference]: Start difference. First operand 639 states and 823 transitions. Second operand 9 states. [2019-09-10 08:21:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:13,953 INFO L93 Difference]: Finished difference Result 1109 states and 1455 transitions. [2019-09-10 08:21:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:13,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:13,956 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:13,956 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:13,957 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 08:21:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 822 transitions. [2019-09-10 08:21:13,967 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 822 transitions. Word has length 101 [2019-09-10 08:21:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:13,967 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 822 transitions. [2019-09-10 08:21:13,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 822 transitions. [2019-09-10 08:21:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:13,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:13,969 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] [2019-09-10 08:21:13,969 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash -537970647, now seen corresponding path program 1 times [2019-09-10 08:21:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:13,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:14,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:14,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:14,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:14,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:14,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:14,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:14,133 INFO L87 Difference]: Start difference. First operand 639 states and 822 transitions. Second operand 9 states. [2019-09-10 08:21:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:16,397 INFO L93 Difference]: Finished difference Result 1109 states and 1453 transitions. [2019-09-10 08:21:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:16,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:16,402 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:16,402 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:16,403 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 08:21:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 821 transitions. [2019-09-10 08:21:16,413 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 821 transitions. Word has length 101 [2019-09-10 08:21:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:16,414 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 821 transitions. [2019-09-10 08:21:16,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 821 transitions. [2019-09-10 08:21:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:16,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:16,415 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] [2019-09-10 08:21:16,416 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1827840137, now seen corresponding path program 1 times [2019-09-10 08:21:16,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:16,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:16,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:16,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:16,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:16,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:16,581 INFO L87 Difference]: Start difference. First operand 639 states and 821 transitions. Second operand 9 states. [2019-09-10 08:21:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:18,609 INFO L93 Difference]: Finished difference Result 1077 states and 1401 transitions. [2019-09-10 08:21:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:18,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:18,612 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:18,612 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:18,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 820 transitions. [2019-09-10 08:21:18,620 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 820 transitions. Word has length 101 [2019-09-10 08:21:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:18,620 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 820 transitions. [2019-09-10 08:21:18,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 820 transitions. [2019-09-10 08:21:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:18,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:18,622 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] [2019-09-10 08:21:18,622 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash 666625533, now seen corresponding path program 1 times [2019-09-10 08:21:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:18,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:18,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:18,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:18,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:18,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:18,777 INFO L87 Difference]: Start difference. First operand 639 states and 820 transitions. Second operand 9 states. [2019-09-10 08:21:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:21,013 INFO L93 Difference]: Finished difference Result 1077 states and 1399 transitions. [2019-09-10 08:21:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:21,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:21,015 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:21,015 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:21,015 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 08:21:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 819 transitions. [2019-09-10 08:21:21,021 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 819 transitions. Word has length 101 [2019-09-10 08:21:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:21,022 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 819 transitions. [2019-09-10 08:21:21,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 819 transitions. [2019-09-10 08:21:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:21,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:21,023 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] [2019-09-10 08:21:21,023 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1503001015, now seen corresponding path program 1 times [2019-09-10 08:21:21,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:21,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:21,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:21,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:21,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:21,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:21,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:21,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:21,181 INFO L87 Difference]: Start difference. First operand 639 states and 819 transitions. Second operand 9 states. [2019-09-10 08:21:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:23,077 INFO L93 Difference]: Finished difference Result 1077 states and 1398 transitions. [2019-09-10 08:21:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:23,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:23,078 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:23,078 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:23,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 818 transitions. [2019-09-10 08:21:23,085 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 818 transitions. Word has length 101 [2019-09-10 08:21:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:23,085 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 818 transitions. [2019-09-10 08:21:23,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 818 transitions. [2019-09-10 08:21:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:23,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:23,087 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] [2019-09-10 08:21:23,087 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1720349999, now seen corresponding path program 1 times [2019-09-10 08:21:23,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:23,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:23,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:23,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:23,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:23,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:23,240 INFO L87 Difference]: Start difference. First operand 639 states and 818 transitions. Second operand 9 states. [2019-09-10 08:21:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:25,456 INFO L93 Difference]: Finished difference Result 1125 states and 1475 transitions. [2019-09-10 08:21:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:25,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:25,459 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:21:25,459 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:21:25,459 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 08:21:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:21:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-10 08:21:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 817 transitions. [2019-09-10 08:21:25,468 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 817 transitions. Word has length 101 [2019-09-10 08:21:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:25,468 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 817 transitions. [2019-09-10 08:21:25,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 817 transitions. [2019-09-10 08:21:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:25,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:25,469 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] [2019-09-10 08:21:25,470 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1464481640, now seen corresponding path program 1 times [2019-09-10 08:21:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:25,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:25,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:25,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:25,616 INFO L87 Difference]: Start difference. First operand 639 states and 817 transitions. Second operand 9 states. [2019-09-10 08:21:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:27,859 INFO L93 Difference]: Finished difference Result 1077 states and 1396 transitions. [2019-09-10 08:21:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:27,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:27,862 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:27,862 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:27,862 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 08:21:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 816 transitions. [2019-09-10 08:21:27,869 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 816 transitions. Word has length 101 [2019-09-10 08:21:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:27,869 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 816 transitions. [2019-09-10 08:21:27,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 816 transitions. [2019-09-10 08:21:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:27,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:27,870 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] [2019-09-10 08:21:27,871 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -22612664, now seen corresponding path program 1 times [2019-09-10 08:21:27,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:27,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:28,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:28,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:28,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:28,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:28,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:28,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:28,013 INFO L87 Difference]: Start difference. First operand 639 states and 816 transitions. Second operand 9 states. [2019-09-10 08:21:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:30,183 INFO L93 Difference]: Finished difference Result 1109 states and 1446 transitions. [2019-09-10 08:21:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:30,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:30,186 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:30,186 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:30,186 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 08:21:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 815 transitions. [2019-09-10 08:21:30,193 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 815 transitions. Word has length 101 [2019-09-10 08:21:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:30,193 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 815 transitions. [2019-09-10 08:21:30,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 815 transitions. [2019-09-10 08:21:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:30,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:30,194 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] [2019-09-10 08:21:30,194 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash -982377980, now seen corresponding path program 1 times [2019-09-10 08:21:30,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:30,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:30,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:30,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:30,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:30,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:30,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:30,350 INFO L87 Difference]: Start difference. First operand 639 states and 815 transitions. Second operand 9 states. [2019-09-10 08:21:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:32,357 INFO L93 Difference]: Finished difference Result 1077 states and 1394 transitions. [2019-09-10 08:21:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:32,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:32,360 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:32,360 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:32,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 814 transitions. [2019-09-10 08:21:32,368 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 814 transitions. Word has length 101 [2019-09-10 08:21:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:32,368 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 814 transitions. [2019-09-10 08:21:32,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 814 transitions. [2019-09-10 08:21:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:32,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:32,369 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] [2019-09-10 08:21:32,370 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1167978122, now seen corresponding path program 1 times [2019-09-10 08:21:32,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:32,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:32,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:32,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:32,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:32,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:32,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:32,551 INFO L87 Difference]: Start difference. First operand 639 states and 814 transitions. Second operand 9 states. [2019-09-10 08:21:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:34,778 INFO L93 Difference]: Finished difference Result 1077 states and 1392 transitions. [2019-09-10 08:21:34,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:34,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:34,780 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:34,780 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:34,781 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 08:21:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 813 transitions. [2019-09-10 08:21:34,788 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 813 transitions. Word has length 101 [2019-09-10 08:21:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:34,788 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 813 transitions. [2019-09-10 08:21:34,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 813 transitions. [2019-09-10 08:21:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:34,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:34,789 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] [2019-09-10 08:21:34,789 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash 105604818, now seen corresponding path program 1 times [2019-09-10 08:21:34,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:34,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:34,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:34,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:34,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:34,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:34,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:34,934 INFO L87 Difference]: Start difference. First operand 639 states and 813 transitions. Second operand 9 states. [2019-09-10 08:21:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:36,982 INFO L93 Difference]: Finished difference Result 1077 states and 1391 transitions. [2019-09-10 08:21:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:36,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:36,984 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:36,985 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:36,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 812 transitions. [2019-09-10 08:21:36,991 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 812 transitions. Word has length 101 [2019-09-10 08:21:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:36,992 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 812 transitions. [2019-09-10 08:21:36,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 812 transitions. [2019-09-10 08:21:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:36,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:36,993 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] [2019-09-10 08:21:36,993 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1810364723, now seen corresponding path program 1 times [2019-09-10 08:21:36,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:36,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:37,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:37,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:37,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:37,145 INFO L87 Difference]: Start difference. First operand 639 states and 812 transitions. Second operand 9 states. [2019-09-10 08:21:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:39,263 INFO L93 Difference]: Finished difference Result 1077 states and 1389 transitions. [2019-09-10 08:21:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:39,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:39,265 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:39,265 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:39,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 811 transitions. [2019-09-10 08:21:39,273 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 811 transitions. Word has length 101 [2019-09-10 08:21:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:39,273 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 811 transitions. [2019-09-10 08:21:39,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 811 transitions. [2019-09-10 08:21:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:39,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:39,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:39,274 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash -668731238, now seen corresponding path program 1 times [2019-09-10 08:21:39,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:39,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:39,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:39,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:39,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:39,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:39,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:39,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:39,426 INFO L87 Difference]: Start difference. First operand 639 states and 811 transitions. Second operand 9 states. [2019-09-10 08:21:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:41,702 INFO L93 Difference]: Finished difference Result 1077 states and 1388 transitions. [2019-09-10 08:21:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:41,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:41,705 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:41,705 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:41,706 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 08:21:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 810 transitions. [2019-09-10 08:21:41,714 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 810 transitions. Word has length 101 [2019-09-10 08:21:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:41,715 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 810 transitions. [2019-09-10 08:21:41,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 810 transitions. [2019-09-10 08:21:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:41,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:41,716 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] [2019-09-10 08:21:41,716 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -539029057, now seen corresponding path program 1 times [2019-09-10 08:21:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:41,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:41,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:41,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:41,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:41,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:41,862 INFO L87 Difference]: Start difference. First operand 639 states and 810 transitions. Second operand 9 states. [2019-09-10 08:21:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:44,147 INFO L93 Difference]: Finished difference Result 1109 states and 1438 transitions. [2019-09-10 08:21:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:44,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:44,149 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:44,149 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:44,150 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 08:21:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 809 transitions. [2019-09-10 08:21:44,159 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 809 transitions. Word has length 101 [2019-09-10 08:21:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:44,159 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 809 transitions. [2019-09-10 08:21:44,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 809 transitions. [2019-09-10 08:21:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:44,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:44,160 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] [2019-09-10 08:21:44,161 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash 266353513, now seen corresponding path program 1 times [2019-09-10 08:21:44,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:44,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:44,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:44,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:44,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:44,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:44,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:44,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:44,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:44,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:44,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:44,325 INFO L87 Difference]: Start difference. First operand 639 states and 809 transitions. Second operand 9 states. [2019-09-10 08:21:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:46,405 INFO L93 Difference]: Finished difference Result 1077 states and 1386 transitions. [2019-09-10 08:21:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:46,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:46,408 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:46,408 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:46,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 808 transitions. [2019-09-10 08:21:46,415 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 808 transitions. Word has length 101 [2019-09-10 08:21:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:46,415 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 808 transitions. [2019-09-10 08:21:46,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 808 transitions. [2019-09-10 08:21:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:46,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:46,417 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] [2019-09-10 08:21:46,418 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash 411987299, now seen corresponding path program 1 times [2019-09-10 08:21:46,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:46,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:46,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:46,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:46,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:46,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:46,636 INFO L87 Difference]: Start difference. First operand 639 states and 808 transitions. Second operand 9 states. [2019-09-10 08:21:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:48,978 INFO L93 Difference]: Finished difference Result 1077 states and 1384 transitions. [2019-09-10 08:21:48,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:48,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:48,980 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:48,981 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:48,981 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 08:21:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 807 transitions. [2019-09-10 08:21:48,988 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 807 transitions. Word has length 101 [2019-09-10 08:21:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:48,989 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 807 transitions. [2019-09-10 08:21:48,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 807 transitions. [2019-09-10 08:21:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:48,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:48,990 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] [2019-09-10 08:21:48,990 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 135143125, now seen corresponding path program 1 times [2019-09-10 08:21:48,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:48,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:48,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:49,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:49,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:49,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:49,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:49,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:49,141 INFO L87 Difference]: Start difference. First operand 639 states and 807 transitions. Second operand 9 states. [2019-09-10 08:21:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:51,341 INFO L93 Difference]: Finished difference Result 1077 states and 1383 transitions. [2019-09-10 08:21:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:51,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:51,343 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:51,343 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:51,343 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 08:21:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 806 transitions. [2019-09-10 08:21:51,350 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 806 transitions. Word has length 101 [2019-09-10 08:21:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:51,351 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 806 transitions. [2019-09-10 08:21:51,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 806 transitions. [2019-09-10 08:21:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:51,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:51,352 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] [2019-09-10 08:21:51,352 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash 160216056, now seen corresponding path program 1 times [2019-09-10 08:21:51,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:51,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:51,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:51,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:51,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:51,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:51,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:51,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:51,494 INFO L87 Difference]: Start difference. First operand 639 states and 806 transitions. Second operand 9 states. [2019-09-10 08:21:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:53,535 INFO L93 Difference]: Finished difference Result 1109 states and 1431 transitions. [2019-09-10 08:21:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:53,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:53,537 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 08:21:53,537 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 08:21:53,538 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 08:21:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 08:21:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-10 08:21:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 805 transitions. [2019-09-10 08:21:53,546 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 805 transitions. Word has length 101 [2019-09-10 08:21:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:53,547 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 805 transitions. [2019-09-10 08:21:53,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 805 transitions. [2019-09-10 08:21:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:53,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:53,548 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] [2019-09-10 08:21:53,549 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1768940456, now seen corresponding path program 1 times [2019-09-10 08:21:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:53,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:53,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:53,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:53,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:53,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:53,701 INFO L87 Difference]: Start difference. First operand 639 states and 805 transitions. Second operand 9 states. [2019-09-10 08:21:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:55,676 INFO L93 Difference]: Finished difference Result 1077 states and 1381 transitions. [2019-09-10 08:21:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:55,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:55,680 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:55,681 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:55,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 804 transitions. [2019-09-10 08:21:55,688 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 804 transitions. Word has length 101 [2019-09-10 08:21:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:55,688 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 804 transitions. [2019-09-10 08:21:55,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 804 transitions. [2019-09-10 08:21:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:55,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:55,690 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] [2019-09-10 08:21:55,690 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:55,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1364812236, now seen corresponding path program 1 times [2019-09-10 08:21:55,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:55,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:55,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:55,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:55,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:55,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:55,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:55,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:55,877 INFO L87 Difference]: Start difference. First operand 639 states and 804 transitions. Second operand 9 states. [2019-09-10 08:21:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:57,981 INFO L93 Difference]: Finished difference Result 1077 states and 1379 transitions. [2019-09-10 08:21:57,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:57,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:57,984 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:57,984 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:57,985 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 08:21:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 803 transitions. [2019-09-10 08:21:57,992 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 803 transitions. Word has length 101 [2019-09-10 08:21:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:57,992 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 803 transitions. [2019-09-10 08:21:57,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 803 transitions. [2019-09-10 08:21:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:57,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:57,994 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] [2019-09-10 08:21:57,994 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash -805496503, now seen corresponding path program 1 times [2019-09-10 08:21:57,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:57,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:57,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:57,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:57,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:58,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:21:58,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:58,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:21:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:21:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:21:58,124 INFO L87 Difference]: Start difference. First operand 639 states and 803 transitions. Second operand 9 states. [2019-09-10 08:21:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:59,973 INFO L93 Difference]: Finished difference Result 1077 states and 1378 transitions. [2019-09-10 08:21:59,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:59,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:21:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:59,975 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:21:59,975 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:21:59,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:21:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:21:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:21:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 802 transitions. [2019-09-10 08:21:59,985 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 802 transitions. Word has length 101 [2019-09-10 08:21:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:59,986 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 802 transitions. [2019-09-10 08:21:59,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:21:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 802 transitions. [2019-09-10 08:21:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:21:59,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:59,987 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] [2019-09-10 08:21:59,988 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1984318311, now seen corresponding path program 1 times [2019-09-10 08:21:59,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:59,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:59,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:00,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 08:22:00,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:00,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:00,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:00,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:00,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:00,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:00,155 INFO L87 Difference]: Start difference. First operand 639 states and 802 transitions. Second operand 9 states. [2019-09-10 08:22:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:02,252 INFO L93 Difference]: Finished difference Result 1077 states and 1377 transitions. [2019-09-10 08:22:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:02,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:22:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:02,254 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:22:02,254 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:22:02,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:22:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:22:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:22:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 801 transitions. [2019-09-10 08:22:02,261 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 801 transitions. Word has length 101 [2019-09-10 08:22:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:02,261 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 801 transitions. [2019-09-10 08:22:02,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 801 transitions. [2019-09-10 08:22:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:22:02,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:02,263 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] [2019-09-10 08:22:02,263 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -140231016, now seen corresponding path program 1 times [2019-09-10 08:22:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:02,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:02,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:02,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:02,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:02,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:02,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:02,402 INFO L87 Difference]: Start difference. First operand 639 states and 801 transitions. Second operand 9 states. [2019-09-10 08:22:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:04,713 INFO L93 Difference]: Finished difference Result 1077 states and 1375 transitions. [2019-09-10 08:22:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:04,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:22:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:04,715 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:22:04,716 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:22:04,716 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 08:22:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:22:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:22:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:22:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 800 transitions. [2019-09-10 08:22:04,723 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 800 transitions. Word has length 101 [2019-09-10 08:22:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:04,723 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 800 transitions. [2019-09-10 08:22:04,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 800 transitions. [2019-09-10 08:22:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:22:04,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:04,724 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] [2019-09-10 08:22:04,724 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:04,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1539223594, now seen corresponding path program 1 times [2019-09-10 08:22:04,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:04,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:04,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:04,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:04,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:04,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:04,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:04,883 INFO L87 Difference]: Start difference. First operand 639 states and 800 transitions. Second operand 9 states. [2019-09-10 08:22:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:06,926 INFO L93 Difference]: Finished difference Result 1077 states and 1373 transitions. [2019-09-10 08:22:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:06,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:22:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:06,928 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:22:06,928 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:22:06,928 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 08:22:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:22:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:22:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:22:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 799 transitions. [2019-09-10 08:22:06,937 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 799 transitions. Word has length 101 [2019-09-10 08:22:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:06,938 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 799 transitions. [2019-09-10 08:22:06,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 799 transitions. [2019-09-10 08:22:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:22:06,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:06,939 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] [2019-09-10 08:22:06,939 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:06,940 INFO L82 PathProgramCache]: Analyzing trace with hash 156727661, now seen corresponding path program 1 times [2019-09-10 08:22:06,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:06,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:06,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:06,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:06,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:07,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:07,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:07,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:07,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:07,096 INFO L87 Difference]: Start difference. First operand 639 states and 799 transitions. Second operand 9 states. [2019-09-10 08:22:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:09,227 INFO L93 Difference]: Finished difference Result 1077 states and 1372 transitions. [2019-09-10 08:22:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:09,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:22:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:09,229 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:22:09,229 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:22:09,230 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 08:22:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:22:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:22:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:22:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 798 transitions. [2019-09-10 08:22:09,238 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 798 transitions. Word has length 102 [2019-09-10 08:22:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:09,238 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 798 transitions. [2019-09-10 08:22:09,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 798 transitions. [2019-09-10 08:22:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:22:09,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:09,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:09,240 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1086833095, now seen corresponding path program 1 times [2019-09-10 08:22:09,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:09,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:09,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:09,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:09,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:09,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:09,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:09,363 INFO L87 Difference]: Start difference. First operand 639 states and 798 transitions. Second operand 9 states. [2019-09-10 08:22:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:11,494 INFO L93 Difference]: Finished difference Result 1077 states and 1371 transitions. [2019-09-10 08:22:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:11,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:22:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:11,496 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:22:11,496 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:22:11,497 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 08:22:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:22:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:22:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:22:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 797 transitions. [2019-09-10 08:22:11,503 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 797 transitions. Word has length 102 [2019-09-10 08:22:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:11,503 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 797 transitions. [2019-09-10 08:22:11,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 797 transitions. [2019-09-10 08:22:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:22:11,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:11,504 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] [2019-09-10 08:22:11,505 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 725509289, now seen corresponding path program 1 times [2019-09-10 08:22:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:11,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:12,733 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:22:12,888 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:22:14,017 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:22:14,170 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:22:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:15,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:15,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:22:15,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:15,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:22:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:22:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:22:15,225 INFO L87 Difference]: Start difference. First operand 639 states and 797 transitions. Second operand 31 states. [2019-09-10 08:22:15,414 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:22:16,327 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:22:16,499 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:22:16,918 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:22:17,290 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:22:17,928 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2019-09-10 08:22:18,576 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 125 [2019-09-10 08:22:19,690 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 169 DAG size of output: 148 [2019-09-10 08:22:19,977 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:22:20,234 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:22:20,597 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 08:22:27,538 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:22:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:39,072 INFO L93 Difference]: Finished difference Result 2160 states and 2715 transitions. [2019-09-10 08:22:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:22:39,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-10 08:22:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:39,075 INFO L225 Difference]: With dead ends: 2160 [2019-09-10 08:22:39,075 INFO L226 Difference]: Without dead ends: 2160 [2019-09-10 08:22:39,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=581, Invalid=2959, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 08:22:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-09-10 08:22:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 663. [2019-09-10 08:22:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-10 08:22:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 827 transitions. [2019-09-10 08:22:39,088 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 827 transitions. Word has length 103 [2019-09-10 08:22:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:39,089 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 827 transitions. [2019-09-10 08:22:39,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:22:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 827 transitions. [2019-09-10 08:22:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:22:39,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:39,090 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] [2019-09-10 08:22:39,091 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -841243648, now seen corresponding path program 1 times [2019-09-10 08:22:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:39,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:39,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:39,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:39,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:22:39,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:39,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:22:39,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:22:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:22:39,844 INFO L87 Difference]: Start difference. First operand 663 states and 827 transitions. Second operand 17 states. [2019-09-10 08:22:40,515 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:22:40,661 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:22:41,799 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 08:22:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:44,073 INFO L93 Difference]: Finished difference Result 1229 states and 1567 transitions. [2019-09-10 08:22:44,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:22:44,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:22:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:44,075 INFO L225 Difference]: With dead ends: 1229 [2019-09-10 08:22:44,076 INFO L226 Difference]: Without dead ends: 1229 [2019-09-10 08:22:44,076 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 08:22:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-09-10 08:22:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 628. [2019-09-10 08:22:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-10 08:22:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 782 transitions. [2019-09-10 08:22:44,089 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 782 transitions. Word has length 103 [2019-09-10 08:22:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:44,090 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 782 transitions. [2019-09-10 08:22:44,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:22:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 782 transitions. [2019-09-10 08:22:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:22:44,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:44,091 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] [2019-09-10 08:22:44,092 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash 75685686, now seen corresponding path program 1 times [2019-09-10 08:22:44,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:44,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:44,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:45,212 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:22:45,394 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:22:45,577 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 08:22:45,742 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 08:22:45,912 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:22:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:47,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:47,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:22:47,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:47,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:22:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:22:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:22:47,282 INFO L87 Difference]: Start difference. First operand 628 states and 782 transitions. Second operand 31 states. [2019-09-10 08:22:47,523 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 08:22:48,783 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:22:48,979 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-10 08:22:49,550 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-10 08:22:49,877 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-09-10 08:22:50,272 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-09-10 08:22:50,679 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2019-09-10 08:22:51,232 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-09-10 08:22:51,577 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:22:51,909 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:22:52,135 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:23:06,761 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-09-10 08:23:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:08,845 INFO L93 Difference]: Finished difference Result 1221 states and 1522 transitions. [2019-09-10 08:23:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:23:08,845 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-10 08:23:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:08,847 INFO L225 Difference]: With dead ends: 1221 [2019-09-10 08:23:08,847 INFO L226 Difference]: Without dead ends: 1221 [2019-09-10 08:23:08,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=473, Invalid=2497, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 08:23:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-10 08:23:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 653. [2019-09-10 08:23:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-10 08:23:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 815 transitions. [2019-09-10 08:23:08,856 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 815 transitions. Word has length 103 [2019-09-10 08:23:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:08,856 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 815 transitions. [2019-09-10 08:23:08,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:23:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 815 transitions. [2019-09-10 08:23:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:08,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:08,858 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1062800595, now seen corresponding path program 1 times [2019-09-10 08:23:08,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:08,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:08,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:08,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:09,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:23:09,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:09,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:23:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:23:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:09,617 INFO L87 Difference]: Start difference. First operand 653 states and 815 transitions. Second operand 17 states. [2019-09-10 08:23:10,275 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:23:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:12,604 INFO L93 Difference]: Finished difference Result 1202 states and 1537 transitions. [2019-09-10 08:23:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:23:12,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:23:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:12,606 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 08:23:12,606 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 08:23:12,606 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 08:23:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 08:23:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 629. [2019-09-10 08:23:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 08:23:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 783 transitions. [2019-09-10 08:23:12,615 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 783 transitions. Word has length 103 [2019-09-10 08:23:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:12,615 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 783 transitions. [2019-09-10 08:23:12,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:23:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 783 transitions. [2019-09-10 08:23:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:12,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:12,616 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] [2019-09-10 08:23:12,616 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 559668261, now seen corresponding path program 1 times [2019-09-10 08:23:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:12,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:12,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:23:13,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:13,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:23:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:23:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:13,336 INFO L87 Difference]: Start difference. First operand 629 states and 783 transitions. Second operand 17 states. [2019-09-10 08:23:14,030 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:23:14,192 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:23:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:16,294 INFO L93 Difference]: Finished difference Result 1181 states and 1508 transitions. [2019-09-10 08:23:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:23:16,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:23:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:16,296 INFO L225 Difference]: With dead ends: 1181 [2019-09-10 08:23:16,296 INFO L226 Difference]: Without dead ends: 1181 [2019-09-10 08:23:16,297 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 08:23:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-10 08:23:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 611. [2019-09-10 08:23:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-10 08:23:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 757 transitions. [2019-09-10 08:23:16,305 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 757 transitions. Word has length 103 [2019-09-10 08:23:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:16,308 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 757 transitions. [2019-09-10 08:23:16,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:23:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2019-09-10 08:23:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:16,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:16,310 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] [2019-09-10 08:23:16,310 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -171293856, now seen corresponding path program 1 times [2019-09-10 08:23:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:16,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:16,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:17,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:17,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:23:17,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:17,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:23:17,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:23:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:23:17,079 INFO L87 Difference]: Start difference. First operand 611 states and 757 transitions. Second operand 16 states. [2019-09-10 08:23:17,750 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:23:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:21,089 INFO L93 Difference]: Finished difference Result 1047 states and 1268 transitions. [2019-09-10 08:23:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:23:21,090 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:23:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:21,091 INFO L225 Difference]: With dead ends: 1047 [2019-09-10 08:23:21,092 INFO L226 Difference]: Without dead ends: 1047 [2019-09-10 08:23:21,092 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 08:23:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-10 08:23:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 634. [2019-09-10 08:23:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-10 08:23:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 789 transitions. [2019-09-10 08:23:21,100 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 789 transitions. Word has length 103 [2019-09-10 08:23:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:21,100 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 789 transitions. [2019-09-10 08:23:21,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:23:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 789 transitions. [2019-09-10 08:23:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:21,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:21,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:21,101 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1183554526, now seen corresponding path program 1 times [2019-09-10 08:23:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:21,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:21,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:23:21,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:21,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:23:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:23:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:23:21,857 INFO L87 Difference]: Start difference. First operand 634 states and 789 transitions. Second operand 16 states. [2019-09-10 08:23:22,550 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:23:22,706 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:23:22,849 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:23:23,024 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:23:23,189 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:23:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:26,826 INFO L93 Difference]: Finished difference Result 1026 states and 1251 transitions. [2019-09-10 08:23:26,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:23:26,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:23:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:26,828 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 08:23:26,828 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 08:23:26,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:23:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 08:23:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 638. [2019-09-10 08:23:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-10 08:23:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 794 transitions. [2019-09-10 08:23:26,837 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 794 transitions. Word has length 103 [2019-09-10 08:23:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:26,837 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 794 transitions. [2019-09-10 08:23:26,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:23:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 794 transitions. [2019-09-10 08:23:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:26,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:26,839 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] [2019-09-10 08:23:26,839 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash 739529577, now seen corresponding path program 1 times [2019-09-10 08:23:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:26,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:23:28,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:28,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:23:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:23:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:23:28,350 INFO L87 Difference]: Start difference. First operand 638 states and 794 transitions. Second operand 22 states. [2019-09-10 08:23:29,425 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 08:23:29,679 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 08:23:29,989 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 08:23:30,175 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:23:30,429 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:23:30,699 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:23:30,855 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:23:31,023 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:23:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:33,880 INFO L93 Difference]: Finished difference Result 1203 states and 1510 transitions. [2019-09-10 08:23:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:23:33,881 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-09-10 08:23:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:33,882 INFO L225 Difference]: With dead ends: 1203 [2019-09-10 08:23:33,883 INFO L226 Difference]: Without dead ends: 1203 [2019-09-10 08:23:33,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:23:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-09-10 08:23:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 650. [2019-09-10 08:23:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 08:23:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 806 transitions. [2019-09-10 08:23:33,892 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 806 transitions. Word has length 103 [2019-09-10 08:23:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:33,893 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 806 transitions. [2019-09-10 08:23:33,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:23:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 806 transitions. [2019-09-10 08:23:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:33,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:33,894 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] [2019-09-10 08:23:33,894 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1338576063, now seen corresponding path program 1 times [2019-09-10 08:23:33,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:33,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:33,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:34,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:23:34,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:34,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:23:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:23:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:34,628 INFO L87 Difference]: Start difference. First operand 650 states and 806 transitions. Second operand 17 states. [2019-09-10 08:23:35,236 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:23:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:37,014 INFO L93 Difference]: Finished difference Result 1133 states and 1438 transitions. [2019-09-10 08:23:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:23:37,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:23:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:37,016 INFO L225 Difference]: With dead ends: 1133 [2019-09-10 08:23:37,017 INFO L226 Difference]: Without dead ends: 1133 [2019-09-10 08:23:37,017 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 08:23:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-10 08:23:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 610. [2019-09-10 08:23:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-10 08:23:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 750 transitions. [2019-09-10 08:23:37,024 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 750 transitions. Word has length 103 [2019-09-10 08:23:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:37,024 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 750 transitions. [2019-09-10 08:23:37,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:23:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 750 transitions. [2019-09-10 08:23:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:37,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:37,026 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] [2019-09-10 08:23:37,026 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash -120255204, now seen corresponding path program 1 times [2019-09-10 08:23:37,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:37,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:37,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:37,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:37,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:37,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:37,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:23:37,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:37,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:23:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:23:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:37,897 INFO L87 Difference]: Start difference. First operand 610 states and 750 transitions. Second operand 17 states. [2019-09-10 08:23:38,524 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:23:38,669 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:23:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:42,071 INFO L93 Difference]: Finished difference Result 1087 states and 1374 transitions. [2019-09-10 08:23:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:23:42,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:23:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:42,072 INFO L225 Difference]: With dead ends: 1087 [2019-09-10 08:23:42,073 INFO L226 Difference]: Without dead ends: 1087 [2019-09-10 08:23:42,073 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 08:23:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-09-10 08:23:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 609. [2019-09-10 08:23:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-09-10 08:23:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 747 transitions. [2019-09-10 08:23:42,080 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 747 transitions. Word has length 103 [2019-09-10 08:23:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:42,080 INFO L475 AbstractCegarLoop]: Abstraction has 609 states and 747 transitions. [2019-09-10 08:23:42,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:23:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 747 transitions. [2019-09-10 08:23:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:23:42,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:42,081 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] [2019-09-10 08:23:42,082 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:42,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1687008141, now seen corresponding path program 1 times [2019-09-10 08:23:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:42,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:42,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:43,098 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:23:43,257 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 08:23:43,418 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:23:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:44,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:44,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:23:44,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:44,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:23:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:23:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:23:44,480 INFO L87 Difference]: Start difference. First operand 609 states and 747 transitions. Second operand 30 states. [2019-09-10 08:23:44,693 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 08:23:45,894 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 08:23:46,179 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 08:23:46,665 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2019-09-10 08:23:47,073 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-09-10 08:23:47,581 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 92 [2019-09-10 08:23:48,175 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 104 [2019-09-10 08:23:48,502 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:23:48,800 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:23:49,114 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:23:49,380 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:23:49,637 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:23:50,074 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 08:24:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:01,708 INFO L93 Difference]: Finished difference Result 1327 states and 1634 transitions. [2019-09-10 08:24:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:24:01,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 103 [2019-09-10 08:24:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:01,710 INFO L225 Difference]: With dead ends: 1327 [2019-09-10 08:24:01,710 INFO L226 Difference]: Without dead ends: 1327 [2019-09-10 08:24:01,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=544, Invalid=2108, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:24:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-09-10 08:24:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 625. [2019-09-10 08:24:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-10 08:24:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 765 transitions. [2019-09-10 08:24:01,719 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 765 transitions. Word has length 103 [2019-09-10 08:24:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:01,719 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 765 transitions. [2019-09-10 08:24:01,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:24:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 765 transitions. [2019-09-10 08:24:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:24:01,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:01,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:01,720 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash 644009232, now seen corresponding path program 1 times [2019-09-10 08:24:01,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:02,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 08:24:02,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:02,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:24:02,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:02,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:24:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:24:02,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:24:02,753 INFO L87 Difference]: Start difference. First operand 625 states and 765 transitions. Second operand 20 states. [2019-09-10 08:24:02,890 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-10 08:24:03,767 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 08:24:04,002 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 08:24:04,174 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:24:04,348 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:24:04,514 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:24:04,676 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:24:04,817 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:24:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:08,659 INFO L93 Difference]: Finished difference Result 1195 states and 1471 transitions. [2019-09-10 08:24:08,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:24:08,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-10 08:24:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:08,661 INFO L225 Difference]: With dead ends: 1195 [2019-09-10 08:24:08,661 INFO L226 Difference]: Without dead ends: 1195 [2019-09-10 08:24:08,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:24:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-09-10 08:24:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 615. [2019-09-10 08:24:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-10 08:24:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 753 transitions. [2019-09-10 08:24:08,667 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 753 transitions. Word has length 103 [2019-09-10 08:24:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:08,667 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 753 transitions. [2019-09-10 08:24:08,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:24:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 753 transitions. [2019-09-10 08:24:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:08,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:08,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:08,669 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash -272553273, now seen corresponding path program 1 times [2019-09-10 08:24:08,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:08,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:08,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:09,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:24:09,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:09,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:24:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:24:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:24:09,191 INFO L87 Difference]: Start difference. First operand 615 states and 753 transitions. Second operand 12 states. [2019-09-10 08:24:09,671 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:24:09,813 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:24:10,105 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-10 08:24:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:11,132 INFO L93 Difference]: Finished difference Result 1492 states and 1946 transitions. [2019-09-10 08:24:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:24:11,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-09-10 08:24:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:11,135 INFO L225 Difference]: With dead ends: 1492 [2019-09-10 08:24:11,135 INFO L226 Difference]: Without dead ends: 1492 [2019-09-10 08:24:11,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-09-10 08:24:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 593. [2019-09-10 08:24:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-10 08:24:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 728 transitions. [2019-09-10 08:24:11,142 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 728 transitions. Word has length 104 [2019-09-10 08:24:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:11,142 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 728 transitions. [2019-09-10 08:24:11,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:24:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 728 transitions. [2019-09-10 08:24:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:11,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:11,143 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] [2019-09-10 08:24:11,143 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1720315989, now seen corresponding path program 1 times [2019-09-10 08:24:11,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:11,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:11,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:11,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:11,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:24:11,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:11,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:24:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:24:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:24:11,616 INFO L87 Difference]: Start difference. First operand 593 states and 728 transitions. Second operand 11 states. [2019-09-10 08:24:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:13,070 INFO L93 Difference]: Finished difference Result 1365 states and 1814 transitions. [2019-09-10 08:24:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:13,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:24:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:13,074 INFO L225 Difference]: With dead ends: 1365 [2019-09-10 08:24:13,074 INFO L226 Difference]: Without dead ends: 1365 [2019-09-10 08:24:13,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:24:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-09-10 08:24:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 557. [2019-09-10 08:24:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-10 08:24:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 682 transitions. [2019-09-10 08:24:13,084 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 682 transitions. Word has length 104 [2019-09-10 08:24:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:13,084 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 682 transitions. [2019-09-10 08:24:13,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:24:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 682 transitions. [2019-09-10 08:24:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:13,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:13,086 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] [2019-09-10 08:24:13,086 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:13,087 INFO L82 PathProgramCache]: Analyzing trace with hash 267466075, now seen corresponding path program 1 times [2019-09-10 08:24:13,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:13,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:13,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:13,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:13,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:13,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:13,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:13,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:13,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:13,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:13,254 INFO L87 Difference]: Start difference. First operand 557 states and 682 transitions. Second operand 9 states. [2019-09-10 08:24:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:15,015 INFO L93 Difference]: Finished difference Result 945 states and 1204 transitions. [2019-09-10 08:24:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:15,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:24:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:15,018 INFO L225 Difference]: With dead ends: 945 [2019-09-10 08:24:15,018 INFO L226 Difference]: Without dead ends: 945 [2019-09-10 08:24:15,018 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 08:24:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-10 08:24:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 557. [2019-09-10 08:24:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-10 08:24:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 681 transitions. [2019-09-10 08:24:15,024 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 681 transitions. Word has length 104 [2019-09-10 08:24:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:15,024 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 681 transitions. [2019-09-10 08:24:15,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 681 transitions. [2019-09-10 08:24:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:15,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:15,025 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] [2019-09-10 08:24:15,025 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1850286100, now seen corresponding path program 1 times [2019-09-10 08:24:15,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:15,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:15,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:15,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:15,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:15,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:15,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:24:15,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:15,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:24:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:24:15,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:24:15,410 INFO L87 Difference]: Start difference. First operand 557 states and 681 transitions. Second operand 11 states. [2019-09-10 08:24:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:16,788 INFO L93 Difference]: Finished difference Result 1314 states and 1729 transitions. [2019-09-10 08:24:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:24:16,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:24:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:16,791 INFO L225 Difference]: With dead ends: 1314 [2019-09-10 08:24:16,791 INFO L226 Difference]: Without dead ends: 1314 [2019-09-10 08:24:16,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:24:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-10 08:24:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 518. [2019-09-10 08:24:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-10 08:24:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 635 transitions. [2019-09-10 08:24:16,798 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 635 transitions. Word has length 104 [2019-09-10 08:24:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:16,798 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 635 transitions. [2019-09-10 08:24:16,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:24:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 635 transitions. [2019-09-10 08:24:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:16,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:16,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:16,814 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1999000552, now seen corresponding path program 1 times [2019-09-10 08:24:16,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:16,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:16,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:16,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:17,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 08:24:17,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:17,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:24:17,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:17,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:24:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:24:17,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:17,993 INFO L87 Difference]: Start difference. First operand 518 states and 635 transitions. Second operand 21 states. [2019-09-10 08:24:19,055 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:24:19,479 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 08:24:19,684 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:24:19,874 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:24:20,110 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 08:24:20,333 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:24:21,063 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:24:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:25,096 INFO L93 Difference]: Finished difference Result 1008 states and 1224 transitions. [2019-09-10 08:24:25,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:24:25,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2019-09-10 08:24:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:25,098 INFO L225 Difference]: With dead ends: 1008 [2019-09-10 08:24:25,099 INFO L226 Difference]: Without dead ends: 1008 [2019-09-10 08:24:25,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=377, Invalid=1263, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:24:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-09-10 08:24:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 518. [2019-09-10 08:24:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-10 08:24:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 634 transitions. [2019-09-10 08:24:25,105 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 634 transitions. Word has length 104 [2019-09-10 08:24:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:25,105 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 634 transitions. [2019-09-10 08:24:25,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:24:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 634 transitions. [2019-09-10 08:24:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:25,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:25,106 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] [2019-09-10 08:24:25,106 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash 471857668, now seen corresponding path program 1 times [2019-09-10 08:24:25,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:25,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:25,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:25,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:25,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:25,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:24:25,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:25,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:24:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:24:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:24:25,478 INFO L87 Difference]: Start difference. First operand 518 states and 634 transitions. Second operand 11 states. [2019-09-10 08:24:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:26,401 INFO L93 Difference]: Finished difference Result 1283 states and 1712 transitions. [2019-09-10 08:24:26,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:26,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:24:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:26,403 INFO L225 Difference]: With dead ends: 1283 [2019-09-10 08:24:26,404 INFO L226 Difference]: Without dead ends: 1283 [2019-09-10 08:24:26,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:24:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-09-10 08:24:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 492. [2019-09-10 08:24:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-10 08:24:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 601 transitions. [2019-09-10 08:24:26,410 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 601 transitions. Word has length 104 [2019-09-10 08:24:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:26,411 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 601 transitions. [2019-09-10 08:24:26,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:24:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 601 transitions. [2019-09-10 08:24:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:26,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:26,412 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] [2019-09-10 08:24:26,412 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:26,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1300176800, now seen corresponding path program 1 times [2019-09-10 08:24:26,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:26,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:26,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:26,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:26,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:26,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:24:26,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:26,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:24:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:24:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:24:26,981 INFO L87 Difference]: Start difference. First operand 492 states and 601 transitions. Second operand 13 states. [2019-09-10 08:24:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:29,017 INFO L93 Difference]: Finished difference Result 1531 states and 2014 transitions. [2019-09-10 08:24:29,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:24:29,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-10 08:24:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:29,020 INFO L225 Difference]: With dead ends: 1531 [2019-09-10 08:24:29,020 INFO L226 Difference]: Without dead ends: 1531 [2019-09-10 08:24:29,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:24:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-09-10 08:24:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 485. [2019-09-10 08:24:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-10 08:24:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 591 transitions. [2019-09-10 08:24:29,028 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 591 transitions. Word has length 104 [2019-09-10 08:24:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:29,028 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 591 transitions. [2019-09-10 08:24:29,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:24:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 591 transitions. [2019-09-10 08:24:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:29,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:29,029 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] [2019-09-10 08:24:29,029 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1655955247, now seen corresponding path program 1 times [2019-09-10 08:24:29,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:29,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:30,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:24:30,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:30,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:24:30,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:24:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:24:30,097 INFO L87 Difference]: Start difference. First operand 485 states and 591 transitions. Second operand 16 states. [2019-09-10 08:24:30,760 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:24:30,914 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:24:31,056 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:24:31,226 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:24:31,395 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:24:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:33,542 INFO L93 Difference]: Finished difference Result 765 states and 927 transitions. [2019-09-10 08:24:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:24:33,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:24:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:33,544 INFO L225 Difference]: With dead ends: 765 [2019-09-10 08:24:33,544 INFO L226 Difference]: Without dead ends: 765 [2019-09-10 08:24:33,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:24:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-10 08:24:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 501. [2019-09-10 08:24:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-10 08:24:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 609 transitions. [2019-09-10 08:24:33,550 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 609 transitions. Word has length 104 [2019-09-10 08:24:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:33,550 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 609 transitions. [2019-09-10 08:24:33,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:24:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 609 transitions. [2019-09-10 08:24:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:33,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:33,551 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] [2019-09-10 08:24:33,551 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2099813372, now seen corresponding path program 1 times [2019-09-10 08:24:33,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:33,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:34,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:24:34,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:34,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:24:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:24:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:24:34,002 INFO L87 Difference]: Start difference. First operand 501 states and 609 transitions. Second operand 12 states. [2019-09-10 08:24:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:34,990 INFO L93 Difference]: Finished difference Result 862 states and 1145 transitions. [2019-09-10 08:24:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:24:34,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-09-10 08:24:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:34,992 INFO L225 Difference]: With dead ends: 862 [2019-09-10 08:24:34,992 INFO L226 Difference]: Without dead ends: 862 [2019-09-10 08:24:34,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:24:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-10 08:24:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 375. [2019-09-10 08:24:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-10 08:24:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 462 transitions. [2019-09-10 08:24:34,996 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 462 transitions. Word has length 104 [2019-09-10 08:24:34,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:34,997 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 462 transitions. [2019-09-10 08:24:34,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:24:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 462 transitions. [2019-09-10 08:24:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:24:34,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:34,998 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] [2019-09-10 08:24:34,998 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:34,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1992993633, now seen corresponding path program 1 times [2019-09-10 08:24:34,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:34,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:34,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:34,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:34,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:35,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:35,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:24:35,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:35,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:24:35,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:24:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:24:35,331 INFO L87 Difference]: Start difference. First operand 375 states and 462 transitions. Second operand 10 states. [2019-09-10 08:24:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:35,997 INFO L93 Difference]: Finished difference Result 472 states and 629 transitions. [2019-09-10 08:24:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:24:35,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 08:24:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:35,999 INFO L225 Difference]: With dead ends: 472 [2019-09-10 08:24:35,999 INFO L226 Difference]: Without dead ends: 472 [2019-09-10 08:24:35,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:24:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-10 08:24:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 193. [2019-09-10 08:24:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-10 08:24:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2019-09-10 08:24:36,002 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 104 [2019-09-10 08:24:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:36,003 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2019-09-10 08:24:36,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:24:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2019-09-10 08:24:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:24:36,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:36,003 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] [2019-09-10 08:24:36,004 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:36,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:36,004 INFO L82 PathProgramCache]: Analyzing trace with hash -424160789, now seen corresponding path program 1 times [2019-09-10 08:24:36,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:36,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:36,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:36,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:36,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:37,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:37,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:24:37,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:37,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:24:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:24:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:24:37,316 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand 33 states. [2019-09-10 08:24:37,760 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2019-09-10 08:24:38,628 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:24:39,090 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:24:39,333 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 08:24:39,637 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:24:40,000 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-09-10 08:24:40,406 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-09-10 08:24:40,633 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:24:40,848 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:24:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:47,904 INFO L93 Difference]: Finished difference Result 1148 states and 1576 transitions. [2019-09-10 08:24:47,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:24:47,905 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-10 08:24:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:47,907 INFO L225 Difference]: With dead ends: 1148 [2019-09-10 08:24:47,907 INFO L226 Difference]: Without dead ends: 1148 [2019-09-10 08:24:47,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=581, Invalid=3079, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:24:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-10 08:24:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 219. [2019-09-10 08:24:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 08:24:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 268 transitions. [2019-09-10 08:24:47,912 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 268 transitions. Word has length 106 [2019-09-10 08:24:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:47,912 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 268 transitions. [2019-09-10 08:24:47,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:24:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 268 transitions. [2019-09-10 08:24:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:24:47,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:47,913 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] [2019-09-10 08:24:47,913 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2065250412, now seen corresponding path program 1 times [2019-09-10 08:24:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:47,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:47,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:49,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:49,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:24:49,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:49,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:24:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:24:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:24:49,623 INFO L87 Difference]: Start difference. First operand 219 states and 268 transitions. Second operand 26 states. [2019-09-10 08:24:49,785 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 08:24:50,943 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 08:24:51,195 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 08:24:51,486 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-10 08:24:51,873 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:24:52,110 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:24:52,341 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:24:53,291 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:24:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:55,246 INFO L93 Difference]: Finished difference Result 604 states and 807 transitions. [2019-09-10 08:24:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:24:55,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 107 [2019-09-10 08:24:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:55,248 INFO L225 Difference]: With dead ends: 604 [2019-09-10 08:24:55,248 INFO L226 Difference]: Without dead ends: 604 [2019-09-10 08:24:55,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:24:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-10 08:24:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 221. [2019-09-10 08:24:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 08:24:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-09-10 08:24:55,258 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 107 [2019-09-10 08:24:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:55,259 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-09-10 08:24:55,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:24:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-09-10 08:24:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:24:55,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:55,260 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] [2019-09-10 08:24:55,260 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1125051483, now seen corresponding path program 1 times [2019-09-10 08:24:55,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:55,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:55,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:56,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:56,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:24:56,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:56,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:24:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:24:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:56,479 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 21 states. [2019-09-10 08:24:57,525 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 08:24:57,776 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 08:24:57,965 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:24:58,144 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:24:58,731 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:24:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:59,889 INFO L93 Difference]: Finished difference Result 596 states and 798 transitions. [2019-09-10 08:24:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:24:59,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-09-10 08:24:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:59,890 INFO L225 Difference]: With dead ends: 596 [2019-09-10 08:24:59,891 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 08:24:59,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:24:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 08:24:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 222. [2019-09-10 08:24:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-10 08:24:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2019-09-10 08:24:59,895 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 107 [2019-09-10 08:24:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:59,895 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2019-09-10 08:24:59,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:24:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2019-09-10 08:24:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:24:59,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:59,896 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] [2019-09-10 08:24:59,896 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:59,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -103440381, now seen corresponding path program 1 times [2019-09-10 08:24:59,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:59,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:00,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:00,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:25:00,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:00,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:25:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:25:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:25:00,612 INFO L87 Difference]: Start difference. First operand 222 states and 271 transitions. Second operand 16 states. [2019-09-10 08:25:01,336 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:25:01,492 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:25:01,642 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:25:01,833 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:25:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:03,079 INFO L93 Difference]: Finished difference Result 674 states and 914 transitions. [2019-09-10 08:25:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:25:03,079 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2019-09-10 08:25:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:03,080 INFO L225 Difference]: With dead ends: 674 [2019-09-10 08:25:03,080 INFO L226 Difference]: Without dead ends: 674 [2019-09-10 08:25:03,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:25:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-10 08:25:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 223. [2019-09-10 08:25:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-10 08:25:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-09-10 08:25:03,083 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 107 [2019-09-10 08:25:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:03,084 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-09-10 08:25:03,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:25:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-09-10 08:25:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:25:03,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:03,084 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] [2019-09-10 08:25:03,085 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:03,085 INFO L82 PathProgramCache]: Analyzing trace with hash 564956522, now seen corresponding path program 1 times [2019-09-10 08:25:03,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:03,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:05,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:05,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:25:05,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:05,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:25:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:25:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:25:05,382 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 33 states. [2019-09-10 08:25:05,655 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 08:25:06,485 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 08:25:06,667 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 08:25:06,920 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:25:07,145 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:25:07,615 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:25:07,896 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:25:08,194 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 08:25:08,533 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 08:25:08,935 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:25:09,396 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-09-10 08:25:09,686 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 08:25:09,961 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 08:25:10,238 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 08:25:10,491 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 08:25:10,710 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:25:10,966 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 08:25:13,209 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 08:25:14,832 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:25:15,266 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:25:15,592 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:25:15,869 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 08:25:17,214 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:25:19,148 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:25:20,414 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:25:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:32,154 INFO L93 Difference]: Finished difference Result 2508 states and 3553 transitions. [2019-09-10 08:25:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 08:25:32,155 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2019-09-10 08:25:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:32,158 INFO L225 Difference]: With dead ends: 2508 [2019-09-10 08:25:32,158 INFO L226 Difference]: Without dead ends: 2508 [2019-09-10 08:25:32,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1051, Invalid=5269, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 08:25:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-09-10 08:25:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 238. [2019-09-10 08:25:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-10 08:25:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 290 transitions. [2019-09-10 08:25:32,167 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 290 transitions. Word has length 107 [2019-09-10 08:25:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:32,167 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 290 transitions. [2019-09-10 08:25:32,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:25:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 290 transitions. [2019-09-10 08:25:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:25:32,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:32,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:32,168 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1631851315, now seen corresponding path program 1 times [2019-09-10 08:25:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:32,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:32,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:32,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:32,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:25:32,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:32,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:25:32,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:25:32,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:25:32,758 INFO L87 Difference]: Start difference. First operand 238 states and 290 transitions. Second operand 14 states. [2019-09-10 08:25:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:34,546 INFO L93 Difference]: Finished difference Result 608 states and 828 transitions. [2019-09-10 08:25:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:25:34,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2019-09-10 08:25:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:34,548 INFO L225 Difference]: With dead ends: 608 [2019-09-10 08:25:34,548 INFO L226 Difference]: Without dead ends: 608 [2019-09-10 08:25:34,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:25:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-10 08:25:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 223. [2019-09-10 08:25:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-10 08:25:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-09-10 08:25:34,551 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 108 [2019-09-10 08:25:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:34,552 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-09-10 08:25:34,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:25:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-09-10 08:25:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:25:34,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:34,553 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] [2019-09-10 08:25:34,553 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686662, now seen corresponding path program 1 times [2019-09-10 08:25:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:34,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:34,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:35,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:35,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:25:35,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:35,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:25:35,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:25:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:25:35,195 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 16 states. [2019-09-10 08:25:36,234 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:25:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:37,237 INFO L93 Difference]: Finished difference Result 570 states and 771 transitions. [2019-09-10 08:25:37,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:25:37,237 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:25:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:37,238 INFO L225 Difference]: With dead ends: 570 [2019-09-10 08:25:37,238 INFO L226 Difference]: Without dead ends: 570 [2019-09-10 08:25:37,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:25:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-10 08:25:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 187. [2019-09-10 08:25:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-10 08:25:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 230 transitions. [2019-09-10 08:25:37,241 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 230 transitions. Word has length 108 [2019-09-10 08:25:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:37,241 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 230 transitions. [2019-09-10 08:25:37,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:25:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 230 transitions. [2019-09-10 08:25:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:25:37,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:37,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:37,242 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1478936557, now seen corresponding path program 1 times [2019-09-10 08:25:37,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:37,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:37,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:37,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:37,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:37,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:37,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:37,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:37,359 INFO L87 Difference]: Start difference. First operand 187 states and 230 transitions. Second operand 3 states. [2019-09-10 08:25:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:37,393 INFO L93 Difference]: Finished difference Result 257 states and 331 transitions. [2019-09-10 08:25:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:37,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 08:25:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:37,394 INFO L225 Difference]: With dead ends: 257 [2019-09-10 08:25:37,395 INFO L226 Difference]: Without dead ends: 257 [2019-09-10 08:25:37,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-10 08:25:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-09-10 08:25:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 08:25:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 330 transitions. [2019-09-10 08:25:37,398 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 330 transitions. Word has length 137 [2019-09-10 08:25:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:37,398 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 330 transitions. [2019-09-10 08:25:37,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 330 transitions. [2019-09-10 08:25:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:37,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:37,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:37,400 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1788757677, now seen corresponding path program 1 times [2019-09-10 08:25:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:37,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:37,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:25:37,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:37,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:25:37,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:25:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:37,548 INFO L87 Difference]: Start difference. First operand 255 states and 330 transitions. Second operand 7 states. [2019-09-10 08:25:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:38,073 INFO L93 Difference]: Finished difference Result 813 states and 1144 transitions. [2019-09-10 08:25:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:25:38,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:25:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:38,075 INFO L225 Difference]: With dead ends: 813 [2019-09-10 08:25:38,075 INFO L226 Difference]: Without dead ends: 813 [2019-09-10 08:25:38,076 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 08:25:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-10 08:25:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 415. [2019-09-10 08:25:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-10 08:25:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 567 transitions. [2019-09-10 08:25:38,081 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 567 transitions. Word has length 139 [2019-09-10 08:25:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:38,082 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 567 transitions. [2019-09-10 08:25:38,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:25:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 567 transitions. [2019-09-10 08:25:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:38,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:38,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:38,083 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1194284749, now seen corresponding path program 1 times [2019-09-10 08:25:38,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:38,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:38,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:38,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:38,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:38,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:25:38,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:38,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:25:38,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:25:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:38,207 INFO L87 Difference]: Start difference. First operand 415 states and 567 transitions. Second operand 7 states. [2019-09-10 08:25:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:38,733 INFO L93 Difference]: Finished difference Result 1505 states and 2156 transitions. [2019-09-10 08:25:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:25:38,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:25:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:38,734 INFO L225 Difference]: With dead ends: 1505 [2019-09-10 08:25:38,735 INFO L226 Difference]: Without dead ends: 1505 [2019-09-10 08:25:38,735 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 08:25:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-09-10 08:25:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 755. [2019-09-10 08:25:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-09-10 08:25:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1069 transitions. [2019-09-10 08:25:38,744 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1069 transitions. Word has length 139 [2019-09-10 08:25:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:38,744 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1069 transitions. [2019-09-10 08:25:38,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:25:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1069 transitions. [2019-09-10 08:25:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:38,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:38,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:38,746 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash 800368438, now seen corresponding path program 1 times [2019-09-10 08:25:38,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:38,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:38,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:38,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:38,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:38,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:38,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:38,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:38,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:38,834 INFO L87 Difference]: Start difference. First operand 755 states and 1069 transitions. Second operand 3 states. [2019-09-10 08:25:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:38,881 INFO L93 Difference]: Finished difference Result 1085 states and 1550 transitions. [2019-09-10 08:25:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:38,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 08:25:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:38,883 INFO L225 Difference]: With dead ends: 1085 [2019-09-10 08:25:38,883 INFO L226 Difference]: Without dead ends: 1085 [2019-09-10 08:25:38,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-10 08:25:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2019-09-10 08:25:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-10 08:25:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1549 transitions. [2019-09-10 08:25:38,896 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1549 transitions. Word has length 139 [2019-09-10 08:25:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:38,896 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1549 transitions. [2019-09-10 08:25:38,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1549 transitions. [2019-09-10 08:25:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:38,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:38,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:38,898 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 90180789, now seen corresponding path program 1 times [2019-09-10 08:25:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:38,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:38,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:38,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:38,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:38,983 INFO L87 Difference]: Start difference. First operand 1083 states and 1549 transitions. Second operand 3 states. [2019-09-10 08:25:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:39,017 INFO L93 Difference]: Finished difference Result 1985 states and 2838 transitions. [2019-09-10 08:25:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:39,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 08:25:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:39,020 INFO L225 Difference]: With dead ends: 1985 [2019-09-10 08:25:39,020 INFO L226 Difference]: Without dead ends: 1985 [2019-09-10 08:25:39,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-09-10 08:25:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1971. [2019-09-10 08:25:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-10 08:25:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2825 transitions. [2019-09-10 08:25:39,040 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2825 transitions. Word has length 139 [2019-09-10 08:25:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:39,040 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 2825 transitions. [2019-09-10 08:25:39,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2825 transitions. [2019-09-10 08:25:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:39,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:39,043 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash -611171137, now seen corresponding path program 1 times [2019-09-10 08:25:39,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:39,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:25:39,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:39,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:25:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:25:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:39,145 INFO L87 Difference]: Start difference. First operand 1971 states and 2825 transitions. Second operand 7 states. [2019-09-10 08:25:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:39,670 INFO L93 Difference]: Finished difference Result 7689 states and 10988 transitions. [2019-09-10 08:25:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:25:39,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:25:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:39,678 INFO L225 Difference]: With dead ends: 7689 [2019-09-10 08:25:39,679 INFO L226 Difference]: Without dead ends: 7689 [2019-09-10 08:25:39,679 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 08:25:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7689 states. [2019-09-10 08:25:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7689 to 4067. [2019-09-10 08:25:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-09-10 08:25:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 5865 transitions. [2019-09-10 08:25:39,725 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 5865 transitions. Word has length 139 [2019-09-10 08:25:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:39,725 INFO L475 AbstractCegarLoop]: Abstraction has 4067 states and 5865 transitions. [2019-09-10 08:25:39,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:25:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 5865 transitions. [2019-09-10 08:25:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:39,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:39,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:39,727 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash 379409209, now seen corresponding path program 1 times [2019-09-10 08:25:39,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:39,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:39,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:25:39,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:39,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:25:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:25:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:39,862 INFO L87 Difference]: Start difference. First operand 4067 states and 5865 transitions. Second operand 7 states. [2019-09-10 08:25:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:40,386 INFO L93 Difference]: Finished difference Result 13321 states and 19084 transitions. [2019-09-10 08:25:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:25:40,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:25:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:40,402 INFO L225 Difference]: With dead ends: 13321 [2019-09-10 08:25:40,402 INFO L226 Difference]: Without dead ends: 13321 [2019-09-10 08:25:40,402 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 08:25:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2019-09-10 08:25:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 8499. [2019-09-10 08:25:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8499 states. [2019-09-10 08:25:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8499 states to 8499 states and 12281 transitions. [2019-09-10 08:25:40,506 INFO L78 Accepts]: Start accepts. Automaton has 8499 states and 12281 transitions. Word has length 139 [2019-09-10 08:25:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:40,506 INFO L475 AbstractCegarLoop]: Abstraction has 8499 states and 12281 transitions. [2019-09-10 08:25:40,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:25:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8499 states and 12281 transitions. [2019-09-10 08:25:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:25:40,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:40,509 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:40,509 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2070402137, now seen corresponding path program 1 times [2019-09-10 08:25:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:40,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:40,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:40,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:25:40,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:40,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:25:40,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:25:40,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:40,653 INFO L87 Difference]: Start difference. First operand 8499 states and 12281 transitions. Second operand 7 states. [2019-09-10 08:25:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:41,307 INFO L93 Difference]: Finished difference Result 24623 states and 35417 transitions. [2019-09-10 08:25:41,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:25:41,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:25:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:41,332 INFO L225 Difference]: With dead ends: 24623 [2019-09-10 08:25:41,332 INFO L226 Difference]: Without dead ends: 24623 [2019-09-10 08:25:41,333 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 08:25:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24623 states. [2019-09-10 08:25:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24623 to 13827. [2019-09-10 08:25:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13827 states. [2019-09-10 08:25:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13827 states to 13827 states and 19993 transitions. [2019-09-10 08:25:41,611 INFO L78 Accepts]: Start accepts. Automaton has 13827 states and 19993 transitions. Word has length 139 [2019-09-10 08:25:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:41,611 INFO L475 AbstractCegarLoop]: Abstraction has 13827 states and 19993 transitions. [2019-09-10 08:25:41,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:25:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13827 states and 19993 transitions. [2019-09-10 08:25:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:25:41,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:41,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:41,615 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1298539344, now seen corresponding path program 1 times [2019-09-10 08:25:41,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:41,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:41,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:41,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:41,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:25:41,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:41,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:25:41,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:25:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:41,725 INFO L87 Difference]: Start difference. First operand 13827 states and 19993 transitions. Second operand 7 states. [2019-09-10 08:25:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:42,206 INFO L93 Difference]: Finished difference Result 28953 states and 41468 transitions. [2019-09-10 08:25:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:25:42,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-10 08:25:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:42,235 INFO L225 Difference]: With dead ends: 28953 [2019-09-10 08:25:42,236 INFO L226 Difference]: Without dead ends: 28953 [2019-09-10 08:25:42,236 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 08:25:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28953 states. [2019-09-10 08:25:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28953 to 16019. [2019-09-10 08:25:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16019 states. [2019-09-10 08:25:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16019 states to 16019 states and 22969 transitions. [2019-09-10 08:25:42,437 INFO L78 Accepts]: Start accepts. Automaton has 16019 states and 22969 transitions. Word has length 140 [2019-09-10 08:25:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:42,438 INFO L475 AbstractCegarLoop]: Abstraction has 16019 states and 22969 transitions. [2019-09-10 08:25:42,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:25:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16019 states and 22969 transitions. [2019-09-10 08:25:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:25:42,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:42,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:42,441 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -480913436, now seen corresponding path program 1 times [2019-09-10 08:25:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:42,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:42,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:42,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:42,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:42,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:42,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:42,499 INFO L87 Difference]: Start difference. First operand 16019 states and 22969 transitions. Second operand 3 states. [2019-09-10 08:25:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:42,554 INFO L93 Difference]: Finished difference Result 17685 states and 25146 transitions. [2019-09-10 08:25:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:42,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 08:25:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:42,569 INFO L225 Difference]: With dead ends: 17685 [2019-09-10 08:25:42,570 INFO L226 Difference]: Without dead ends: 17685 [2019-09-10 08:25:42,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2019-09-10 08:25:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 17491. [2019-09-10 08:25:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17491 states. [2019-09-10 08:25:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17491 states to 17491 states and 24921 transitions. [2019-09-10 08:25:42,830 INFO L78 Accepts]: Start accepts. Automaton has 17491 states and 24921 transitions. Word has length 140 [2019-09-10 08:25:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:42,830 INFO L475 AbstractCegarLoop]: Abstraction has 17491 states and 24921 transitions. [2019-09-10 08:25:42,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17491 states and 24921 transitions. [2019-09-10 08:25:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:25:42,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:42,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:42,832 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1017549632, now seen corresponding path program 1 times [2019-09-10 08:25:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:42,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:42,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:42,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:25:42,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:42,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:25:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:25:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:25:42,927 INFO L87 Difference]: Start difference. First operand 17491 states and 24921 transitions. Second operand 6 states. [2019-09-10 08:25:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:43,046 INFO L93 Difference]: Finished difference Result 27929 states and 39143 transitions. [2019-09-10 08:25:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:25:43,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:25:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:43,075 INFO L225 Difference]: With dead ends: 27929 [2019-09-10 08:25:43,075 INFO L226 Difference]: Without dead ends: 27929 [2019-09-10 08:25:43,075 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 08:25:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27929 states. [2019-09-10 08:25:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27929 to 17683. [2019-09-10 08:25:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17683 states. [2019-09-10 08:25:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 25049 transitions. [2019-09-10 08:25:43,287 INFO L78 Accepts]: Start accepts. Automaton has 17683 states and 25049 transitions. Word has length 140 [2019-09-10 08:25:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:43,287 INFO L475 AbstractCegarLoop]: Abstraction has 17683 states and 25049 transitions. [2019-09-10 08:25:43,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:25:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 17683 states and 25049 transitions. [2019-09-10 08:25:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:25:43,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:43,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:43,289 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1636521419, now seen corresponding path program 1 times [2019-09-10 08:25:43,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:43,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:43,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:43,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:43,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:43,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:43,359 INFO L87 Difference]: Start difference. First operand 17683 states and 25049 transitions. Second operand 3 states. [2019-09-10 08:25:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:43,409 INFO L93 Difference]: Finished difference Result 16725 states and 23450 transitions. [2019-09-10 08:25:43,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:43,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:25:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:43,426 INFO L225 Difference]: With dead ends: 16725 [2019-09-10 08:25:43,426 INFO L226 Difference]: Without dead ends: 16725 [2019-09-10 08:25:43,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16725 states. [2019-09-10 08:25:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16725 to 12691. [2019-09-10 08:25:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12691 states. [2019-09-10 08:25:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12691 states to 12691 states and 17777 transitions. [2019-09-10 08:25:43,536 INFO L78 Accepts]: Start accepts. Automaton has 12691 states and 17777 transitions. Word has length 141 [2019-09-10 08:25:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:43,536 INFO L475 AbstractCegarLoop]: Abstraction has 12691 states and 17777 transitions. [2019-09-10 08:25:43,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 12691 states and 17777 transitions. [2019-09-10 08:25:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:25:43,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:43,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:43,538 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:43,538 INFO L82 PathProgramCache]: Analyzing trace with hash -192422023, now seen corresponding path program 1 times [2019-09-10 08:25:43,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:43,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:43,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:44,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:44,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:44,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:44,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,158 INFO L87 Difference]: Start difference. First operand 12691 states and 17777 transitions. Second operand 3 states. [2019-09-10 08:25:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:44,209 INFO L93 Difference]: Finished difference Result 20781 states and 29002 transitions. [2019-09-10 08:25:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:44,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 08:25:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:44,227 INFO L225 Difference]: With dead ends: 20781 [2019-09-10 08:25:44,227 INFO L226 Difference]: Without dead ends: 20781 [2019-09-10 08:25:44,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20781 states. [2019-09-10 08:25:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20781 to 15163. [2019-09-10 08:25:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-10 08:25:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 21247 transitions. [2019-09-10 08:25:44,354 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 21247 transitions. Word has length 142 [2019-09-10 08:25:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:44,354 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 21247 transitions. [2019-09-10 08:25:44,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 21247 transitions. [2019-09-10 08:25:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:25:44,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:44,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:44,356 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:44,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1192824300, now seen corresponding path program 1 times [2019-09-10 08:25:44,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:44,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:44,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:44,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:44,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:44,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:44,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:44,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:44,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,428 INFO L87 Difference]: Start difference. First operand 15163 states and 21247 transitions. Second operand 3 states. [2019-09-10 08:25:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:44,468 INFO L93 Difference]: Finished difference Result 14175 states and 19598 transitions. [2019-09-10 08:25:44,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:44,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 08:25:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:44,480 INFO L225 Difference]: With dead ends: 14175 [2019-09-10 08:25:44,481 INFO L226 Difference]: Without dead ends: 14175 [2019-09-10 08:25:44,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14175 states. [2019-09-10 08:25:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14175 to 13813. [2019-09-10 08:25:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13813 states. [2019-09-10 08:25:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13813 states to 13813 states and 19177 transitions. [2019-09-10 08:25:44,588 INFO L78 Accepts]: Start accepts. Automaton has 13813 states and 19177 transitions. Word has length 143 [2019-09-10 08:25:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:44,588 INFO L475 AbstractCegarLoop]: Abstraction has 13813 states and 19177 transitions. [2019-09-10 08:25:44,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 13813 states and 19177 transitions. [2019-09-10 08:25:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:25:44,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:44,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:44,589 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash 195583495, now seen corresponding path program 1 times [2019-09-10 08:25:44,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:44,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:44,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:44,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:44,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:44,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:44,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:44,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:44,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:44,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,661 INFO L87 Difference]: Start difference. First operand 13813 states and 19177 transitions. Second operand 3 states. [2019-09-10 08:25:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:44,701 INFO L93 Difference]: Finished difference Result 13185 states and 18170 transitions. [2019-09-10 08:25:44,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:44,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:25:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:44,713 INFO L225 Difference]: With dead ends: 13185 [2019-09-10 08:25:44,713 INFO L226 Difference]: Without dead ends: 13185 [2019-09-10 08:25:44,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13185 states. [2019-09-10 08:25:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13185 to 13183. [2019-09-10 08:25:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13183 states. [2019-09-10 08:25:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13183 states to 13183 states and 18169 transitions. [2019-09-10 08:25:44,811 INFO L78 Accepts]: Start accepts. Automaton has 13183 states and 18169 transitions. Word has length 144 [2019-09-10 08:25:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:44,811 INFO L475 AbstractCegarLoop]: Abstraction has 13183 states and 18169 transitions. [2019-09-10 08:25:44,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13183 states and 18169 transitions. [2019-09-10 08:25:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:25:44,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:44,900 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:44,900 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash 523647650, now seen corresponding path program 1 times [2019-09-10 08:25:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:44,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:44,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:44,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:44,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:44,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:44,996 INFO L87 Difference]: Start difference. First operand 13183 states and 18169 transitions. Second operand 3 states. [2019-09-10 08:25:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:45,043 INFO L93 Difference]: Finished difference Result 16281 states and 22186 transitions. [2019-09-10 08:25:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:45,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:25:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:45,059 INFO L225 Difference]: With dead ends: 16281 [2019-09-10 08:25:45,060 INFO L226 Difference]: Without dead ends: 16281 [2019-09-10 08:25:45,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16281 states. [2019-09-10 08:25:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16281 to 15679. [2019-09-10 08:25:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15679 states. [2019-09-10 08:25:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15679 states to 15679 states and 21465 transitions. [2019-09-10 08:25:45,190 INFO L78 Accepts]: Start accepts. Automaton has 15679 states and 21465 transitions. Word has length 176 [2019-09-10 08:25:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:45,190 INFO L475 AbstractCegarLoop]: Abstraction has 15679 states and 21465 transitions. [2019-09-10 08:25:45,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15679 states and 21465 transitions. [2019-09-10 08:25:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:25:45,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:45,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:45,193 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash -465260211, now seen corresponding path program 1 times [2019-09-10 08:25:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:25:45,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:45,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:45,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:45,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:45,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:45,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:45,270 INFO L87 Difference]: Start difference. First operand 15679 states and 21465 transitions. Second operand 3 states. [2019-09-10 08:25:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:45,322 INFO L93 Difference]: Finished difference Result 19429 states and 26202 transitions. [2019-09-10 08:25:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:45,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 08:25:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:45,339 INFO L225 Difference]: With dead ends: 19429 [2019-09-10 08:25:45,340 INFO L226 Difference]: Without dead ends: 19429 [2019-09-10 08:25:45,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19429 states. [2019-09-10 08:25:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19429 to 18627. [2019-09-10 08:25:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18627 states. [2019-09-10 08:25:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18627 states to 18627 states and 25241 transitions. [2019-09-10 08:25:45,486 INFO L78 Accepts]: Start accepts. Automaton has 18627 states and 25241 transitions. Word has length 177 [2019-09-10 08:25:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:45,486 INFO L475 AbstractCegarLoop]: Abstraction has 18627 states and 25241 transitions. [2019-09-10 08:25:45,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18627 states and 25241 transitions. [2019-09-10 08:25:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:25:45,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:45,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:45,489 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:45,489 INFO L82 PathProgramCache]: Analyzing trace with hash -885162715, now seen corresponding path program 1 times [2019-09-10 08:25:45,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:45,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:45,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:25:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:25:45,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:25:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:25:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:25:45,793 INFO L87 Difference]: Start difference. First operand 18627 states and 25241 transitions. Second operand 8 states. [2019-09-10 08:25:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:46,148 INFO L93 Difference]: Finished difference Result 111463 states and 150839 transitions. [2019-09-10 08:25:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:25:46,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-10 08:25:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:46,275 INFO L225 Difference]: With dead ends: 111463 [2019-09-10 08:25:46,275 INFO L226 Difference]: Without dead ends: 111463 [2019-09-10 08:25:46,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:25:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111463 states. [2019-09-10 08:25:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111463 to 30339. [2019-09-10 08:25:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30339 states. [2019-09-10 08:25:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30339 states to 30339 states and 40953 transitions. [2019-09-10 08:25:47,155 INFO L78 Accepts]: Start accepts. Automaton has 30339 states and 40953 transitions. Word has length 178 [2019-09-10 08:25:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:47,155 INFO L475 AbstractCegarLoop]: Abstraction has 30339 states and 40953 transitions. [2019-09-10 08:25:47,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:25:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30339 states and 40953 transitions. [2019-09-10 08:25:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:25:47,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:47,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:47,158 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 426762155, now seen corresponding path program 1 times [2019-09-10 08:25:47,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:47,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:47,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:47,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:47,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:47,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:47,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:47,238 INFO L87 Difference]: Start difference. First operand 30339 states and 40953 transitions. Second operand 3 states. [2019-09-10 08:25:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:47,301 INFO L93 Difference]: Finished difference Result 27315 states and 36192 transitions. [2019-09-10 08:25:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:47,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 08:25:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:47,325 INFO L225 Difference]: With dead ends: 27315 [2019-09-10 08:25:47,325 INFO L226 Difference]: Without dead ends: 27315 [2019-09-10 08:25:47,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27315 states. [2019-09-10 08:25:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27315 to 27163. [2019-09-10 08:25:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27163 states. [2019-09-10 08:25:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27163 states to 27163 states and 36011 transitions. [2019-09-10 08:25:47,544 INFO L78 Accepts]: Start accepts. Automaton has 27163 states and 36011 transitions. Word has length 178 [2019-09-10 08:25:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:47,544 INFO L475 AbstractCegarLoop]: Abstraction has 27163 states and 36011 transitions. [2019-09-10 08:25:47,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27163 states and 36011 transitions. [2019-09-10 08:25:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:25:47,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:47,546 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:47,546 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash 11385816, now seen corresponding path program 1 times [2019-09-10 08:25:47,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:47,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:47,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:25:47,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:47,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:25:47,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:47,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:25:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:25:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:25:47,737 INFO L87 Difference]: Start difference. First operand 27163 states and 36011 transitions. Second operand 8 states. [2019-09-10 08:25:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:49,065 INFO L93 Difference]: Finished difference Result 105747 states and 140319 transitions. [2019-09-10 08:25:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:25:49,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-10 08:25:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:49,152 INFO L225 Difference]: With dead ends: 105747 [2019-09-10 08:25:49,152 INFO L226 Difference]: Without dead ends: 105747 [2019-09-10 08:25:49,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:25:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105747 states. [2019-09-10 08:25:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105747 to 43803. [2019-09-10 08:25:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43803 states. [2019-09-10 08:25:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43803 states to 43803 states and 57883 transitions. [2019-09-10 08:25:49,736 INFO L78 Accepts]: Start accepts. Automaton has 43803 states and 57883 transitions. Word has length 179 [2019-09-10 08:25:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:49,736 INFO L475 AbstractCegarLoop]: Abstraction has 43803 states and 57883 transitions. [2019-09-10 08:25:49,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:25:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 43803 states and 57883 transitions. [2019-09-10 08:25:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:25:49,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:49,739 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:49,739 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1242434794, now seen corresponding path program 1 times [2019-09-10 08:25:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:25:49,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:49,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:25:49,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:49,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:25:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:25:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:25:49,939 INFO L87 Difference]: Start difference. First operand 43803 states and 57883 transitions. Second operand 8 states. [2019-09-10 08:25:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:50,460 INFO L93 Difference]: Finished difference Result 118379 states and 157025 transitions. [2019-09-10 08:25:50,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:25:50,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-10 08:25:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:50,574 INFO L225 Difference]: With dead ends: 118379 [2019-09-10 08:25:50,574 INFO L226 Difference]: Without dead ends: 118379 [2019-09-10 08:25:50,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:25:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118379 states. [2019-09-10 08:25:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118379 to 54939. [2019-09-10 08:25:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54939 states. [2019-09-10 08:25:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54939 states to 54939 states and 72571 transitions. [2019-09-10 08:25:51,644 INFO L78 Accepts]: Start accepts. Automaton has 54939 states and 72571 transitions. Word has length 179 [2019-09-10 08:25:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:51,645 INFO L475 AbstractCegarLoop]: Abstraction has 54939 states and 72571 transitions. [2019-09-10 08:25:51,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:25:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 54939 states and 72571 transitions. [2019-09-10 08:25:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:25:51,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:51,648 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:51,648 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1825548406, now seen corresponding path program 1 times [2019-09-10 08:25:51,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:51,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:51,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:25:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:25:51,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:51,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:25:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:25:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:25:51,779 INFO L87 Difference]: Start difference. First operand 54939 states and 72571 transitions. Second operand 6 states. [2019-09-10 08:25:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:52,025 INFO L93 Difference]: Finished difference Result 70049 states and 92414 transitions. [2019-09-10 08:25:52,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:25:52,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 08:25:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:52,087 INFO L225 Difference]: With dead ends: 70049 [2019-09-10 08:25:52,087 INFO L226 Difference]: Without dead ends: 70049 [2019-09-10 08:25:52,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70049 states. [2019-09-10 08:25:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70049 to 66075. [2019-09-10 08:25:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66075 states. [2019-09-10 08:25:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66075 states to 66075 states and 87259 transitions. [2019-09-10 08:25:53,078 INFO L78 Accepts]: Start accepts. Automaton has 66075 states and 87259 transitions. Word has length 179 [2019-09-10 08:25:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:53,078 INFO L475 AbstractCegarLoop]: Abstraction has 66075 states and 87259 transitions. [2019-09-10 08:25:53,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:25:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 66075 states and 87259 transitions. [2019-09-10 08:25:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:25:53,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:53,081 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:53,082 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1478838544, now seen corresponding path program 1 times [2019-09-10 08:25:53,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:53,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:53,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:25:53,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:53,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:25:53,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:53,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:25:53,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:25:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:25:53,217 INFO L87 Difference]: Start difference. First operand 66075 states and 87259 transitions. Second operand 6 states. [2019-09-10 08:25:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:53,491 INFO L93 Difference]: Finished difference Result 85409 states and 112750 transitions. [2019-09-10 08:25:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:25:53,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 08:25:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:53,585 INFO L225 Difference]: With dead ends: 85409 [2019-09-10 08:25:53,585 INFO L226 Difference]: Without dead ends: 85409 [2019-09-10 08:25:53,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85409 states. [2019-09-10 08:25:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85409 to 84299. [2019-09-10 08:25:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84299 states. [2019-09-10 08:25:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84299 states to 84299 states and 111435 transitions. [2019-09-10 08:25:54,658 INFO L78 Accepts]: Start accepts. Automaton has 84299 states and 111435 transitions. Word has length 179 [2019-09-10 08:25:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:54,659 INFO L475 AbstractCegarLoop]: Abstraction has 84299 states and 111435 transitions. [2019-09-10 08:25:54,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:25:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 84299 states and 111435 transitions. [2019-09-10 08:25:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:25:54,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:54,663 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:54,663 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:54,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash 366317406, now seen corresponding path program 1 times [2019-09-10 08:25:54,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:54,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:54,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:54,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:54,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:25:54,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:54,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:25:54,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:54,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:25:54,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:25:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:25:54,801 INFO L87 Difference]: Start difference. First operand 84299 states and 111435 transitions. Second operand 6 states. [2019-09-10 08:25:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:55,176 INFO L93 Difference]: Finished difference Result 141573 states and 187256 transitions. [2019-09-10 08:25:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:55,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 08:25:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:55,322 INFO L225 Difference]: With dead ends: 141573 [2019-09-10 08:25:55,322 INFO L226 Difference]: Without dead ends: 141573 [2019-09-10 08:25:55,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:25:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141573 states. [2019-09-10 08:25:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141573 to 140707. [2019-09-10 08:25:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140707 states. [2019-09-10 08:26:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140707 states to 140707 states and 186189 transitions. [2019-09-10 08:26:00,471 INFO L78 Accepts]: Start accepts. Automaton has 140707 states and 186189 transitions. Word has length 179 [2019-09-10 08:26:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:00,471 INFO L475 AbstractCegarLoop]: Abstraction has 140707 states and 186189 transitions. [2019-09-10 08:26:00,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:26:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 140707 states and 186189 transitions. [2019-09-10 08:26:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:26:00,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:00,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:00,476 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1411392173, now seen corresponding path program 1 times [2019-09-10 08:26:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:00,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:00,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:00,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:00,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:00,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:26:00,803 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [202], [205], [209], [212], [215], [217], [219], [222], [225], [228], [230], [232], [235], [238], [241], [243], [245], [248], [251], [254], [256], [258], [261], [264], [267], [269], [271], [274], [284], [287], [291], [294], [297], [301], [303], [306], [311], [319], [321], [324], [332], [334], [337], [345], [347], [350], [358], [360], [363], [371], [373], [376], [384], [386], [388], [391], [394], [398], [400], [402], [405], [406], [408], [411], [416], [418], [421], [434], [436], [439], [442], [444], [459], [461], [464], [467], [469], [484], [486], [489], [492], [494], [509], [511], [514], [517], [519], [534], [536], [539], [542], [544], [559], [561], [563], [566], [569], [571], [606], [4337], [4338], [4342], [4343], [4344] [2019-09-10 08:26:00,857 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:00,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:01,215 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:02,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:26:02,964 INFO L272 AbstractInterpreter]: Visited 169 different actions 1120 times. Merged at 63 different actions 823 times. Widened at 24 different actions 142 times. Performed 4110 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 133 fixpoints after 21 different actions. Largest state had 389 variables. [2019-09-10 08:26:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:02,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:26:02,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:02,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:26:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:02,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:26:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:03,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:26:03,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:26:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:03,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:26:03,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:04,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:04,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:04,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:08,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:08,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:26:08,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:26:08,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:26:08,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:26:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:26:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:26:08,765 INFO L87 Difference]: Start difference. First operand 140707 states and 186189 transitions. Second operand 21 states. [2019-09-10 08:26:08,915 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:26:11,755 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:26:11,911 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:26:12,554 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:26:12,980 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:26:13,289 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:13,434 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:26:13,774 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:13,954 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:26:14,246 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:26:14,400 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:26:14,550 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:26:14,716 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:26:14,952 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:15,101 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:26:15,278 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:26:15,437 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:26:15,743 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:26:15,963 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:16,140 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:26:16,631 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:26:18,150 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:18,310 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:26:18,810 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:18,993 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:26:19,359 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:26:19,552 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:26:19,722 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:26:19,887 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:26:20,208 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:26:20,388 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:26:20,985 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:26:21,179 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:26:21,356 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:26:21,545 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:26:21,739 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:26:21,914 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:22,072 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 08:26:22,217 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:26:22,381 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:26:22,549 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:26:22,725 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:26:22,902 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:26:23,557 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:23,774 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:26:23,956 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:26:24,178 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:24,363 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:26:24,520 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:24,686 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:26:25,016 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:26:25,194 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:26:25,367 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:26:25,521 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:26:25,803 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:26:26,399 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:26:26,617 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:26:26,807 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:26,968 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:26:27,145 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:26:27,352 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:27,526 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:26:27,843 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:26:28,019 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:26:28,193 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:26:28,345 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:26:29,092 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:26:29,289 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:29,458 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:26:29,671 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:26:29,845 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:26:30,008 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:26:30,313 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:26:30,501 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:26:31,063 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:26:31,193 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:26:31,492 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:26:31,825 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:26:32,030 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:26:32,282 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:26:32,461 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:32,660 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:32,827 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:26:33,011 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:26:33,320 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:26:33,646 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:26:33,956 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:26:34,097 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:26:34,255 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:26:34,622 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:26:34,828 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:26:35,045 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:26:35,256 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:26:35,436 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:26:35,646 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:26:35,812 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:26:35,994 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:26:36,186 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:26:36,374 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:26:36,570 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:26:36,768 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:26:37,099 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:26:37,294 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:37,458 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:26:37,662 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:26:37,835 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:26:38,029 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:26:38,200 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:26:38,359 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:26:38,684 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:38,860 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:26:39,085 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:26:39,278 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:39,431 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:26:39,656 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:26:39,984 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:26:40,422 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:26:40,599 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:26:40,775 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:40,978 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:26:41,164 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:41,315 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:26:41,758 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:26:41,939 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:26:42,415 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:26:42,897 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:26:43,090 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:26:43,258 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:26:43,448 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:26:43,825 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:26:44,314 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:26:44,504 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:26:44,681 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:26:45,135 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:26:45,451 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:26:48,367 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:26:48,618 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:26:48,920 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:26:49,109 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:26:49,377 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:26:49,667 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:26:50,151 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:26:50,783 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:26:51,008 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:26:51,208 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 08:26:51,399 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:26:51,847 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:26:51,994 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:26:52,306 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:26:52,866 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:53,030 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:26:53,207 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:26:53,406 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:26:53,925 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:26:54,107 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:26:54,257 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:26:54,412 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:26:54,814 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:26:54,978 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:26:55,132 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:26:55,276 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:26:55,562 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:26:55,718 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:26:56,161 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:26:56,505 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:26:56,719 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:26:56,940 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:26:57,280 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:26:57,487 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:26:57,789 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:58,077 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:58,269 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:26:58,593 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:26:59,561 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:26:59,864 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:27:00,050 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:27:00,229 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:00,557 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:27:00,772 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:00,944 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:27:01,109 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:01,306 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:01,700 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:27:01,922 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:27:02,266 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:27:02,575 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:27:02,776 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:02,960 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:27:03,168 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:03,392 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:27:03,628 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:27:03,829 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:04,113 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:04,690 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:27:04,939 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:27:05,128 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:27:05,528 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:27:05,738 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:27:05,902 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:27:06,088 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:27:07,187 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:27:08,787 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:27:08,976 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:27:09,191 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:27:09,429 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:27:09,604 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:27:09,773 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:27:10,038 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 08:27:10,259 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:10,460 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:27:10,675 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:27:10,936 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:27:11,114 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 08:27:11,285 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:27:11,495 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:27:11,663 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:27:12,109 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:27:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:26,676 INFO L93 Difference]: Finished difference Result 3312878 states and 4305511 transitions. [2019-09-10 08:27:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:27:26,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 180 [2019-09-10 08:27:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:45,601 INFO L225 Difference]: With dead ends: 3312878 [2019-09-10 08:27:45,601 INFO L226 Difference]: Without dead ends: 3312878 [2019-09-10 08:27:45,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 287 SyntacticMatches, 56 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52090 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=15646, Invalid=110024, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:27:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312878 states. [2019-09-10 08:28:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312878 to 691482. [2019-09-10 08:28:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691482 states. [2019-09-10 08:28:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691482 states to 691482 states and 908998 transitions. [2019-09-10 08:28:42,556 INFO L78 Accepts]: Start accepts. Automaton has 691482 states and 908998 transitions. Word has length 180 [2019-09-10 08:28:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:42,556 INFO L475 AbstractCegarLoop]: Abstraction has 691482 states and 908998 transitions. [2019-09-10 08:28:42,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:28:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 691482 states and 908998 transitions. [2019-09-10 08:28:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:28:42,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:42,612 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:42,612 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:42,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1364519748, now seen corresponding path program 1 times [2019-09-10 08:28:42,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:42,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:42,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:28:42,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:42,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:42,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:42,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:42,837 INFO L87 Difference]: Start difference. First operand 691482 states and 908998 transitions. Second operand 9 states. [2019-09-10 08:28:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:47,722 INFO L93 Difference]: Finished difference Result 991652 states and 1301607 transitions. [2019-09-10 08:28:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:28:47,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-09-10 08:28:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:51,188 INFO L225 Difference]: With dead ends: 991652 [2019-09-10 08:28:51,188 INFO L226 Difference]: Without dead ends: 991652 [2019-09-10 08:28:51,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:28:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991652 states. [2019-09-10 08:29:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991652 to 691482. [2019-09-10 08:29:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691482 states. [2019-09-10 08:29:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691482 states to 691482 states and 908994 transitions. [2019-09-10 08:29:14,481 INFO L78 Accepts]: Start accepts. Automaton has 691482 states and 908994 transitions. Word has length 181 [2019-09-10 08:29:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:14,481 INFO L475 AbstractCegarLoop]: Abstraction has 691482 states and 908994 transitions. [2019-09-10 08:29:14,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 691482 states and 908994 transitions. [2019-09-10 08:29:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:29:14,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:14,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:14,506 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1348934542, now seen corresponding path program 1 times [2019-09-10 08:29:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:14,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:14,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:14,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:14,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:14,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:14,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:29:14,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2019-09-10 08:29:14,924 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [202], [205], [209], [212], [215], [217], [219], [222], [225], [228], [230], [232], [235], [238], [241], [243], [245], [248], [251], [254], [256], [258], [261], [264], [269], [271], [274], [277], [280], [282], [284], [287], [291], [294], [297], [301], [303], [306], [311], [319], [321], [324], [332], [334], [337], [345], [347], [350], [358], [360], [363], [371], [373], [376], [384], [386], [388], [391], [394], [398], [400], [402], [405], [406], [408], [411], [416], [418], [421], [434], [436], [439], [442], [444], [459], [461], [464], [467], [469], [484], [486], [489], [492], [494], [509], [511], [514], [517], [519], [534], [536], [539], [542], [544], [559], [561], [563], [566], [569], [571], [609], [664], [4337], [4338], [4342], [4343], [4344] [2019-09-10 08:29:14,943 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:29:14,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:29:23,457 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:29:24,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:29:24,906 INFO L272 AbstractInterpreter]: Visited 172 different actions 1175 times. Merged at 63 different actions 868 times. Widened at 26 different actions 153 times. Performed 4231 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 140 fixpoints after 22 different actions. Largest state had 389 variables. [2019-09-10 08:29:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:24,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:29:24,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:24,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:29:24,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:24,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:29:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:25,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:29:25,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:29:25,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:25,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:29:25,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:25,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:28,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:28,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:29:28,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 08:29:28,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:29:28,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:29:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:29:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:29:28,330 INFO L87 Difference]: Start difference. First operand 691482 states and 908994 transitions. Second operand 20 states. [2019-09-10 08:29:35,621 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 08:29:41,107 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2019-09-10 08:29:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:59,165 INFO L93 Difference]: Finished difference Result 2795057 states and 3625095 transitions. [2019-09-10 08:29:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 08:29:59,166 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 183 [2019-09-10 08:29:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:14,159 INFO L225 Difference]: With dead ends: 2795057 [2019-09-10 08:30:14,159 INFO L226 Difference]: Without dead ends: 2795057 [2019-09-10 08:30:14,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 314 SyntacticMatches, 33 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8051 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3712, Invalid=17750, Unknown=0, NotChecked=0, Total=21462 [2019-09-10 08:30:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795057 states. [2019-09-10 08:30:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795057 to 691456. [2019-09-10 08:30:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691456 states. [2019-09-10 08:30:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691456 states to 691456 states and 908966 transitions. [2019-09-10 08:30:46,491 INFO L78 Accepts]: Start accepts. Automaton has 691456 states and 908966 transitions. Word has length 183 [2019-09-10 08:30:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:46,492 INFO L475 AbstractCegarLoop]: Abstraction has 691456 states and 908966 transitions. [2019-09-10 08:30:46,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:30:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 691456 states and 908966 transitions. [2019-09-10 08:30:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:30:46,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:46,510 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:46,511 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -891460611, now seen corresponding path program 1 times [2019-09-10 08:30:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:46,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:46,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:46,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:30:46,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2019-09-10 08:30:46,994 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [202], [205], [209], [212], [215], [217], [219], [222], [225], [228], [230], [232], [235], [238], [241], [243], [245], [248], [251], [254], [256], [258], [261], [264], [267], [269], [271], [274], [277], [280], [282], [284], [287], [291], [294], [297], [301], [303], [306], [311], [314], [319], [321], [324], [332], [334], [337], [345], [347], [350], [358], [360], [363], [371], [373], [376], [379], [384], [386], [388], [391], [398], [400], [402], [405], [406], [408], [418], [421], [425], [427], [430], [436], [439], [442], [444], [459], [461], [464], [467], [469], [484], [486], [489], [492], [494], [509], [511], [514], [517], [519], [534], [536], [539], [542], [544], [552], [555], [561], [563], [566], [569], [571], [4337], [4338], [4342], [4343], [4344] [2019-09-10 08:30:47,000 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:30:47,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:30:49,106 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:30:50,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:30:50,114 INFO L272 AbstractInterpreter]: Visited 173 different actions 997 times. Merged at 66 different actions 722 times. Widened at 27 different actions 127 times. Performed 3639 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3639 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 83 fixpoints after 17 different actions. Largest state had 389 variables. [2019-09-10 08:30:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:50,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:30:50,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:50,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:30:50,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:50,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:30:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:50,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 2162 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:30:50,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:30:50,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:30:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:51,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:30:51,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms