java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:28:59,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:28:59,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:28:59,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:28:59,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:28:59,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:28:59,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:28:59,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:28:59,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:28:59,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:28:59,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:28:59,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:28:59,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:28:59,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:28:59,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:28:59,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:28:59,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:28:59,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:28:59,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:28:59,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:28:59,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:28:59,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:28:59,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:28:59,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:28:59,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:28:59,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:28:59,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:28:59,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:28:59,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:28:59,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:28:59,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:28:59,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:28:59,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:28:59,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:28:59,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:28:59,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:28:59,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:28:59,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:28:59,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:28:59,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:28:59,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:28:59,542 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:28:59,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:28:59,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:28:59,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:28:59,558 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:28:59,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:28:59,558 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:28:59,559 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:28:59,559 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:28:59,559 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:28:59,559 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:28:59,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:28:59,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:28:59,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:28:59,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:28:59,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:28:59,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:28:59,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:28:59,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:28:59,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:28:59,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:28:59,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:28:59,562 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:28:59,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:28:59,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:28:59,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:28:59,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:28:59,563 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:28:59,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:28:59,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:28:59,564 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:28:59,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:28:59,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:28:59,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:28:59,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:28:59,619 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:28:59,620 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-10 08:28:59,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619bc1caa/850a126342a5456d80ace61ecaea814c/FLAGb2ea83a3f [2019-09-10 08:29:00,494 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:29:00,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-10 08:29:00,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619bc1caa/850a126342a5456d80ace61ecaea814c/FLAGb2ea83a3f [2019-09-10 08:29:00,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619bc1caa/850a126342a5456d80ace61ecaea814c [2019-09-10 08:29:00,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:29:00,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:29:00,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:29:00,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:29:00,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:29:00,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:29:00" (1/1) ... [2019-09-10 08:29:01,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15588d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:01, skipping insertion in model container [2019-09-10 08:29:01,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:29:00" (1/1) ... [2019-09-10 08:29:01,009 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:29:01,282 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:29:03,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:29:03,479 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:29:04,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:29:04,873 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:29:04,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04 WrapperNode [2019-09-10 08:29:04,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:29:04,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:29:04,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:29:04,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:29:04,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:04,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:04,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:04,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:05,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:05,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:05,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... [2019-09-10 08:29:05,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:29:05,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:29:05,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:29:05,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:29:05,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:29:05,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:29:05,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:29:05,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:29:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:29:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:29:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:29:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:29:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:29:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:29:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:29:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:29:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:29:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:29:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:29:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:29:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:29:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:29:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:29:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:29:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:29:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:29:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:29:11,542 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:29:11,544 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:29:11,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:29:11 BoogieIcfgContainer [2019-09-10 08:29:11,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:29:11,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:29:11,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:29:11,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:29:11,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:29:00" (1/3) ... [2019-09-10 08:29:11,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afd8e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:29:11, skipping insertion in model container [2019-09-10 08:29:11,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:29:04" (2/3) ... [2019-09-10 08:29:11,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afd8e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:29:11, skipping insertion in model container [2019-09-10 08:29:11,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:29:11" (3/3) ... [2019-09-10 08:29:11,565 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-10 08:29:11,576 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:29:11,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-10 08:29:11,619 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-10 08:29:11,644 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:29:11,644 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:29:11,644 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:29:11,645 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:29:11,645 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:29:11,645 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:29:11,645 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:29:11,645 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:29:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states. [2019-09-10 08:29:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:29:11,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:11,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,747 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 215023617, now seen corresponding path program 1 times [2019-09-10 08:29:11,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:11,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:11,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:11,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:12,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:12,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:12,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:12,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:12,637 INFO L87 Difference]: Start difference. First operand 2087 states. Second operand 5 states. [2019-09-10 08:29:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:14,515 INFO L93 Difference]: Finished difference Result 1586 states and 2780 transitions. [2019-09-10 08:29:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:14,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:29:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:14,545 INFO L225 Difference]: With dead ends: 1586 [2019-09-10 08:29:14,545 INFO L226 Difference]: Without dead ends: 1574 [2019-09-10 08:29:14,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-09-10 08:29:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2019-09-10 08:29:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-09-10 08:29:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2048 transitions. [2019-09-10 08:29:14,670 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2048 transitions. Word has length 105 [2019-09-10 08:29:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:14,671 INFO L475 AbstractCegarLoop]: Abstraction has 1574 states and 2048 transitions. [2019-09-10 08:29:14,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2048 transitions. [2019-09-10 08:29:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:29:14,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:14,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:14,681 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:14,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:14,682 INFO L82 PathProgramCache]: Analyzing trace with hash -650934382, now seen corresponding path program 1 times [2019-09-10 08:29:14,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:14,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:14,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:14,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:14,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:14,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:14,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:14,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:14,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:14,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:14,995 INFO L87 Difference]: Start difference. First operand 1574 states and 2048 transitions. Second operand 5 states. [2019-09-10 08:29:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:16,185 INFO L93 Difference]: Finished difference Result 1321 states and 1762 transitions. [2019-09-10 08:29:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:16,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:29:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:16,194 INFO L225 Difference]: With dead ends: 1321 [2019-09-10 08:29:16,195 INFO L226 Difference]: Without dead ends: 1321 [2019-09-10 08:29:16,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-09-10 08:29:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-09-10 08:29:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-09-10 08:29:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1762 transitions. [2019-09-10 08:29:16,228 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1762 transitions. Word has length 106 [2019-09-10 08:29:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:16,229 INFO L475 AbstractCegarLoop]: Abstraction has 1321 states and 1762 transitions. [2019-09-10 08:29:16,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1762 transitions. [2019-09-10 08:29:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:29:16,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:16,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:16,237 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 813965667, now seen corresponding path program 1 times [2019-09-10 08:29:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:16,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:16,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:16,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:16,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:16,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:16,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:16,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:16,513 INFO L87 Difference]: Start difference. First operand 1321 states and 1762 transitions. Second operand 5 states. [2019-09-10 08:29:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:18,633 INFO L93 Difference]: Finished difference Result 1241 states and 1665 transitions. [2019-09-10 08:29:18,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-10 08:29:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:18,643 INFO L225 Difference]: With dead ends: 1241 [2019-09-10 08:29:18,643 INFO L226 Difference]: Without dead ends: 1241 [2019-09-10 08:29:18,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-09-10 08:29:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2019-09-10 08:29:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-09-10 08:29:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1665 transitions. [2019-09-10 08:29:18,674 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1665 transitions. Word has length 107 [2019-09-10 08:29:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:18,677 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1665 transitions. [2019-09-10 08:29:18,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1665 transitions. [2019-09-10 08:29:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:29:18,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:18,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,684 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1237924957, now seen corresponding path program 1 times [2019-09-10 08:29:18,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:18,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:18,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:18,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:18,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:18,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:18,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:18,926 INFO L87 Difference]: Start difference. First operand 1241 states and 1665 transitions. Second operand 5 states. [2019-09-10 08:29:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:20,091 INFO L93 Difference]: Finished difference Result 1159 states and 1574 transitions. [2019-09-10 08:29:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:20,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 08:29:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:20,101 INFO L225 Difference]: With dead ends: 1159 [2019-09-10 08:29:20,101 INFO L226 Difference]: Without dead ends: 1159 [2019-09-10 08:29:20,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-09-10 08:29:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2019-09-10 08:29:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-09-10 08:29:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1574 transitions. [2019-09-10 08:29:20,126 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1574 transitions. Word has length 108 [2019-09-10 08:29:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:20,127 INFO L475 AbstractCegarLoop]: Abstraction has 1159 states and 1574 transitions. [2019-09-10 08:29:20,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1574 transitions. [2019-09-10 08:29:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:29:20,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:20,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,133 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 525572155, now seen corresponding path program 1 times [2019-09-10 08:29:20,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:20,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:20,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:20,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:20,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:29:20,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:20,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:20,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:20,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:20,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:20,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:20,422 INFO L87 Difference]: Start difference. First operand 1159 states and 1574 transitions. Second operand 5 states. [2019-09-10 08:29:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:21,516 INFO L93 Difference]: Finished difference Result 1121 states and 1531 transitions. [2019-09-10 08:29:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:21,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 08:29:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:21,523 INFO L225 Difference]: With dead ends: 1121 [2019-09-10 08:29:21,523 INFO L226 Difference]: Without dead ends: 1121 [2019-09-10 08:29:21,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-09-10 08:29:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2019-09-10 08:29:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-10 08:29:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1531 transitions. [2019-09-10 08:29:21,548 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1531 transitions. Word has length 109 [2019-09-10 08:29:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:21,548 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1531 transitions. [2019-09-10 08:29:21,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1531 transitions. [2019-09-10 08:29:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:29:21,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:21,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, 1, 1] [2019-09-10 08:29:21,554 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:21,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1784526045, now seen corresponding path program 1 times [2019-09-10 08:29:21,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:21,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:21,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:21,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:21,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:21,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:29:21,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:21,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:21,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:21,758 INFO L87 Difference]: Start difference. First operand 1121 states and 1531 transitions. Second operand 5 states. [2019-09-10 08:29:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:22,833 INFO L93 Difference]: Finished difference Result 1096 states and 1503 transitions. [2019-09-10 08:29:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:22,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:29:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:22,840 INFO L225 Difference]: With dead ends: 1096 [2019-09-10 08:29:22,840 INFO L226 Difference]: Without dead ends: 1096 [2019-09-10 08:29:22,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-10 08:29:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2019-09-10 08:29:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-09-10 08:29:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1503 transitions. [2019-09-10 08:29:22,863 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1503 transitions. Word has length 110 [2019-09-10 08:29:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:22,866 INFO L475 AbstractCegarLoop]: Abstraction has 1096 states and 1503 transitions. [2019-09-10 08:29:22,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1503 transitions. [2019-09-10 08:29:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:29:22,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:22,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,888 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1947358668, now seen corresponding path program 1 times [2019-09-10 08:29:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:22,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:22,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:23,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:23,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:23,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:23,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:23,111 INFO L87 Difference]: Start difference. First operand 1096 states and 1503 transitions. Second operand 5 states. [2019-09-10 08:29:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:24,361 INFO L93 Difference]: Finished difference Result 1088 states and 1493 transitions. [2019-09-10 08:29:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:24,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-10 08:29:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:24,369 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:29:24,369 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:29:24,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:29:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2019-09-10 08:29:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1493 transitions. [2019-09-10 08:29:24,391 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1493 transitions. Word has length 111 [2019-09-10 08:29:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:24,391 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1493 transitions. [2019-09-10 08:29:24,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1493 transitions. [2019-09-10 08:29:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:29:24,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:24,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,396 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash 386796312, now seen corresponding path program 1 times [2019-09-10 08:29:24,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:24,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:24,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:24,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:24,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:29:24,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:24,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:29:24,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:29:24,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:29:24,731 INFO L87 Difference]: Start difference. First operand 1088 states and 1493 transitions. Second operand 8 states. [2019-09-10 08:29:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:27,218 INFO L93 Difference]: Finished difference Result 1415 states and 1848 transitions. [2019-09-10 08:29:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:29:27,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-10 08:29:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:27,226 INFO L225 Difference]: With dead ends: 1415 [2019-09-10 08:29:27,226 INFO L226 Difference]: Without dead ends: 1415 [2019-09-10 08:29:27,227 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:29:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-09-10 08:29:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1088. [2019-09-10 08:29:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1492 transitions. [2019-09-10 08:29:27,250 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1492 transitions. Word has length 112 [2019-09-10 08:29:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:27,250 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1492 transitions. [2019-09-10 08:29:27,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:29:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1492 transitions. [2019-09-10 08:29:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:29:27,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:27,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:27,255 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash -47028881, now seen corresponding path program 1 times [2019-09-10 08:29:27,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:27,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:27,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:27,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:27,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:29:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:27,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:27,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:27,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:27,617 INFO L87 Difference]: Start difference. First operand 1088 states and 1492 transitions. Second operand 9 states. [2019-09-10 08:29:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:31,454 INFO L93 Difference]: Finished difference Result 1850 states and 2551 transitions. [2019-09-10 08:29:31,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:31,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-10 08:29:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:31,466 INFO L225 Difference]: With dead ends: 1850 [2019-09-10 08:29:31,467 INFO L226 Difference]: Without dead ends: 1850 [2019-09-10 08:29:31,467 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:29:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-09-10 08:29:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1088. [2019-09-10 08:29:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1491 transitions. [2019-09-10 08:29:31,497 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1491 transitions. Word has length 112 [2019-09-10 08:29:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:31,497 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1491 transitions. [2019-09-10 08:29:31,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1491 transitions. [2019-09-10 08:29:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:29:31,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:31,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,502 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1133415737, now seen corresponding path program 1 times [2019-09-10 08:29:31,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:31,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:31,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:31,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:31,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:31,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:31,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:31,814 INFO L87 Difference]: Start difference. First operand 1088 states and 1491 transitions. Second operand 9 states. [2019-09-10 08:29:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:35,319 INFO L93 Difference]: Finished difference Result 1838 states and 2528 transitions. [2019-09-10 08:29:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:35,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-10 08:29:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:35,327 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:29:35,328 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:29:35,328 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:29:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:29:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:29:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1490 transitions. [2019-09-10 08:29:35,354 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1490 transitions. Word has length 112 [2019-09-10 08:29:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:35,354 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1490 transitions. [2019-09-10 08:29:35,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1490 transitions. [2019-09-10 08:29:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:35,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:35,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,359 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1339963100, now seen corresponding path program 1 times [2019-09-10 08:29:35,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:35,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:35,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:29:35,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:35,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:35,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:35,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:35,623 INFO L87 Difference]: Start difference. First operand 1088 states and 1490 transitions. Second operand 9 states. [2019-09-10 08:29:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:39,295 INFO L93 Difference]: Finished difference Result 1850 states and 2548 transitions. [2019-09-10 08:29:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:39,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:29:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:39,305 INFO L225 Difference]: With dead ends: 1850 [2019-09-10 08:29:39,305 INFO L226 Difference]: Without dead ends: 1850 [2019-09-10 08:29:39,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-09-10 08:29:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1088. [2019-09-10 08:29:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1489 transitions. [2019-09-10 08:29:39,334 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1489 transitions. Word has length 114 [2019-09-10 08:29:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:39,334 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1489 transitions. [2019-09-10 08:29:39,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1489 transitions. [2019-09-10 08:29:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:39,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:39,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:39,339 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1679335211, now seen corresponding path program 1 times [2019-09-10 08:29:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:39,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:39,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:39,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:39,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:39,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:39,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:39,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:39,599 INFO L87 Difference]: Start difference. First operand 1088 states and 1489 transitions. Second operand 9 states. [2019-09-10 08:29:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:42,776 INFO L93 Difference]: Finished difference Result 1838 states and 2526 transitions. [2019-09-10 08:29:42,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:42,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:29:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:42,784 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:29:42,784 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:29:42,784 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:29:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:29:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:29:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1488 transitions. [2019-09-10 08:29:42,805 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1488 transitions. Word has length 114 [2019-09-10 08:29:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:42,805 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1488 transitions. [2019-09-10 08:29:42,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1488 transitions. [2019-09-10 08:29:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:42,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:42,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,810 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1092834862, now seen corresponding path program 1 times [2019-09-10 08:29:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:42,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:43,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:43,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:43,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:43,051 INFO L87 Difference]: Start difference. First operand 1088 states and 1488 transitions. Second operand 9 states. [2019-09-10 08:29:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:47,365 INFO L93 Difference]: Finished difference Result 1846 states and 2545 transitions. [2019-09-10 08:29:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:47,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:29:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:47,373 INFO L225 Difference]: With dead ends: 1846 [2019-09-10 08:29:47,373 INFO L226 Difference]: Without dead ends: 1846 [2019-09-10 08:29:47,373 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:29:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-10 08:29:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-10 08:29:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1487 transitions. [2019-09-10 08:29:47,395 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1487 transitions. Word has length 114 [2019-09-10 08:29:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:47,395 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1487 transitions. [2019-09-10 08:29:47,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1487 transitions. [2019-09-10 08:29:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:47,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:47,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:47,400 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -739954808, now seen corresponding path program 1 times [2019-09-10 08:29:47,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:47,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:47,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:47,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:47,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:47,694 INFO L87 Difference]: Start difference. First operand 1088 states and 1487 transitions. Second operand 9 states. [2019-09-10 08:29:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:51,727 INFO L93 Difference]: Finished difference Result 1846 states and 2543 transitions. [2019-09-10 08:29:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:51,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:29:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:51,734 INFO L225 Difference]: With dead ends: 1846 [2019-09-10 08:29:51,734 INFO L226 Difference]: Without dead ends: 1846 [2019-09-10 08:29:51,734 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:29:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-10 08:29:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-10 08:29:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1486 transitions. [2019-09-10 08:29:51,756 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1486 transitions. Word has length 114 [2019-09-10 08:29:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:51,756 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1486 transitions. [2019-09-10 08:29:51,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1486 transitions. [2019-09-10 08:29:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:51,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:51,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:51,760 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1364856601, now seen corresponding path program 1 times [2019-09-10 08:29:51,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:51,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:51,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:51,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:51,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:52,000 INFO L87 Difference]: Start difference. First operand 1088 states and 1486 transitions. Second operand 9 states. [2019-09-10 08:29:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:55,914 INFO L93 Difference]: Finished difference Result 1838 states and 2523 transitions. [2019-09-10 08:29:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:55,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:29:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:55,923 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:29:55,924 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:29:55,924 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:29:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:29:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:29:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:29:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1485 transitions. [2019-09-10 08:29:55,947 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1485 transitions. Word has length 114 [2019-09-10 08:29:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:55,947 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1485 transitions. [2019-09-10 08:29:55,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1485 transitions. [2019-09-10 08:29:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:29:55,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:55,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:55,952 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash -327442449, now seen corresponding path program 1 times [2019-09-10 08:29:55,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:56,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:56,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:56,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:56,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:56,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:56,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:56,213 INFO L87 Difference]: Start difference. First operand 1088 states and 1485 transitions. Second operand 9 states. [2019-09-10 08:30:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:00,152 INFO L93 Difference]: Finished difference Result 1838 states and 2522 transitions. [2019-09-10 08:30:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:00,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:30:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:00,160 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:30:00,160 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:30:00,160 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:30:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:30:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:30:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1484 transitions. [2019-09-10 08:30:00,179 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1484 transitions. Word has length 114 [2019-09-10 08:30:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:00,180 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1484 transitions. [2019-09-10 08:30:00,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1484 transitions. [2019-09-10 08:30:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:30:00,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:00,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:00,183 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1397895822, now seen corresponding path program 1 times [2019-09-10 08:30:00,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:00,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:00,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:00,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:00,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:00,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:30:00,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:00,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:00,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:00,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:00,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:00,409 INFO L87 Difference]: Start difference. First operand 1088 states and 1484 transitions. Second operand 9 states. [2019-09-10 08:30:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:04,643 INFO L93 Difference]: Finished difference Result 1846 states and 2539 transitions. [2019-09-10 08:30:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:04,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:30:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:04,652 INFO L225 Difference]: With dead ends: 1846 [2019-09-10 08:30:04,653 INFO L226 Difference]: Without dead ends: 1846 [2019-09-10 08:30:04,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-10 08:30:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-10 08:30:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1483 transitions. [2019-09-10 08:30:04,673 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1483 transitions. Word has length 114 [2019-09-10 08:30:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:04,674 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1483 transitions. [2019-09-10 08:30:04,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1483 transitions. [2019-09-10 08:30:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:04,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:04,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,678 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash -577271375, now seen corresponding path program 1 times [2019-09-10 08:30:04,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:04,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:04,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:04,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:04,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:04,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:04,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:04,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:04,921 INFO L87 Difference]: Start difference. First operand 1088 states and 1483 transitions. Second operand 9 states. [2019-09-10 08:30:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:08,214 INFO L93 Difference]: Finished difference Result 1822 states and 2493 transitions. [2019-09-10 08:30:08,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:08,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:08,221 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:30:08,221 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:30:08,222 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:30:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:30:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:30:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1482 transitions. [2019-09-10 08:30:08,241 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1482 transitions. Word has length 116 [2019-09-10 08:30:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:08,241 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1482 transitions. [2019-09-10 08:30:08,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1482 transitions. [2019-09-10 08:30:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:08,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:08,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:08,249 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1087651688, now seen corresponding path program 1 times [2019-09-10 08:30:08,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:08,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:08,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:08,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:08,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:08,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:08,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:08,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:08,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:08,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:08,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:08,513 INFO L87 Difference]: Start difference. First operand 1088 states and 1482 transitions. Second operand 9 states. [2019-09-10 08:30:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:11,946 INFO L93 Difference]: Finished difference Result 1838 states and 2519 transitions. [2019-09-10 08:30:11,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:11,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:11,952 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:30:11,952 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:30:11,953 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:30:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:30:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:30:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1481 transitions. [2019-09-10 08:30:11,968 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1481 transitions. Word has length 116 [2019-09-10 08:30:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:11,968 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1481 transitions. [2019-09-10 08:30:11,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1481 transitions. [2019-09-10 08:30:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:11,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:11,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,972 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:11,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -831066789, now seen corresponding path program 1 times [2019-09-10 08:30:11,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:11,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:11,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:12,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:12,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:12,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:12,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:12,198 INFO L87 Difference]: Start difference. First operand 1088 states and 1481 transitions. Second operand 9 states. [2019-09-10 08:30:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:16,368 INFO L93 Difference]: Finished difference Result 1846 states and 2533 transitions. [2019-09-10 08:30:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:16,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:16,373 INFO L225 Difference]: With dead ends: 1846 [2019-09-10 08:30:16,374 INFO L226 Difference]: Without dead ends: 1846 [2019-09-10 08:30:16,374 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:30:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-10 08:30:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-10 08:30:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1480 transitions. [2019-09-10 08:30:16,392 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1480 transitions. Word has length 116 [2019-09-10 08:30:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:16,392 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1480 transitions. [2019-09-10 08:30:16,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1480 transitions. [2019-09-10 08:30:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:16,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:16,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,396 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 755251996, now seen corresponding path program 1 times [2019-09-10 08:30:16,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:16,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:16,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:16,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:16,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:16,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:16,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:16,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:16,631 INFO L87 Difference]: Start difference. First operand 1088 states and 1480 transitions. Second operand 9 states. [2019-09-10 08:30:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:19,932 INFO L93 Difference]: Finished difference Result 1734 states and 2331 transitions. [2019-09-10 08:30:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:19,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:19,939 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:30:19,940 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:30:19,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:30:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:30:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1479 transitions. [2019-09-10 08:30:19,960 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1479 transitions. Word has length 116 [2019-09-10 08:30:19,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:19,960 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1479 transitions. [2019-09-10 08:30:19,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1479 transitions. [2019-09-10 08:30:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:19,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:19,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,964 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:19,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1390122634, now seen corresponding path program 1 times [2019-09-10 08:30:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:19,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:19,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:19,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:20,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:20,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:20,255 INFO L87 Difference]: Start difference. First operand 1088 states and 1479 transitions. Second operand 9 states. [2019-09-10 08:30:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:23,552 INFO L93 Difference]: Finished difference Result 1734 states and 2329 transitions. [2019-09-10 08:30:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:23,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:23,559 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:30:23,559 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:30:23,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:30:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:30:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1478 transitions. [2019-09-10 08:30:23,579 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1478 transitions. Word has length 116 [2019-09-10 08:30:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:23,579 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1478 transitions. [2019-09-10 08:30:23,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1478 transitions. [2019-09-10 08:30:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:23,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:23,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,583 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2105565842, now seen corresponding path program 1 times [2019-09-10 08:30:23,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:23,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:23,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:23,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:30:23,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:23,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:23,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:23,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:23,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:23,868 INFO L87 Difference]: Start difference. First operand 1088 states and 1478 transitions. Second operand 9 states. [2019-09-10 08:30:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:27,613 INFO L93 Difference]: Finished difference Result 1838 states and 2514 transitions. [2019-09-10 08:30:27,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:27,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:27,620 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:30:27,620 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:30:27,621 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:30:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:30:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:30:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1477 transitions. [2019-09-10 08:30:27,640 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1477 transitions. Word has length 116 [2019-09-10 08:30:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:27,640 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1477 transitions. [2019-09-10 08:30:27,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1477 transitions. [2019-09-10 08:30:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:27,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:27,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,643 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 708861456, now seen corresponding path program 1 times [2019-09-10 08:30:27,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:27,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:27,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:27,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:27,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:27,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:30:27,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:27,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:27,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:27,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:27,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:27,881 INFO L87 Difference]: Start difference. First operand 1088 states and 1477 transitions. Second operand 9 states. [2019-09-10 08:30:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:31,141 INFO L93 Difference]: Finished difference Result 1734 states and 2326 transitions. [2019-09-10 08:30:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:31,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:31,145 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:30:31,146 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:30:31,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:30:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:30:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1476 transitions. [2019-09-10 08:30:31,161 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1476 transitions. Word has length 116 [2019-09-10 08:30:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:31,162 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1476 transitions. [2019-09-10 08:30:31,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1476 transitions. [2019-09-10 08:30:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:31,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:31,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,165 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1139988945, now seen corresponding path program 1 times [2019-09-10 08:30:31,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:31,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:31,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:31,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:31,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:31,393 INFO L87 Difference]: Start difference. First operand 1088 states and 1476 transitions. Second operand 9 states. [2019-09-10 08:30:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:35,462 INFO L93 Difference]: Finished difference Result 1822 states and 2485 transitions. [2019-09-10 08:30:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:35,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:35,466 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:30:35,466 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:30:35,466 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:30:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:30:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:30:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1475 transitions. [2019-09-10 08:30:35,483 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1475 transitions. Word has length 116 [2019-09-10 08:30:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:35,483 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1475 transitions. [2019-09-10 08:30:35,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1475 transitions. [2019-09-10 08:30:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:35,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:35,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,486 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 629608632, now seen corresponding path program 1 times [2019-09-10 08:30:35,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:35,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:35,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:35,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:35,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:35,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:35,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:35,748 INFO L87 Difference]: Start difference. First operand 1088 states and 1475 transitions. Second operand 9 states. [2019-09-10 08:30:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:38,988 INFO L93 Difference]: Finished difference Result 1734 states and 2323 transitions. [2019-09-10 08:30:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:38,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:38,991 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:30:38,992 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:30:38,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:30:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:30:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1474 transitions. [2019-09-10 08:30:39,003 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1474 transitions. Word has length 116 [2019-09-10 08:30:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:39,004 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1474 transitions. [2019-09-10 08:30:39,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1474 transitions. [2019-09-10 08:30:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:39,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:39,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:39,006 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1428998625, now seen corresponding path program 1 times [2019-09-10 08:30:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:39,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:39,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:39,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:39,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:39,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:39,228 INFO L87 Difference]: Start difference. First operand 1088 states and 1474 transitions. Second operand 9 states. [2019-09-10 08:30:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:43,055 INFO L93 Difference]: Finished difference Result 1838 states and 2506 transitions. [2019-09-10 08:30:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:43,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:43,059 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:30:43,059 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:30:43,060 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:30:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:30:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:30:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1473 transitions. [2019-09-10 08:30:43,070 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1473 transitions. Word has length 116 [2019-09-10 08:30:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:43,070 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1473 transitions. [2019-09-10 08:30:43,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1473 transitions. [2019-09-10 08:30:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:43,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:43,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,073 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1794515206, now seen corresponding path program 1 times [2019-09-10 08:30:43,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:43,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:43,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:43,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:43,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:43,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:43,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:43,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:43,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:43,281 INFO L87 Difference]: Start difference. First operand 1088 states and 1473 transitions. Second operand 9 states. [2019-09-10 08:30:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:47,335 INFO L93 Difference]: Finished difference Result 1822 states and 2481 transitions. [2019-09-10 08:30:47,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:47,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:47,338 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:30:47,338 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:30:47,339 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:30:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:30:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:30:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1472 transitions. [2019-09-10 08:30:47,354 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1472 transitions. Word has length 116 [2019-09-10 08:30:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:47,354 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1472 transitions. [2019-09-10 08:30:47,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1472 transitions. [2019-09-10 08:30:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:47,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:47,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,357 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1410611137, now seen corresponding path program 1 times [2019-09-10 08:30:47,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:47,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:47,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:47,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:47,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:47,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:47,605 INFO L87 Difference]: Start difference. First operand 1088 states and 1472 transitions. Second operand 9 states. [2019-09-10 08:30:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:52,047 INFO L93 Difference]: Finished difference Result 1822 states and 2479 transitions. [2019-09-10 08:30:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:52,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:52,049 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:30:52,050 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:30:52,050 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:30:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:30:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:30:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1471 transitions. [2019-09-10 08:30:52,061 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1471 transitions. Word has length 116 [2019-09-10 08:30:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:52,061 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1471 transitions. [2019-09-10 08:30:52,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1471 transitions. [2019-09-10 08:30:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:52,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:52,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,063 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1661615888, now seen corresponding path program 1 times [2019-09-10 08:30:52,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:52,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:52,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:52,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:52,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:52,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:52,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:52,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:52,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:52,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:52,285 INFO L87 Difference]: Start difference. First operand 1088 states and 1471 transitions. Second operand 9 states. [2019-09-10 08:30:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:55,581 INFO L93 Difference]: Finished difference Result 1734 states and 2318 transitions. [2019-09-10 08:30:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:55,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:55,584 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:30:55,584 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:30:55,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:30:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:30:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1470 transitions. [2019-09-10 08:30:55,597 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1470 transitions. Word has length 116 [2019-09-10 08:30:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:55,598 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1470 transitions. [2019-09-10 08:30:55,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1470 transitions. [2019-09-10 08:30:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:55,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:55,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:55,600 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1027968626, now seen corresponding path program 1 times [2019-09-10 08:30:55,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:55,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:55,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:55,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:55,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:55,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:55,848 INFO L87 Difference]: Start difference. First operand 1088 states and 1470 transitions. Second operand 9 states. [2019-09-10 08:30:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:59,558 INFO L93 Difference]: Finished difference Result 1822 states and 2476 transitions. [2019-09-10 08:30:59,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:59,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:30:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:59,561 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:30:59,561 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:30:59,562 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:30:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:30:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:30:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:30:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1469 transitions. [2019-09-10 08:30:59,574 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1469 transitions. Word has length 116 [2019-09-10 08:30:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:59,574 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1469 transitions. [2019-09-10 08:30:59,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1469 transitions. [2019-09-10 08:30:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:30:59,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:59,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:59,577 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash -926819479, now seen corresponding path program 1 times [2019-09-10 08:30:59,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:59,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:59,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:59,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:59,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:59,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:59,811 INFO L87 Difference]: Start difference. First operand 1088 states and 1469 transitions. Second operand 9 states. [2019-09-10 08:31:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:04,193 INFO L93 Difference]: Finished difference Result 1822 states and 2475 transitions. [2019-09-10 08:31:04,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:04,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:31:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:04,196 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:31:04,197 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:31:04,197 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:31:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:31:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:31:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1468 transitions. [2019-09-10 08:31:04,210 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1468 transitions. Word has length 116 [2019-09-10 08:31:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:04,210 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1468 transitions. [2019-09-10 08:31:04,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1468 transitions. [2019-09-10 08:31:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:31:04,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:04,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:04,212 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash 579223384, now seen corresponding path program 1 times [2019-09-10 08:31:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:04,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:04,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:04,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:04,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:04,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:04,455 INFO L87 Difference]: Start difference. First operand 1088 states and 1468 transitions. Second operand 9 states. [2019-09-10 08:31:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:08,996 INFO L93 Difference]: Finished difference Result 1822 states and 2473 transitions. [2019-09-10 08:31:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:09,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:31:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:09,004 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:31:09,004 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:31:09,005 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:31:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:31:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:31:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1467 transitions. [2019-09-10 08:31:09,020 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1467 transitions. Word has length 116 [2019-09-10 08:31:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:09,021 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1467 transitions. [2019-09-10 08:31:09,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1467 transitions. [2019-09-10 08:31:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:09,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:09,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:09,024 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1137739447, now seen corresponding path program 1 times [2019-09-10 08:31:09,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:09,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:09,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:09,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:09,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:09,271 INFO L87 Difference]: Start difference. First operand 1088 states and 1467 transitions. Second operand 9 states. [2019-09-10 08:31:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:13,208 INFO L93 Difference]: Finished difference Result 1790 states and 2417 transitions. [2019-09-10 08:31:13,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:13,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:13,210 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:31:13,211 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:31:13,211 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:31:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:31:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:31:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1466 transitions. [2019-09-10 08:31:13,221 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1466 transitions. Word has length 118 [2019-09-10 08:31:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:13,222 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1466 transitions. [2019-09-10 08:31:13,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1466 transitions. [2019-09-10 08:31:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:13,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:13,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:13,223 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1008288702, now seen corresponding path program 1 times [2019-09-10 08:31:13,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:13,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:13,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:13,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:13,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:13,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:13,430 INFO L87 Difference]: Start difference. First operand 1088 states and 1466 transitions. Second operand 9 states. [2019-09-10 08:31:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:17,180 INFO L93 Difference]: Finished difference Result 1822 states and 2469 transitions. [2019-09-10 08:31:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:17,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:17,183 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:31:17,183 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:31:17,184 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:31:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:31:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:31:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1465 transitions. [2019-09-10 08:31:17,199 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1465 transitions. Word has length 118 [2019-09-10 08:31:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:17,199 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1465 transitions. [2019-09-10 08:31:17,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1465 transitions. [2019-09-10 08:31:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:17,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:17,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:17,202 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1568062438, now seen corresponding path program 1 times [2019-09-10 08:31:17,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:17,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:17,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:17,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:17,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:17,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:17,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:17,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:17,411 INFO L87 Difference]: Start difference. First operand 1088 states and 1465 transitions. Second operand 9 states. [2019-09-10 08:31:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:21,511 INFO L93 Difference]: Finished difference Result 1790 states and 2415 transitions. [2019-09-10 08:31:21,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:21,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:21,514 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:31:21,514 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:31:21,515 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:31:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:31:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:31:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1464 transitions. [2019-09-10 08:31:21,525 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1464 transitions. Word has length 118 [2019-09-10 08:31:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:21,525 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1464 transitions. [2019-09-10 08:31:21,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1464 transitions. [2019-09-10 08:31:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:21,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:21,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:21,527 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -530863933, now seen corresponding path program 1 times [2019-09-10 08:31:21,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:21,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:21,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:21,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:21,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:21,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:21,737 INFO L87 Difference]: Start difference. First operand 1088 states and 1464 transitions. Second operand 9 states. [2019-09-10 08:31:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:25,168 INFO L93 Difference]: Finished difference Result 1734 states and 2310 transitions. [2019-09-10 08:31:25,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:25,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:25,171 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:31:25,171 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:31:25,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:31:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:31:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1463 transitions. [2019-09-10 08:31:25,186 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1463 transitions. Word has length 118 [2019-09-10 08:31:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1463 transitions. [2019-09-10 08:31:25,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1463 transitions. [2019-09-10 08:31:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:25,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:25,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:25,190 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1463192374, now seen corresponding path program 1 times [2019-09-10 08:31:25,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:25,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:25,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:25,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:25,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:25,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:25,419 INFO L87 Difference]: Start difference. First operand 1088 states and 1463 transitions. Second operand 9 states. [2019-09-10 08:31:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:29,661 INFO L93 Difference]: Finished difference Result 1822 states and 2466 transitions. [2019-09-10 08:31:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:29,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:29,665 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:31:29,665 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:31:29,666 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:31:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:31:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:31:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1462 transitions. [2019-09-10 08:31:29,678 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1462 transitions. Word has length 118 [2019-09-10 08:31:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:29,678 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1462 transitions. [2019-09-10 08:31:29,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1462 transitions. [2019-09-10 08:31:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:29,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:29,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:29,680 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1333741629, now seen corresponding path program 1 times [2019-09-10 08:31:29,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:29,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:29,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:29,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:29,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:29,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:29,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:29,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:29,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:29,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:29,887 INFO L87 Difference]: Start difference. First operand 1088 states and 1462 transitions. Second operand 9 states. [2019-09-10 08:31:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:33,350 INFO L93 Difference]: Finished difference Result 1734 states and 2307 transitions. [2019-09-10 08:31:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:33,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:33,353 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:31:33,353 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:31:33,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:31:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:31:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1461 transitions. [2019-09-10 08:31:33,366 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1461 transitions. Word has length 118 [2019-09-10 08:31:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:33,367 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1461 transitions. [2019-09-10 08:31:33,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1461 transitions. [2019-09-10 08:31:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:33,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:33,369 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash -872434601, now seen corresponding path program 1 times [2019-09-10 08:31:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:33,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:33,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:33,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:33,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:33,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:33,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:33,600 INFO L87 Difference]: Start difference. First operand 1088 states and 1461 transitions. Second operand 9 states. [2019-09-10 08:31:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:37,873 INFO L93 Difference]: Finished difference Result 1838 states and 2488 transitions. [2019-09-10 08:31:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:37,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:37,876 INFO L225 Difference]: With dead ends: 1838 [2019-09-10 08:31:37,876 INFO L226 Difference]: Without dead ends: 1838 [2019-09-10 08:31:37,877 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:31:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-10 08:31:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-10 08:31:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1460 transitions. [2019-09-10 08:31:37,892 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1460 transitions. Word has length 118 [2019-09-10 08:31:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:37,892 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1460 transitions. [2019-09-10 08:31:37,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1460 transitions. [2019-09-10 08:31:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:37,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:37,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:37,895 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 302871591, now seen corresponding path program 1 times [2019-09-10 08:31:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:37,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:38,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:38,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:38,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:38,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:38,094 INFO L87 Difference]: Start difference. First operand 1088 states and 1460 transitions. Second operand 9 states. [2019-09-10 08:31:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:42,167 INFO L93 Difference]: Finished difference Result 1822 states and 2462 transitions. [2019-09-10 08:31:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:42,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:42,171 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:31:42,171 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:31:42,171 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:31:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:31:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:31:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1459 transitions. [2019-09-10 08:31:42,182 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1459 transitions. Word has length 118 [2019-09-10 08:31:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:42,182 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1459 transitions. [2019-09-10 08:31:42,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1459 transitions. [2019-09-10 08:31:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:42,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:42,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:42,184 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -663297848, now seen corresponding path program 1 times [2019-09-10 08:31:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:42,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:42,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:42,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:42,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:42,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:42,362 INFO L87 Difference]: Start difference. First operand 1088 states and 1459 transitions. Second operand 9 states. [2019-09-10 08:31:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:46,227 INFO L93 Difference]: Finished difference Result 1790 states and 2408 transitions. [2019-09-10 08:31:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:46,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:46,232 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:31:46,232 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:31:46,232 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:31:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:31:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:31:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1458 transitions. [2019-09-10 08:31:46,247 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1458 transitions. Word has length 118 [2019-09-10 08:31:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:46,248 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1458 transitions. [2019-09-10 08:31:46,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1458 transitions. [2019-09-10 08:31:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:46,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:46,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:46,251 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1719539060, now seen corresponding path program 1 times [2019-09-10 08:31:46,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:46,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:46,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:46,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:46,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:46,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:46,512 INFO L87 Difference]: Start difference. First operand 1088 states and 1458 transitions. Second operand 9 states. [2019-09-10 08:31:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:49,663 INFO L93 Difference]: Finished difference Result 1734 states and 2303 transitions. [2019-09-10 08:31:49,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:49,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:49,666 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:31:49,667 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:31:49,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:31:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:31:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1457 transitions. [2019-09-10 08:31:49,678 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1457 transitions. Word has length 118 [2019-09-10 08:31:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:49,679 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1457 transitions. [2019-09-10 08:31:49,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1457 transitions. [2019-09-10 08:31:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:49,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:49,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:49,681 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1927601820, now seen corresponding path program 1 times [2019-09-10 08:31:49,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:49,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:49,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:49,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:49,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:49,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:49,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:49,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:49,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:49,837 INFO L87 Difference]: Start difference. First operand 1088 states and 1457 transitions. Second operand 9 states. [2019-09-10 08:31:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:53,882 INFO L93 Difference]: Finished difference Result 1822 states and 2458 transitions. [2019-09-10 08:31:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:53,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:53,885 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:31:53,885 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:31:53,886 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:31:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:31:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:31:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1456 transitions. [2019-09-10 08:31:53,898 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1456 transitions. Word has length 118 [2019-09-10 08:31:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:53,898 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1456 transitions. [2019-09-10 08:31:53,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1456 transitions. [2019-09-10 08:31:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:53,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:53,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:53,900 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1456886781, now seen corresponding path program 1 times [2019-09-10 08:31:53,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:53,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:53,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:53,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:53,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:54,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:54,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:54,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:54,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:54,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:54,071 INFO L87 Difference]: Start difference. First operand 1088 states and 1456 transitions. Second operand 9 states. [2019-09-10 08:31:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:57,492 INFO L93 Difference]: Finished difference Result 1734 states and 2300 transitions. [2019-09-10 08:31:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:57,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:31:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:57,495 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:31:57,495 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:31:57,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:31:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:31:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:31:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1455 transitions. [2019-09-10 08:31:57,506 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1455 transitions. Word has length 118 [2019-09-10 08:31:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:57,506 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1455 transitions. [2019-09-10 08:31:57,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1455 transitions. [2019-09-10 08:31:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:31:57,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:57,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:57,508 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1328567384, now seen corresponding path program 1 times [2019-09-10 08:31:57,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:57,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:57,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:57,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:57,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:57,706 INFO L87 Difference]: Start difference. First operand 1088 states and 1455 transitions. Second operand 9 states. [2019-09-10 08:32:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:01,769 INFO L93 Difference]: Finished difference Result 1822 states and 2456 transitions. [2019-09-10 08:32:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:01,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:01,772 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:32:01,772 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:32:01,773 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:32:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:32:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:32:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1454 transitions. [2019-09-10 08:32:01,784 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1454 transitions. Word has length 118 [2019-09-10 08:32:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:01,784 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1454 transitions. [2019-09-10 08:32:01,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1454 transitions. [2019-09-10 08:32:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:01,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:01,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:01,786 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2000230473, now seen corresponding path program 1 times [2019-09-10 08:32:01,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:01,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:01,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:01,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:01,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:01,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:01,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:01,990 INFO L87 Difference]: Start difference. First operand 1088 states and 1454 transitions. Second operand 9 states. [2019-09-10 08:32:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,890 INFO L93 Difference]: Finished difference Result 1790 states and 2402 transitions. [2019-09-10 08:32:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:05,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,893 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:32:05,893 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:32:05,893 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:32:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:32:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:32:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1453 transitions. [2019-09-10 08:32:05,908 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1453 transitions. Word has length 118 [2019-09-10 08:32:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,908 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1453 transitions. [2019-09-10 08:32:05,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1453 transitions. [2019-09-10 08:32:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:05,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:05,911 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1344929323, now seen corresponding path program 1 times [2019-09-10 08:32:05,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:06,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:06,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:06,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:06,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:06,121 INFO L87 Difference]: Start difference. First operand 1088 states and 1453 transitions. Second operand 9 states. [2019-09-10 08:32:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:09,362 INFO L93 Difference]: Finished difference Result 1734 states and 2296 transitions. [2019-09-10 08:32:09,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:09,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:09,364 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:09,364 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:09,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1452 transitions. [2019-09-10 08:32:09,375 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1452 transitions. Word has length 118 [2019-09-10 08:32:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:09,375 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1452 transitions. [2019-09-10 08:32:09,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1452 transitions. [2019-09-10 08:32:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:09,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:09,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:09,377 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1214970847, now seen corresponding path program 1 times [2019-09-10 08:32:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:09,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:09,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:09,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:09,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:09,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:09,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:09,555 INFO L87 Difference]: Start difference. First operand 1088 states and 1452 transitions. Second operand 9 states. [2019-09-10 08:32:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:13,246 INFO L93 Difference]: Finished difference Result 1822 states and 2451 transitions. [2019-09-10 08:32:13,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:13,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:13,249 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:32:13,249 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:32:13,250 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:32:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:32:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:32:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1451 transitions. [2019-09-10 08:32:13,260 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1451 transitions. Word has length 118 [2019-09-10 08:32:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:13,261 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1451 transitions. [2019-09-10 08:32:13,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1451 transitions. [2019-09-10 08:32:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:13,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:13,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:13,263 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 98899166, now seen corresponding path program 1 times [2019-09-10 08:32:13,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:13,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:13,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:13,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:13,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:13,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:13,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:13,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:13,431 INFO L87 Difference]: Start difference. First operand 1088 states and 1451 transitions. Second operand 9 states. [2019-09-10 08:32:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:16,661 INFO L93 Difference]: Finished difference Result 1734 states and 2294 transitions. [2019-09-10 08:32:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:16,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:16,664 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:16,665 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:16,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1450 transitions. [2019-09-10 08:32:16,677 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1450 transitions. Word has length 118 [2019-09-10 08:32:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:16,677 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1450 transitions. [2019-09-10 08:32:16,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1450 transitions. [2019-09-10 08:32:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:16,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:16,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:16,679 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:16,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2028055678, now seen corresponding path program 1 times [2019-09-10 08:32:16,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:16,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:16,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:16,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:16,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:16,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:16,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:16,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:16,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:16,825 INFO L87 Difference]: Start difference. First operand 1088 states and 1450 transitions. Second operand 9 states. [2019-09-10 08:32:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:20,993 INFO L93 Difference]: Finished difference Result 1822 states and 2447 transitions. [2019-09-10 08:32:20,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:20,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:20,996 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:32:20,996 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:32:20,996 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:32:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:32:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:32:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1449 transitions. [2019-09-10 08:32:21,008 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1449 transitions. Word has length 118 [2019-09-10 08:32:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:21,008 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1449 transitions. [2019-09-10 08:32:21,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1449 transitions. [2019-09-10 08:32:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:21,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:21,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:21,011 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1708413887, now seen corresponding path program 1 times [2019-09-10 08:32:21,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:21,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:21,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:21,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:21,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:21,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:21,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:21,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:21,175 INFO L87 Difference]: Start difference. First operand 1088 states and 1449 transitions. Second operand 9 states. [2019-09-10 08:32:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:24,953 INFO L93 Difference]: Finished difference Result 1790 states and 2396 transitions. [2019-09-10 08:32:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:24,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:24,956 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:32:24,956 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:32:24,957 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:32:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:32:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:32:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1448 transitions. [2019-09-10 08:32:24,968 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1448 transitions. Word has length 118 [2019-09-10 08:32:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1448 transitions. [2019-09-10 08:32:24,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1448 transitions. [2019-09-10 08:32:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:24,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:24,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:24,970 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash 488903043, now seen corresponding path program 1 times [2019-09-10 08:32:24,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:24,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:25,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:32:25,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:25,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:25,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:25,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:25,124 INFO L87 Difference]: Start difference. First operand 1088 states and 1448 transitions. Second operand 9 states. [2019-09-10 08:32:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:28,274 INFO L93 Difference]: Finished difference Result 1734 states and 2290 transitions. [2019-09-10 08:32:28,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:28,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:28,277 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:28,278 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:28,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1447 transitions. [2019-09-10 08:32:28,289 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1447 transitions. Word has length 118 [2019-09-10 08:32:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:28,289 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1447 transitions. [2019-09-10 08:32:28,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1447 transitions. [2019-09-10 08:32:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:28,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:28,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:28,291 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:28,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:28,291 INFO L82 PathProgramCache]: Analyzing trace with hash 190374528, now seen corresponding path program 1 times [2019-09-10 08:32:28,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:28,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:28,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:28,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:28,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:28,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:28,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:28,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:28,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:28,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:28,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:28,461 INFO L87 Difference]: Start difference. First operand 1088 states and 1447 transitions. Second operand 9 states. [2019-09-10 08:32:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:31,774 INFO L93 Difference]: Finished difference Result 1734 states and 2288 transitions. [2019-09-10 08:32:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:31,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:31,778 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:31,778 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:31,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1446 transitions. [2019-09-10 08:32:31,792 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1446 transitions. Word has length 118 [2019-09-10 08:32:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:31,792 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1446 transitions. [2019-09-10 08:32:31,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1446 transitions. [2019-09-10 08:32:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:31,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:31,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:31,795 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 661276899, now seen corresponding path program 1 times [2019-09-10 08:32:31,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:31,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:31,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:31,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:31,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:31,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:31,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:31,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:31,993 INFO L87 Difference]: Start difference. First operand 1088 states and 1446 transitions. Second operand 9 states. [2019-09-10 08:32:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:36,083 INFO L93 Difference]: Finished difference Result 1790 states and 2391 transitions. [2019-09-10 08:32:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:36,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:36,087 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:32:36,087 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:32:36,088 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:32:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:32:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:32:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1445 transitions. [2019-09-10 08:32:36,101 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1445 transitions. Word has length 118 [2019-09-10 08:32:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:36,101 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1445 transitions. [2019-09-10 08:32:36,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:36,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1445 transitions. [2019-09-10 08:32:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:36,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:36,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:36,103 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1436168909, now seen corresponding path program 1 times [2019-09-10 08:32:36,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:36,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:36,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:36,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:36,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:36,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:36,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:36,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:36,270 INFO L87 Difference]: Start difference. First operand 1088 states and 1445 transitions. Second operand 9 states. [2019-09-10 08:32:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:39,519 INFO L93 Difference]: Finished difference Result 1734 states and 2285 transitions. [2019-09-10 08:32:39,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:39,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:39,522 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:39,522 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:39,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1444 transitions. [2019-09-10 08:32:39,537 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1444 transitions. Word has length 118 [2019-09-10 08:32:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:39,538 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1444 transitions. [2019-09-10 08:32:39,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1444 transitions. [2019-09-10 08:32:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:39,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:39,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:39,541 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1268958251, now seen corresponding path program 1 times [2019-09-10 08:32:39,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:39,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:39,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:39,733 INFO L87 Difference]: Start difference. First operand 1088 states and 1444 transitions. Second operand 9 states. [2019-09-10 08:32:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:43,910 INFO L93 Difference]: Finished difference Result 1822 states and 2438 transitions. [2019-09-10 08:32:43,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:43,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:43,913 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:32:43,913 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:32:43,913 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:32:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:32:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:32:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1443 transitions. [2019-09-10 08:32:43,926 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1443 transitions. Word has length 118 [2019-09-10 08:32:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:43,926 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1443 transitions. [2019-09-10 08:32:43,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1443 transitions. [2019-09-10 08:32:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:43,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:43,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:43,928 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:43,928 INFO L82 PathProgramCache]: Analyzing trace with hash 302788812, now seen corresponding path program 1 times [2019-09-10 08:32:43,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:43,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:44,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:44,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:44,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:44,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:44,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:44,085 INFO L87 Difference]: Start difference. First operand 1088 states and 1443 transitions. Second operand 9 states. [2019-09-10 08:32:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:47,638 INFO L93 Difference]: Finished difference Result 1790 states and 2387 transitions. [2019-09-10 08:32:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:47,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:47,641 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:32:47,641 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:32:47,641 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:32:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:32:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:32:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1442 transitions. [2019-09-10 08:32:47,652 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1442 transitions. Word has length 118 [2019-09-10 08:32:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:47,652 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1442 transitions. [2019-09-10 08:32:47,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1442 transitions. [2019-09-10 08:32:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:47,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:47,654 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:47,654 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1718311127, now seen corresponding path program 1 times [2019-09-10 08:32:47,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:47,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:47,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:47,815 INFO L87 Difference]: Start difference. First operand 1088 states and 1442 transitions. Second operand 9 states. [2019-09-10 08:32:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:51,091 INFO L93 Difference]: Finished difference Result 1734 states and 2281 transitions. [2019-09-10 08:32:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:51,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:51,094 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:51,094 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:51,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1441 transitions. [2019-09-10 08:32:51,106 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1441 transitions. Word has length 118 [2019-09-10 08:32:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:51,106 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1441 transitions. [2019-09-10 08:32:51,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1441 transitions. [2019-09-10 08:32:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:51,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:51,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:51,109 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1719479256, now seen corresponding path program 1 times [2019-09-10 08:32:51,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:51,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:51,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:51,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:51,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:51,282 INFO L87 Difference]: Start difference. First operand 1088 states and 1441 transitions. Second operand 9 states. [2019-09-10 08:32:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:55,410 INFO L93 Difference]: Finished difference Result 1790 states and 2384 transitions. [2019-09-10 08:32:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:55,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:55,412 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:32:55,412 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:32:55,413 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:32:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:32:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:32:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1440 transitions. [2019-09-10 08:32:55,422 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1440 transitions. Word has length 118 [2019-09-10 08:32:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:55,423 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1440 transitions. [2019-09-10 08:32:55,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1440 transitions. [2019-09-10 08:32:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:55,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:55,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:55,425 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1598048276, now seen corresponding path program 1 times [2019-09-10 08:32:55,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:55,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:55,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:55,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:55,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:55,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:55,585 INFO L87 Difference]: Start difference. First operand 1088 states and 1440 transitions. Second operand 9 states. [2019-09-10 08:32:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:58,949 INFO L93 Difference]: Finished difference Result 1734 states and 2278 transitions. [2019-09-10 08:32:58,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:58,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:32:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:58,953 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:32:58,953 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:32:58,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:32:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:32:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:32:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1439 transitions. [2019-09-10 08:32:58,964 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1439 transitions. Word has length 118 [2019-09-10 08:32:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:58,964 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1439 transitions. [2019-09-10 08:32:58,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1439 transitions. [2019-09-10 08:32:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:32:58,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:58,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:58,967 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash -988448613, now seen corresponding path program 1 times [2019-09-10 08:32:58,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:58,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:58,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:59,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:59,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:59,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:59,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:59,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:59,136 INFO L87 Difference]: Start difference. First operand 1088 states and 1439 transitions. Second operand 9 states. [2019-09-10 08:33:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:02,621 INFO L93 Difference]: Finished difference Result 1734 states and 2276 transitions. [2019-09-10 08:33:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:02,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:33:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:02,624 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:02,624 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:02,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1438 transitions. [2019-09-10 08:33:02,635 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1438 transitions. Word has length 118 [2019-09-10 08:33:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:02,636 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1438 transitions. [2019-09-10 08:33:02,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1438 transitions. [2019-09-10 08:33:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:33:02,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:02,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:02,637 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1076099122, now seen corresponding path program 1 times [2019-09-10 08:33:02,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:02,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:02,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:02,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:02,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:02,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:02,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:02,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:02,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:02,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:02,786 INFO L87 Difference]: Start difference. First operand 1088 states and 1438 transitions. Second operand 9 states. [2019-09-10 08:33:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:07,022 INFO L93 Difference]: Finished difference Result 1790 states and 2379 transitions. [2019-09-10 08:33:07,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:07,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:33:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:07,025 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:33:07,025 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:33:07,026 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:33:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:33:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:33:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1437 transitions. [2019-09-10 08:33:07,036 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1437 transitions. Word has length 118 [2019-09-10 08:33:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:07,036 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1437 transitions. [2019-09-10 08:33:07,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1437 transitions. [2019-09-10 08:33:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:33:07,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:07,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:07,038 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash -524771572, now seen corresponding path program 1 times [2019-09-10 08:33:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:07,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:07,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:07,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:07,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:07,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:07,197 INFO L87 Difference]: Start difference. First operand 1088 states and 1437 transitions. Second operand 9 states. [2019-09-10 08:33:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:11,146 INFO L93 Difference]: Finished difference Result 1790 states and 2378 transitions. [2019-09-10 08:33:11,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:11,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:33:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:11,149 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:33:11,150 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:33:11,150 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:33:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:33:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:33:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1436 transitions. [2019-09-10 08:33:11,160 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1436 transitions. Word has length 119 [2019-09-10 08:33:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:11,160 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1436 transitions. [2019-09-10 08:33:11,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1436 transitions. [2019-09-10 08:33:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:11,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:11,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:11,162 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash 438986769, now seen corresponding path program 1 times [2019-09-10 08:33:11,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:11,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:11,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:11,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:11,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:11,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:11,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:11,338 INFO L87 Difference]: Start difference. First operand 1088 states and 1436 transitions. Second operand 9 states. [2019-09-10 08:33:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:15,347 INFO L93 Difference]: Finished difference Result 1790 states and 2376 transitions. [2019-09-10 08:33:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:15,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:15,350 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:33:15,350 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:33:15,350 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:33:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:33:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:33:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1435 transitions. [2019-09-10 08:33:15,361 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1435 transitions. Word has length 120 [2019-09-10 08:33:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:15,361 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1435 transitions. [2019-09-10 08:33:15,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1435 transitions. [2019-09-10 08:33:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:15,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:15,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:15,363 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1490169743, now seen corresponding path program 1 times [2019-09-10 08:33:15,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:15,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:15,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:15,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:15,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:15,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:15,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:15,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:15,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:15,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:15,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:15,510 INFO L87 Difference]: Start difference. First operand 1088 states and 1435 transitions. Second operand 9 states. [2019-09-10 08:33:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:19,351 INFO L93 Difference]: Finished difference Result 1734 states and 2272 transitions. [2019-09-10 08:33:19,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:19,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:19,354 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:19,354 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:19,354 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:33:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1434 transitions. [2019-09-10 08:33:19,363 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1434 transitions. Word has length 120 [2019-09-10 08:33:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:19,364 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1434 transitions. [2019-09-10 08:33:19,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1434 transitions. [2019-09-10 08:33:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:19,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:19,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:19,366 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:19,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1643582949, now seen corresponding path program 1 times [2019-09-10 08:33:19,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:19,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:19,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:19,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:19,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:19,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:19,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:19,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:19,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:19,518 INFO L87 Difference]: Start difference. First operand 1088 states and 1434 transitions. Second operand 9 states. [2019-09-10 08:33:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:23,382 INFO L93 Difference]: Finished difference Result 1734 states and 2270 transitions. [2019-09-10 08:33:23,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:23,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:23,386 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:23,386 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:23,386 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:33:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1433 transitions. [2019-09-10 08:33:23,398 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1433 transitions. Word has length 120 [2019-09-10 08:33:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:23,398 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1433 transitions. [2019-09-10 08:33:23,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1433 transitions. [2019-09-10 08:33:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:23,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:23,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] [2019-09-10 08:33:23,400 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:23,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash -526309723, now seen corresponding path program 1 times [2019-09-10 08:33:23,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:23,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:23,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:23,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:23,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:23,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:23,561 INFO L87 Difference]: Start difference. First operand 1088 states and 1433 transitions. Second operand 9 states. [2019-09-10 08:33:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:27,384 INFO L93 Difference]: Finished difference Result 1734 states and 2269 transitions. [2019-09-10 08:33:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:27,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:27,386 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:27,386 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:27,387 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:33:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1432 transitions. [2019-09-10 08:33:27,396 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1432 transitions. Word has length 120 [2019-09-10 08:33:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:27,396 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1432 transitions. [2019-09-10 08:33:27,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1432 transitions. [2019-09-10 08:33:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:27,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:27,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:27,398 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1818410374, now seen corresponding path program 1 times [2019-09-10 08:33:27,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:27,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:27,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:27,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:27,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:27,579 INFO L87 Difference]: Start difference. First operand 1088 states and 1432 transitions. Second operand 9 states. [2019-09-10 08:33:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:31,365 INFO L93 Difference]: Finished difference Result 1734 states and 2267 transitions. [2019-09-10 08:33:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:31,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:31,368 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:31,368 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:31,369 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:33:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1431 transitions. [2019-09-10 08:33:31,378 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1431 transitions. Word has length 120 [2019-09-10 08:33:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:31,379 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1431 transitions. [2019-09-10 08:33:31,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1431 transitions. [2019-09-10 08:33:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:31,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:31,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:31,380 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2031462205, now seen corresponding path program 1 times [2019-09-10 08:33:31,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:31,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:31,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:31,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:31,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:31,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:31,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:31,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:31,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:31,537 INFO L87 Difference]: Start difference. First operand 1088 states and 1431 transitions. Second operand 9 states. [2019-09-10 08:33:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:35,160 INFO L93 Difference]: Finished difference Result 1734 states and 2266 transitions. [2019-09-10 08:33:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:35,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:35,164 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:35,164 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:35,164 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:33:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1430 transitions. [2019-09-10 08:33:35,173 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1430 transitions. Word has length 120 [2019-09-10 08:33:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:35,173 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1430 transitions. [2019-09-10 08:33:35,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1430 transitions. [2019-09-10 08:33:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:35,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:35,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:35,175 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash -34663321, now seen corresponding path program 1 times [2019-09-10 08:33:35,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:35,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:35,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:35,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:35,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:35,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:33:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:35,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:35,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:35,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:35,350 INFO L87 Difference]: Start difference. First operand 1088 states and 1430 transitions. Second operand 9 states. [2019-09-10 08:33:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:39,682 INFO L93 Difference]: Finished difference Result 1790 states and 2367 transitions. [2019-09-10 08:33:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:39,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:39,685 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:33:39,685 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:33:39,686 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:33:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:33:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:33:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1429 transitions. [2019-09-10 08:33:39,697 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1429 transitions. Word has length 120 [2019-09-10 08:33:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:39,697 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1429 transitions. [2019-09-10 08:33:39,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1429 transitions. [2019-09-10 08:33:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:39,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:39,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:39,699 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 462579645, now seen corresponding path program 1 times [2019-09-10 08:33:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:39,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:39,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:39,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:39,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:39,852 INFO L87 Difference]: Start difference. First operand 1088 states and 1429 transitions. Second operand 9 states. [2019-09-10 08:33:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:43,955 INFO L93 Difference]: Finished difference Result 1790 states and 2365 transitions. [2019-09-10 08:33:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:43,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:43,959 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:33:43,959 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:33:43,959 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:33:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:33:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:33:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1428 transitions. [2019-09-10 08:33:43,971 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1428 transitions. Word has length 120 [2019-09-10 08:33:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:43,971 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1428 transitions. [2019-09-10 08:33:43,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1428 transitions. [2019-09-10 08:33:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:43,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:43,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:43,974 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:43,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1466576867, now seen corresponding path program 1 times [2019-09-10 08:33:43,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:44,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:33:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:44,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:44,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:44,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:44,133 INFO L87 Difference]: Start difference. First operand 1088 states and 1428 transitions. Second operand 9 states. [2019-09-10 08:33:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:47,931 INFO L93 Difference]: Finished difference Result 1734 states and 2263 transitions. [2019-09-10 08:33:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:47,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:47,934 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:47,934 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:47,935 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:33:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1427 transitions. [2019-09-10 08:33:47,946 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1427 transitions. Word has length 120 [2019-09-10 08:33:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:47,946 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1427 transitions. [2019-09-10 08:33:47,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1427 transitions. [2019-09-10 08:33:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:47,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:47,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:47,947 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash -502475548, now seen corresponding path program 1 times [2019-09-10 08:33:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:47,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:47,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:48,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:48,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:48,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:48,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:48,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:48,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:48,110 INFO L87 Difference]: Start difference. First operand 1088 states and 1427 transitions. Second operand 9 states. [2019-09-10 08:33:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:51,512 INFO L93 Difference]: Finished difference Result 1734 states and 2262 transitions. [2019-09-10 08:33:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:51,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:51,515 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:33:51,515 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:33:51,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:33:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:33:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1426 transitions. [2019-09-10 08:33:51,528 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1426 transitions. Word has length 120 [2019-09-10 08:33:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:51,528 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1426 transitions. [2019-09-10 08:33:51,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1426 transitions. [2019-09-10 08:33:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:51,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:51,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:51,530 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1493972807, now seen corresponding path program 1 times [2019-09-10 08:33:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:51,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:51,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:51,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:51,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:51,704 INFO L87 Difference]: Start difference. First operand 1088 states and 1426 transitions. Second operand 9 states. [2019-09-10 08:33:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:55,755 INFO L93 Difference]: Finished difference Result 1790 states and 2361 transitions. [2019-09-10 08:33:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:55,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:55,758 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:33:55,759 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:33:55,759 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:33:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:33:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:33:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:33:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1425 transitions. [2019-09-10 08:33:55,769 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1425 transitions. Word has length 120 [2019-09-10 08:33:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:55,769 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1425 transitions. [2019-09-10 08:33:55,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1425 transitions. [2019-09-10 08:33:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:55,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:55,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:55,770 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2061061959, now seen corresponding path program 1 times [2019-09-10 08:33:55,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:55,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:55,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:55,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:55,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:55,930 INFO L87 Difference]: Start difference. First operand 1088 states and 1425 transitions. Second operand 9 states. [2019-09-10 08:34:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:00,009 INFO L93 Difference]: Finished difference Result 1822 states and 2411 transitions. [2019-09-10 08:34:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:00,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:00,013 INFO L225 Difference]: With dead ends: 1822 [2019-09-10 08:34:00,013 INFO L226 Difference]: Without dead ends: 1822 [2019-09-10 08:34:00,013 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:34:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-10 08:34:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-10 08:34:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1424 transitions. [2019-09-10 08:34:00,024 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1424 transitions. Word has length 120 [2019-09-10 08:34:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:00,024 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1424 transitions. [2019-09-10 08:34:00,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1424 transitions. [2019-09-10 08:34:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:00,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:00,026 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1566617361, now seen corresponding path program 1 times [2019-09-10 08:34:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:00,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:00,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:00,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:00,197 INFO L87 Difference]: Start difference. First operand 1088 states and 1424 transitions. Second operand 9 states. [2019-09-10 08:34:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:03,824 INFO L93 Difference]: Finished difference Result 1734 states and 2259 transitions. [2019-09-10 08:34:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:03,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:03,828 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:03,828 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:03,828 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:34:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1423 transitions. [2019-09-10 08:34:03,839 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1423 transitions. Word has length 120 [2019-09-10 08:34:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:03,839 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1423 transitions. [2019-09-10 08:34:03,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1423 transitions. [2019-09-10 08:34:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:03,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:03,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:03,841 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash -799193423, now seen corresponding path program 1 times [2019-09-10 08:34:03,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:03,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:03,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:03,990 INFO L134 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:34:03,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:03,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:03,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:03,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:03,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:03,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:03,991 INFO L87 Difference]: Start difference. First operand 1088 states and 1423 transitions. Second operand 9 states. [2019-09-10 08:34:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:07,871 INFO L93 Difference]: Finished difference Result 1790 states and 2358 transitions. [2019-09-10 08:34:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:07,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:07,875 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:34:07,875 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:34:07,875 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:34:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:34:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:34:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1422 transitions. [2019-09-10 08:34:07,909 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1422 transitions. Word has length 120 [2019-09-10 08:34:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:07,909 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1422 transitions. [2019-09-10 08:34:07,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1422 transitions. [2019-09-10 08:34:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:07,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:07,913 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1289509032, now seen corresponding path program 1 times [2019-09-10 08:34:07,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:07,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:08,074 INFO L134 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:34:08,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:08,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:08,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:08,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:08,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:08,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:08,075 INFO L87 Difference]: Start difference. First operand 1088 states and 1422 transitions. Second operand 9 states. [2019-09-10 08:34:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:11,463 INFO L93 Difference]: Finished difference Result 1734 states and 2256 transitions. [2019-09-10 08:34:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:11,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:11,466 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:11,466 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:11,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:34:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1421 transitions. [2019-09-10 08:34:11,476 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1421 transitions. Word has length 120 [2019-09-10 08:34:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:11,476 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1421 transitions. [2019-09-10 08:34:11,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1421 transitions. [2019-09-10 08:34:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:11,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:11,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:11,478 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1774124078, now seen corresponding path program 1 times [2019-09-10 08:34:11,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:11,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:11,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:11,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:34:11,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:11,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:11,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:11,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:11,664 INFO L87 Difference]: Start difference. First operand 1088 states and 1421 transitions. Second operand 9 states. [2019-09-10 08:34:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:15,324 INFO L93 Difference]: Finished difference Result 1734 states and 2255 transitions. [2019-09-10 08:34:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:15,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:15,327 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:15,327 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:15,327 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:34:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1420 transitions. [2019-09-10 08:34:15,335 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1420 transitions. Word has length 120 [2019-09-10 08:34:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:15,336 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1420 transitions. [2019-09-10 08:34:15,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1420 transitions. [2019-09-10 08:34:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:15,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:15,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:15,337 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1734122598, now seen corresponding path program 1 times [2019-09-10 08:34:15,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:15,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:15,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:15,497 INFO L134 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:34:15,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:15,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:15,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:15,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:15,498 INFO L87 Difference]: Start difference. First operand 1088 states and 1420 transitions. Second operand 9 states. [2019-09-10 08:34:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:19,471 INFO L93 Difference]: Finished difference Result 1790 states and 2354 transitions. [2019-09-10 08:34:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:19,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:19,475 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:34:19,475 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:34:19,475 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:34:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:34:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:34:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1419 transitions. [2019-09-10 08:34:19,485 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1419 transitions. Word has length 120 [2019-09-10 08:34:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:19,485 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1419 transitions. [2019-09-10 08:34:19,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1419 transitions. [2019-09-10 08:34:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:19,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:19,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:19,487 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash -928740028, now seen corresponding path program 1 times [2019-09-10 08:34:19,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:19,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:19,630 INFO L134 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:34:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:19,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:19,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:19,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:19,631 INFO L87 Difference]: Start difference. First operand 1088 states and 1419 transitions. Second operand 9 states. [2019-09-10 08:34:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:23,297 INFO L93 Difference]: Finished difference Result 1734 states and 2253 transitions. [2019-09-10 08:34:23,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:23,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:23,300 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:23,300 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:23,300 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:34:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1418 transitions. [2019-09-10 08:34:23,310 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1418 transitions. Word has length 120 [2019-09-10 08:34:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:23,310 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1418 transitions. [2019-09-10 08:34:23,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1418 transitions. [2019-09-10 08:34:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:23,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:23,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:23,311 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2093888074, now seen corresponding path program 1 times [2019-09-10 08:34:23,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:23,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:23,522 INFO L134 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:34:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:23,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:23,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:23,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:23,523 INFO L87 Difference]: Start difference. First operand 1088 states and 1418 transitions. Second operand 9 states. [2019-09-10 08:34:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:27,706 INFO L93 Difference]: Finished difference Result 1790 states and 2350 transitions. [2019-09-10 08:34:27,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:27,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:27,709 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:34:27,709 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:34:27,709 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:34:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:34:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:34:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1417 transitions. [2019-09-10 08:34:27,720 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1417 transitions. Word has length 120 [2019-09-10 08:34:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:27,720 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1417 transitions. [2019-09-10 08:34:27,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1417 transitions. [2019-09-10 08:34:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:27,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:27,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:27,721 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2079343493, now seen corresponding path program 1 times [2019-09-10 08:34:27,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:27,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:27,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:27,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:27,899 INFO L134 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:34:27,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:27,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:27,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:27,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:27,901 INFO L87 Difference]: Start difference. First operand 1088 states and 1417 transitions. Second operand 9 states. [2019-09-10 08:34:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:31,726 INFO L93 Difference]: Finished difference Result 1790 states and 2348 transitions. [2019-09-10 08:34:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:31,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:31,729 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:34:31,730 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:34:31,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:34:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:34:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1416 transitions. [2019-09-10 08:34:31,740 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1416 transitions. Word has length 120 [2019-09-10 08:34:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:31,741 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1416 transitions. [2019-09-10 08:34:31,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1416 transitions. [2019-09-10 08:34:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:31,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:31,742 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:31,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1273960923, now seen corresponding path program 1 times [2019-09-10 08:34:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:31,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:31,888 INFO L134 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:34:31,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:31,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:31,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:31,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:31,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:31,889 INFO L87 Difference]: Start difference. First operand 1088 states and 1416 transitions. Second operand 9 states. [2019-09-10 08:34:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:35,541 INFO L93 Difference]: Finished difference Result 1734 states and 2250 transitions. [2019-09-10 08:34:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:35,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:35,544 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:35,544 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:35,544 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:34:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1415 transitions. [2019-09-10 08:34:35,555 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1415 transitions. Word has length 120 [2019-09-10 08:34:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:35,555 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1415 transitions. [2019-09-10 08:34:35,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1415 transitions. [2019-09-10 08:34:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:35,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:35,557 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:35,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash 944288137, now seen corresponding path program 1 times [2019-09-10 08:34:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:35,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:35,706 INFO L134 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:34:35,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:35,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:35,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:35,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:35,707 INFO L87 Difference]: Start difference. First operand 1088 states and 1415 transitions. Second operand 9 states. [2019-09-10 08:34:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:39,343 INFO L93 Difference]: Finished difference Result 1734 states and 2248 transitions. [2019-09-10 08:34:39,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:39,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:39,346 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:39,346 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:39,347 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:34:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1414 transitions. [2019-09-10 08:34:39,357 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1414 transitions. Word has length 120 [2019-09-10 08:34:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:39,358 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1414 transitions. [2019-09-10 08:34:39,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1414 transitions. [2019-09-10 08:34:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:39,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:39,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:39,359 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash -349907354, now seen corresponding path program 1 times [2019-09-10 08:34:39,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:39,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:39,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:39,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:34:39,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:39,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:39,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:39,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:39,550 INFO L87 Difference]: Start difference. First operand 1088 states and 1414 transitions. Second operand 9 states. [2019-09-10 08:34:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:43,149 INFO L93 Difference]: Finished difference Result 1734 states and 2247 transitions. [2019-09-10 08:34:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:43,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:43,152 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:43,153 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:43,153 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:34:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1413 transitions. [2019-09-10 08:34:43,164 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1413 transitions. Word has length 120 [2019-09-10 08:34:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:43,164 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1413 transitions. [2019-09-10 08:34:43,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1413 transitions. [2019-09-10 08:34:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:43,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:43,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:43,166 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -3622801, now seen corresponding path program 1 times [2019-09-10 08:34:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:43,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:43,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:43,363 INFO L134 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:34:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:43,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:43,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:43,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:43,364 INFO L87 Difference]: Start difference. First operand 1088 states and 1413 transitions. Second operand 9 states. [2019-09-10 08:34:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:47,346 INFO L93 Difference]: Finished difference Result 1790 states and 2342 transitions. [2019-09-10 08:34:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:47,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:47,349 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:34:47,349 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:34:47,350 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:34:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:34:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:34:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1412 transitions. [2019-09-10 08:34:47,359 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1412 transitions. Word has length 120 [2019-09-10 08:34:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:47,359 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1412 transitions. [2019-09-10 08:34:47,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1412 transitions. [2019-09-10 08:34:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:47,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:47,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:47,361 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash 381425360, now seen corresponding path program 1 times [2019-09-10 08:34:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:47,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:47,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:47,506 INFO L134 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:34:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:47,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:47,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:47,508 INFO L87 Difference]: Start difference. First operand 1088 states and 1412 transitions. Second operand 9 states. [2019-09-10 08:34:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:51,099 INFO L93 Difference]: Finished difference Result 1734 states and 2245 transitions. [2019-09-10 08:34:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:51,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:51,102 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:51,102 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:51,102 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:34:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1411 transitions. [2019-09-10 08:34:51,113 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1411 transitions. Word has length 120 [2019-09-10 08:34:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:51,113 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1411 transitions. [2019-09-10 08:34:51,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1411 transitions. [2019-09-10 08:34:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:51,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:51,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:51,115 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 663554906, now seen corresponding path program 1 times [2019-09-10 08:34:51,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:51,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:51,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:51,326 INFO L134 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:34:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:51,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:51,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:51,327 INFO L87 Difference]: Start difference. First operand 1088 states and 1411 transitions. Second operand 9 states. [2019-09-10 08:34:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:55,191 INFO L93 Difference]: Finished difference Result 1790 states and 2339 transitions. [2019-09-10 08:34:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:55,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:55,195 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:34:55,195 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:34:55,195 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:34:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:34:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:34:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1410 transitions. [2019-09-10 08:34:55,204 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1410 transitions. Word has length 120 [2019-09-10 08:34:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:55,204 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1410 transitions. [2019-09-10 08:34:55,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1410 transitions. [2019-09-10 08:34:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:55,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:55,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:55,206 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1468937476, now seen corresponding path program 1 times [2019-09-10 08:34:55,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:55,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:55,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:55,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:55,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:55,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:34:55,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:55,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:55,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:55,358 INFO L87 Difference]: Start difference. First operand 1088 states and 1410 transitions. Second operand 9 states. [2019-09-10 08:34:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:58,723 INFO L93 Difference]: Finished difference Result 1734 states and 2243 transitions. [2019-09-10 08:34:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:58,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:58,726 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:34:58,727 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:34:58,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:34:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:34:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:34:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:34:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1409 transitions. [2019-09-10 08:34:58,736 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1409 transitions. Word has length 120 [2019-09-10 08:34:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:58,736 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1409 transitions. [2019-09-10 08:34:58,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1409 transitions. [2019-09-10 08:34:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:58,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:58,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:58,738 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1182548337, now seen corresponding path program 1 times [2019-09-10 08:34:58,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:58,888 INFO L134 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:34:58,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:58,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:58,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:58,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:58,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:58,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:58,889 INFO L87 Difference]: Start difference. First operand 1088 states and 1409 transitions. Second operand 9 states. [2019-09-10 08:35:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:02,905 INFO L93 Difference]: Finished difference Result 1790 states and 2336 transitions. [2019-09-10 08:35:02,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:02,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:02,907 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:02,908 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:02,908 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:35:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1408 transitions. [2019-09-10 08:35:02,917 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1408 transitions. Word has length 120 [2019-09-10 08:35:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:02,917 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1408 transitions. [2019-09-10 08:35:02,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1408 transitions. [2019-09-10 08:35:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:02,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:02,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:02,919 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 215975840, now seen corresponding path program 1 times [2019-09-10 08:35:02,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:02,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:02,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:03,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:03,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:03,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:03,062 INFO L87 Difference]: Start difference. First operand 1088 states and 1408 transitions. Second operand 9 states. [2019-09-10 08:35:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:06,764 INFO L93 Difference]: Finished difference Result 1734 states and 2241 transitions. [2019-09-10 08:35:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:06,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:06,768 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:06,768 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:06,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:35:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1407 transitions. [2019-09-10 08:35:06,783 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1407 transitions. Word has length 120 [2019-09-10 08:35:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:06,783 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1407 transitions. [2019-09-10 08:35:06,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1407 transitions. [2019-09-10 08:35:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:06,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:06,786 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2081025797, now seen corresponding path program 1 times [2019-09-10 08:35:06,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:06,941 INFO L134 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:35:06,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:06,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:06,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:06,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:06,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:06,942 INFO L87 Difference]: Start difference. First operand 1088 states and 1407 transitions. Second operand 9 states. [2019-09-10 08:35:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:10,892 INFO L93 Difference]: Finished difference Result 1790 states and 2334 transitions. [2019-09-10 08:35:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:10,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:10,895 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:10,895 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:10,895 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:35:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1406 transitions. [2019-09-10 08:35:10,903 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1406 transitions. Word has length 120 [2019-09-10 08:35:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:10,903 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1406 transitions. [2019-09-10 08:35:10,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1406 transitions. [2019-09-10 08:35:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:10,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:10,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:10,905 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1734271359, now seen corresponding path program 1 times [2019-09-10 08:35:10,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:10,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:11,065 INFO L134 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:35:11,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:11,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:11,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:11,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:11,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:11,066 INFO L87 Difference]: Start difference. First operand 1088 states and 1406 transitions. Second operand 9 states. [2019-09-10 08:35:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:14,836 INFO L93 Difference]: Finished difference Result 1734 states and 2238 transitions. [2019-09-10 08:35:14,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:14,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:14,839 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:14,839 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:14,839 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:35:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1405 transitions. [2019-09-10 08:35:14,848 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1405 transitions. Word has length 120 [2019-09-10 08:35:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:14,849 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1405 transitions. [2019-09-10 08:35:14,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1405 transitions. [2019-09-10 08:35:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:14,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:14,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:14,850 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1289176642, now seen corresponding path program 1 times [2019-09-10 08:35:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:14,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:14,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:15,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:35:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:15,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:15,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:15,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:15,014 INFO L87 Difference]: Start difference. First operand 1088 states and 1405 transitions. Second operand 9 states. [2019-09-10 08:35:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:18,686 INFO L93 Difference]: Finished difference Result 1734 states and 2237 transitions. [2019-09-10 08:35:18,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:18,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:18,690 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:18,690 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:18,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:35:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1404 transitions. [2019-09-10 08:35:18,699 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1404 transitions. Word has length 120 [2019-09-10 08:35:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:18,699 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1404 transitions. [2019-09-10 08:35:18,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1404 transitions. [2019-09-10 08:35:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:18,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:18,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:18,701 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash 708898247, now seen corresponding path program 1 times [2019-09-10 08:35:18,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:18,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:18,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:18,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:35:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:18,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:18,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:18,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:18,856 INFO L87 Difference]: Start difference. First operand 1088 states and 1404 transitions. Second operand 9 states. [2019-09-10 08:35:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:22,860 INFO L93 Difference]: Finished difference Result 1790 states and 2329 transitions. [2019-09-10 08:35:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:22,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:22,863 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:22,863 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:22,864 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:35:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1403 transitions. [2019-09-10 08:35:22,874 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1403 transitions. Word has length 120 [2019-09-10 08:35:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:22,874 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1403 transitions. [2019-09-10 08:35:22,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1403 transitions. [2019-09-10 08:35:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:22,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:22,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:22,876 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1239740929, now seen corresponding path program 1 times [2019-09-10 08:35:22,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:22,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:22,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:22,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:22,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:23,019 INFO L134 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:35:23,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:23,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:23,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:23,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:23,020 INFO L87 Difference]: Start difference. First operand 1088 states and 1403 transitions. Second operand 9 states. [2019-09-10 08:35:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:26,780 INFO L93 Difference]: Finished difference Result 1790 states and 2328 transitions. [2019-09-10 08:35:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:26,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:26,783 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:26,783 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:26,783 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:35:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1402 transitions. [2019-09-10 08:35:26,793 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1402 transitions. Word has length 120 [2019-09-10 08:35:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:26,793 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1402 transitions. [2019-09-10 08:35:26,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1402 transitions. [2019-09-10 08:35:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:26,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:26,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:26,795 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:26,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash 822642674, now seen corresponding path program 1 times [2019-09-10 08:35:26,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:26,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:26,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:26,934 INFO L134 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:35:26,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:26,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:26,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:26,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:26,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:26,936 INFO L87 Difference]: Start difference. First operand 1088 states and 1402 transitions. Second operand 9 states. [2019-09-10 08:35:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:30,902 INFO L93 Difference]: Finished difference Result 1790 states and 2326 transitions. [2019-09-10 08:35:30,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:30,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:30,905 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:30,905 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:30,905 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:35:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1401 transitions. [2019-09-10 08:35:30,915 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1401 transitions. Word has length 120 [2019-09-10 08:35:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:30,916 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1401 transitions. [2019-09-10 08:35:30,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1401 transitions. [2019-09-10 08:35:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:30,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:30,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:30,917 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -597710621, now seen corresponding path program 1 times [2019-09-10 08:35:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:30,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:31,069 INFO L134 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:35:31,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:31,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:31,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:31,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:31,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:31,070 INFO L87 Difference]: Start difference. First operand 1088 states and 1401 transitions. Second operand 9 states. [2019-09-10 08:35:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:34,615 INFO L93 Difference]: Finished difference Result 1734 states and 2232 transitions. [2019-09-10 08:35:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:34,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:34,618 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:34,618 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:34,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:35:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1400 transitions. [2019-09-10 08:35:34,631 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1400 transitions. Word has length 120 [2019-09-10 08:35:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:34,631 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1400 transitions. [2019-09-10 08:35:34,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1400 transitions. [2019-09-10 08:35:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:34,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:34,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:34,633 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash -152615904, now seen corresponding path program 1 times [2019-09-10 08:35:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:34,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:34,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:34,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:34,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:34,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:34,795 INFO L87 Difference]: Start difference. First operand 1088 states and 1400 transitions. Second operand 9 states. [2019-09-10 08:35:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:38,198 INFO L93 Difference]: Finished difference Result 1734 states and 2231 transitions. [2019-09-10 08:35:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:38,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:38,201 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:38,201 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:38,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:35:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1399 transitions. [2019-09-10 08:35:38,247 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1399 transitions. Word has length 120 [2019-09-10 08:35:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:38,247 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1399 transitions. [2019-09-10 08:35:38,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1399 transitions. [2019-09-10 08:35:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:38,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:38,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:38,249 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1845663543, now seen corresponding path program 1 times [2019-09-10 08:35:38,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:38,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:38,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:38,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:38,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:38,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:38,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:38,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:38,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:38,399 INFO L87 Difference]: Start difference. First operand 1088 states and 1399 transitions. Second operand 9 states. [2019-09-10 08:35:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:42,365 INFO L93 Difference]: Finished difference Result 1790 states and 2321 transitions. [2019-09-10 08:35:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:42,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:42,368 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:42,368 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:42,369 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:35:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1398 transitions. [2019-09-10 08:35:42,379 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1398 transitions. Word has length 120 [2019-09-10 08:35:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:42,379 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1398 transitions. [2019-09-10 08:35:42,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1398 transitions. [2019-09-10 08:35:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:42,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:42,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:42,381 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1134633556, now seen corresponding path program 1 times [2019-09-10 08:35:42,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:42,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:42,531 INFO L134 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:35:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:42,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:42,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:42,532 INFO L87 Difference]: Start difference. First operand 1088 states and 1398 transitions. Second operand 9 states. [2019-09-10 08:35:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:46,050 INFO L93 Difference]: Finished difference Result 1734 states and 2228 transitions. [2019-09-10 08:35:46,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:46,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:46,053 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:46,054 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:46,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:35:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1397 transitions. [2019-09-10 08:35:46,062 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1397 transitions. Word has length 120 [2019-09-10 08:35:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:46,062 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1397 transitions. [2019-09-10 08:35:46,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1397 transitions. [2019-09-10 08:35:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:46,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:46,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:46,064 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1989155418, now seen corresponding path program 1 times [2019-09-10 08:35:46,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:46,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:46,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:46,209 INFO L134 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:35:46,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:46,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:46,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:46,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:46,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:46,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:46,210 INFO L87 Difference]: Start difference. First operand 1088 states and 1397 transitions. Second operand 9 states. [2019-09-10 08:35:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:49,608 INFO L93 Difference]: Finished difference Result 1734 states and 2227 transitions. [2019-09-10 08:35:49,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:49,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:49,611 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:49,611 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:49,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:35:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1396 transitions. [2019-09-10 08:35:49,621 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1396 transitions. Word has length 120 [2019-09-10 08:35:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:49,621 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1396 transitions. [2019-09-10 08:35:49,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1396 transitions. [2019-09-10 08:35:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:49,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:49,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:49,623 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 136702110, now seen corresponding path program 1 times [2019-09-10 08:35:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:49,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:49,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:49,779 INFO L134 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:35:49,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:49,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:49,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:49,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:49,780 INFO L87 Difference]: Start difference. First operand 1088 states and 1396 transitions. Second operand 9 states. [2019-09-10 08:35:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:53,644 INFO L93 Difference]: Finished difference Result 1790 states and 2317 transitions. [2019-09-10 08:35:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:53,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:53,647 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:35:53,647 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:35:53,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:35:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:35:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-10 08:35:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1395 transitions. [2019-09-10 08:35:53,657 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1395 transitions. Word has length 120 [2019-09-10 08:35:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:53,657 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1395 transitions. [2019-09-10 08:35:53,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1395 transitions. [2019-09-10 08:35:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:53,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:53,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:53,658 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash 942084680, now seen corresponding path program 1 times [2019-09-10 08:35:53,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:53,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:53,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:53,806 INFO L134 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:35:53,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:53,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:53,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:53,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:53,807 INFO L87 Difference]: Start difference. First operand 1088 states and 1395 transitions. Second operand 9 states. [2019-09-10 08:35:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:57,343 INFO L93 Difference]: Finished difference Result 1734 states and 2225 transitions. [2019-09-10 08:35:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:57,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:35:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:57,346 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:35:57,346 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:35:57,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:35:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:35:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:35:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:35:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1394 transitions. [2019-09-10 08:35:57,355 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1394 transitions. Word has length 120 [2019-09-10 08:35:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:57,356 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1394 transitions. [2019-09-10 08:35:57,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1394 transitions. [2019-09-10 08:35:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:35:57,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:57,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:57,357 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1177456136, now seen corresponding path program 1 times [2019-09-10 08:35:57,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:57,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:57,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:57,496 INFO L134 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:35:57,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:57,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:57,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:57,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:57,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:57,497 INFO L87 Difference]: Start difference. First operand 1088 states and 1394 transitions. Second operand 9 states. [2019-09-10 08:36:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:01,226 INFO L93 Difference]: Finished difference Result 1734 states and 2223 transitions. [2019-09-10 08:36:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:01,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:36:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:01,229 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:01,229 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:01,230 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:36:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1393 transitions. [2019-09-10 08:36:01,240 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1393 transitions. Word has length 120 [2019-09-10 08:36:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:01,240 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1393 transitions. [2019-09-10 08:36:01,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1393 transitions. [2019-09-10 08:36:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:36:01,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:01,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,242 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1777985122, now seen corresponding path program 1 times [2019-09-10 08:36:01,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:01,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:01,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:01,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:01,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:01,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:01,386 INFO L87 Difference]: Start difference. First operand 1088 states and 1393 transitions. Second operand 9 states. [2019-09-10 08:36:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:05,027 INFO L93 Difference]: Finished difference Result 1734 states and 2222 transitions. [2019-09-10 08:36:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:05,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:36:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:05,030 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:05,030 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:05,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:36:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1392 transitions. [2019-09-10 08:36:05,040 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1392 transitions. Word has length 120 [2019-09-10 08:36:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:05,041 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1392 transitions. [2019-09-10 08:36:05,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1392 transitions. [2019-09-10 08:36:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:36:05,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:05,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] [2019-09-10 08:36:05,042 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -743933870, now seen corresponding path program 1 times [2019-09-10 08:36:05,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:05,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:05,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:05,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:36:05,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:05,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:05,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:05,190 INFO L87 Difference]: Start difference. First operand 1088 states and 1392 transitions. Second operand 9 states. [2019-09-10 08:36:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:08,821 INFO L93 Difference]: Finished difference Result 1734 states and 2220 transitions. [2019-09-10 08:36:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:08,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:36:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:08,824 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:08,824 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:08,824 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:36:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1391 transitions. [2019-09-10 08:36:08,834 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1391 transitions. Word has length 120 [2019-09-10 08:36:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:08,834 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1391 transitions. [2019-09-10 08:36:08,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1391 transitions. [2019-09-10 08:36:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:36:08,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:08,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,835 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:08,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1350775706, now seen corresponding path program 1 times [2019-09-10 08:36:08,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:08,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:08,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:08,983 INFO L134 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:36:08,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:08,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:08,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:08,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:08,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:08,984 INFO L87 Difference]: Start difference. First operand 1088 states and 1391 transitions. Second operand 9 states. [2019-09-10 08:36:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:12,504 INFO L93 Difference]: Finished difference Result 1734 states and 2219 transitions. [2019-09-10 08:36:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:12,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:36:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:12,506 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:12,506 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:12,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:36:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1390 transitions. [2019-09-10 08:36:12,516 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1390 transitions. Word has length 120 [2019-09-10 08:36:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:12,516 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1390 transitions. [2019-09-10 08:36:12,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1390 transitions. [2019-09-10 08:36:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:12,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:12,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,517 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash 780681115, now seen corresponding path program 1 times [2019-09-10 08:36:12,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:12,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:12,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:12,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:12,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:12,692 INFO L134 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:36:12,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:12,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:12,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:12,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:12,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:12,693 INFO L87 Difference]: Start difference. First operand 1088 states and 1390 transitions. Second operand 9 states. [2019-09-10 08:36:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:16,203 INFO L93 Difference]: Finished difference Result 1734 states and 2218 transitions. [2019-09-10 08:36:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:16,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:36:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:16,206 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:16,206 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:16,206 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:36:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1389 transitions. [2019-09-10 08:36:16,216 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1389 transitions. Word has length 121 [2019-09-10 08:36:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:16,216 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1389 transitions. [2019-09-10 08:36:16,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1389 transitions. [2019-09-10 08:36:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:16,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:16,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,217 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1446425802, now seen corresponding path program 1 times [2019-09-10 08:36:16,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:16,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:16,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:16,410 INFO L134 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:36:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:16,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:16,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:16,412 INFO L87 Difference]: Start difference. First operand 1088 states and 1389 transitions. Second operand 9 states. [2019-09-10 08:36:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:19,939 INFO L93 Difference]: Finished difference Result 1734 states and 2217 transitions. [2019-09-10 08:36:19,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:19,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:36:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:19,942 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:19,942 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:19,942 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:36:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1388 transitions. [2019-09-10 08:36:19,952 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1388 transitions. Word has length 121 [2019-09-10 08:36:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:19,952 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1388 transitions. [2019-09-10 08:36:19,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1388 transitions. [2019-09-10 08:36:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:19,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:19,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,954 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1590323129, now seen corresponding path program 1 times [2019-09-10 08:36:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:19,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:20,101 INFO L134 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:36:20,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:20,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:20,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:20,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:20,102 INFO L87 Difference]: Start difference. First operand 1088 states and 1388 transitions. Second operand 9 states. [2019-09-10 08:36:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:23,446 INFO L93 Difference]: Finished difference Result 1734 states and 2216 transitions. [2019-09-10 08:36:23,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:23,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:36:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:23,449 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:23,449 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:23,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:36:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1387 transitions. [2019-09-10 08:36:23,458 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1387 transitions. Word has length 121 [2019-09-10 08:36:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:23,458 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1387 transitions. [2019-09-10 08:36:23,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1387 transitions. [2019-09-10 08:36:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:23,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:23,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:23,460 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash 855966831, now seen corresponding path program 1 times [2019-09-10 08:36:23,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:23,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:23,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:23,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:23,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:23,606 INFO L87 Difference]: Start difference. First operand 1088 states and 1387 transitions. Second operand 9 states. [2019-09-10 08:36:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:27,192 INFO L93 Difference]: Finished difference Result 1734 states and 2214 transitions. [2019-09-10 08:36:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:27,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:36:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:27,194 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:27,195 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:27,195 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:36:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1386 transitions. [2019-09-10 08:36:27,204 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1386 transitions. Word has length 121 [2019-09-10 08:36:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:27,204 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1386 transitions. [2019-09-10 08:36:27,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1386 transitions. [2019-09-10 08:36:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:27,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:27,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:27,206 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1512469138, now seen corresponding path program 1 times [2019-09-10 08:36:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:27,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:27,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:27,361 INFO L134 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:36:27,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:27,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:27,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:27,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:27,362 INFO L87 Difference]: Start difference. First operand 1088 states and 1386 transitions. Second operand 9 states. [2019-09-10 08:36:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:30,850 INFO L93 Difference]: Finished difference Result 1734 states and 2213 transitions. [2019-09-10 08:36:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:30,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:36:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:30,853 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:30,853 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:30,853 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:36:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1385 transitions. [2019-09-10 08:36:30,862 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1385 transitions. Word has length 121 [2019-09-10 08:36:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:30,863 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1385 transitions. [2019-09-10 08:36:30,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1385 transitions. [2019-09-10 08:36:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:30,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:30,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:30,864 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash 202339011, now seen corresponding path program 1 times [2019-09-10 08:36:30,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:30,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:30,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:31,014 INFO L134 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:36:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:31,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:31,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:31,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:31,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:31,015 INFO L87 Difference]: Start difference. First operand 1088 states and 1385 transitions. Second operand 9 states. [2019-09-10 08:36:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:34,574 INFO L93 Difference]: Finished difference Result 1734 states and 2212 transitions. [2019-09-10 08:36:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:34,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:36:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:34,577 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 08:36:34,577 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 08:36:34,577 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:36:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 08:36:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-10 08:36:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-10 08:36:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1384 transitions. [2019-09-10 08:36:34,587 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1384 transitions. Word has length 121 [2019-09-10 08:36:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:34,587 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1384 transitions. [2019-09-10 08:36:34,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1384 transitions. [2019-09-10 08:36:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:34,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:34,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:34,606 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:34,606 INFO L82 PathProgramCache]: Analyzing trace with hash -76336468, now seen corresponding path program 1 times [2019-09-10 08:36:34,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:34,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:36,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:36:36,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:36,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:36:36,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:36,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:36:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:36:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:36:36,096 INFO L87 Difference]: Start difference. First operand 1088 states and 1384 transitions. Second operand 21 states. [2019-09-10 08:36:37,169 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 08:36:37,446 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 08:36:37,629 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:36:37,862 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:36:38,058 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:36:48,911 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:36:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:49,846 INFO L93 Difference]: Finished difference Result 2369 states and 2956 transitions. [2019-09-10 08:36:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:36:49,847 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:36:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:49,850 INFO L225 Difference]: With dead ends: 2369 [2019-09-10 08:36:49,850 INFO L226 Difference]: Without dead ends: 2369 [2019-09-10 08:36:49,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:36:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-09-10 08:36:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1121. [2019-09-10 08:36:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-10 08:36:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1428 transitions. [2019-09-10 08:36:49,868 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1428 transitions. Word has length 122 [2019-09-10 08:36:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:49,868 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1428 transitions. [2019-09-10 08:36:49,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:36:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1428 transitions. [2019-09-10 08:36:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:49,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:49,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, 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:36:49,870 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1490416469, now seen corresponding path program 1 times [2019-09-10 08:36:49,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:49,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:49,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:51,215 INFO L134 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:36:51,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:51,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:36:51,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:51,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:36:51,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:36:51,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:36:51,217 INFO L87 Difference]: Start difference. First operand 1121 states and 1428 transitions. Second operand 22 states. [2019-09-10 08:36:52,329 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:36:52,603 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 08:36:52,997 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:36:53,148 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:36:53,506 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:36:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:58,586 INFO L93 Difference]: Finished difference Result 2165 states and 2776 transitions. [2019-09-10 08:36:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:36:58,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:36:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:58,589 INFO L225 Difference]: With dead ends: 2165 [2019-09-10 08:36:58,589 INFO L226 Difference]: Without dead ends: 2165 [2019-09-10 08:36:58,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:36:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2019-09-10 08:36:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1133. [2019-09-10 08:36:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-09-10 08:36:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1440 transitions. [2019-09-10 08:36:58,604 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1440 transitions. Word has length 122 [2019-09-10 08:36:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:58,604 INFO L475 AbstractCegarLoop]: Abstraction has 1133 states and 1440 transitions. [2019-09-10 08:36:58,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:36:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1440 transitions. [2019-09-10 08:36:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:58,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:58,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:58,606 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash 484088792, now seen corresponding path program 1 times [2019-09-10 08:36:58,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:58,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:58,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:58,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:59,249 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-09-10 08:36:59,421 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-09-10 08:36:59,620 INFO L134 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:36:59,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:59,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:36:59,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:59,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:36:59,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:36:59,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:36:59,622 INFO L87 Difference]: Start difference. First operand 1133 states and 1440 transitions. Second operand 17 states. [2019-09-10 08:37:00,313 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:37:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:05,037 INFO L93 Difference]: Finished difference Result 2034 states and 2611 transitions. [2019-09-10 08:37:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:37:05,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:37:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:05,041 INFO L225 Difference]: With dead ends: 2034 [2019-09-10 08:37:05,041 INFO L226 Difference]: Without dead ends: 2034 [2019-09-10 08:37:05,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:37:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-09-10 08:37:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1127. [2019-09-10 08:37:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-09-10 08:37:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1429 transitions. [2019-09-10 08:37:05,053 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1429 transitions. Word has length 122 [2019-09-10 08:37:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:05,053 INFO L475 AbstractCegarLoop]: Abstraction has 1127 states and 1429 transitions. [2019-09-10 08:37:05,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:37:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1429 transitions. [2019-09-10 08:37:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:05,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:05,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:05,055 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:05,055 INFO L82 PathProgramCache]: Analyzing trace with hash -982869291, now seen corresponding path program 1 times [2019-09-10 08:37:05,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:05,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:05,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:06,455 INFO L134 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:37:06,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:06,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:37:06,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:06,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:37:06,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:37:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:37:06,456 INFO L87 Difference]: Start difference. First operand 1127 states and 1429 transitions. Second operand 22 states. [2019-09-10 08:37:07,547 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 08:37:07,836 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:37:08,176 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 08:37:08,355 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:37:08,777 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:37:09,195 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:37:09,858 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:37:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:16,741 INFO L93 Difference]: Finished difference Result 2060 states and 2635 transitions. [2019-09-10 08:37:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:37:16,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:37:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:16,743 INFO L225 Difference]: With dead ends: 2060 [2019-09-10 08:37:16,744 INFO L226 Difference]: Without dead ends: 2060 [2019-09-10 08:37:16,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:37:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2019-09-10 08:37:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1133. [2019-09-10 08:37:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-09-10 08:37:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1435 transitions. [2019-09-10 08:37:16,757 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1435 transitions. Word has length 122 [2019-09-10 08:37:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:16,757 INFO L475 AbstractCegarLoop]: Abstraction has 1133 states and 1435 transitions. [2019-09-10 08:37:16,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:37:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1435 transitions. [2019-09-10 08:37:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:16,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:16,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:16,758 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1606641247, now seen corresponding path program 1 times [2019-09-10 08:37:16,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:16,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:16,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:37:17,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:17,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:37:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:37:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:37:17,607 INFO L87 Difference]: Start difference. First operand 1133 states and 1435 transitions. Second operand 17 states. [2019-09-10 08:37:18,187 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:37:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:21,315 INFO L93 Difference]: Finished difference Result 2027 states and 2604 transitions. [2019-09-10 08:37:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:37:21,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:37:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:21,318 INFO L225 Difference]: With dead ends: 2027 [2019-09-10 08:37:21,318 INFO L226 Difference]: Without dead ends: 2027 [2019-09-10 08:37:21,319 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:37:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-10 08:37:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1109. [2019-09-10 08:37:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-09-10 08:37:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1403 transitions. [2019-09-10 08:37:21,332 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1403 transitions. Word has length 122 [2019-09-10 08:37:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:21,333 INFO L475 AbstractCegarLoop]: Abstraction has 1109 states and 1403 transitions. [2019-09-10 08:37:21,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:37:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1403 transitions. [2019-09-10 08:37:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:21,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:21,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,335 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash -185074006, now seen corresponding path program 1 times [2019-09-10 08:37:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:21,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:22,347 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 08:37:22,493 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:37:22,641 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:37:22,821 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:37:23,009 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:37:23,199 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 08:37:23,397 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 08:37:23,585 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 08:37:23,770 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:37:25,766 INFO L134 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:37:25,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:25,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:37:25,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:25,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:37:25,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:37:25,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:37:25,767 INFO L87 Difference]: Start difference. First operand 1109 states and 1403 transitions. Second operand 36 states. [2019-09-10 08:37:26,083 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2019-09-10 08:37:27,331 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 32 [2019-09-10 08:37:27,583 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2019-09-10 08:37:27,839 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-09-10 08:37:28,094 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2019-09-10 08:37:28,959 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-09-10 08:37:29,414 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 77 [2019-09-10 08:37:29,944 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 97 [2019-09-10 08:37:30,583 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 114 [2019-09-10 08:37:31,367 WARN L188 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 131 [2019-09-10 08:37:32,327 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 151 [2019-09-10 08:37:32,810 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 92 [2019-09-10 08:37:33,260 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 92 [2019-09-10 08:37:33,535 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:37:34,048 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:38:12,341 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 64 [2019-09-10 08:38:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:15,682 INFO L93 Difference]: Finished difference Result 2551 states and 3213 transitions. [2019-09-10 08:38:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:38:15,682 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-10 08:38:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:15,684 INFO L225 Difference]: With dead ends: 2551 [2019-09-10 08:38:15,685 INFO L226 Difference]: Without dead ends: 2551 [2019-09-10 08:38:15,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=589, Invalid=3317, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:38:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-09-10 08:38:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1129. [2019-09-10 08:38:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-09-10 08:38:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1430 transitions. [2019-09-10 08:38:15,700 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1430 transitions. Word has length 122 [2019-09-10 08:38:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:15,700 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1430 transitions. [2019-09-10 08:38:15,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:38:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1430 transitions. [2019-09-10 08:38:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:38:15,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:15,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,702 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1305180917, now seen corresponding path program 1 times [2019-09-10 08:38:15,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:15,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:15,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:15,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:15,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:16,318 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 08:38:17,169 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:38:17,330 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:38:20,636 WARN L188 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:38:20,817 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:38:22,253 INFO L134 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:38:22,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:22,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:38:22,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:22,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:38:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:38:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:38:22,254 INFO L87 Difference]: Start difference. First operand 1129 states and 1430 transitions. Second operand 36 states. [2019-09-10 08:38:22,494 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 08:38:23,543 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 08:38:23,712 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:38:23,909 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 08:38:24,114 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 08:38:24,727 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:38:25,123 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:38:25,604 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 115 [2019-09-10 08:38:26,266 WARN L188 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2019-09-10 08:38:27,376 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 180 DAG size of output: 159 [2019-09-10 08:39:09,110 WARN L188 SmtUtils]: Spent 41.64 s on a formula simplification. DAG size of input: 210 DAG size of output: 187 [2019-09-10 08:39:09,474 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:39:09,802 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:39:10,215 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:39:36,598 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 08:39:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:57,986 INFO L93 Difference]: Finished difference Result 3976 states and 5007 transitions. [2019-09-10 08:39:57,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 08:39:57,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-10 08:39:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:57,990 INFO L225 Difference]: With dead ends: 3976 [2019-09-10 08:39:57,990 INFO L226 Difference]: Without dead ends: 3976 [2019-09-10 08:39:57,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=773, Invalid=4197, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:39:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2019-09-10 08:39:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 1138. [2019-09-10 08:39:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-10 08:39:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1442 transitions. [2019-09-10 08:39:58,010 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1442 transitions. Word has length 122 [2019-09-10 08:39:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:58,010 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1442 transitions. [2019-09-10 08:39:58,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:39:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1442 transitions. [2019-09-10 08:39:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:39:58,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:58,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,012 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash -261572020, now seen corresponding path program 1 times [2019-09-10 08:39:58,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:58,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:58,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:58,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:58,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:58,647 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 08:39:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:58,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:58,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:39:58,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:58,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:39:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:39:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:39:58,975 INFO L87 Difference]: Start difference. First operand 1138 states and 1442 transitions. Second operand 17 states. [2019-09-10 08:39:59,705 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:40:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:05,224 INFO L93 Difference]: Finished difference Result 1974 states and 2533 transitions. [2019-09-10 08:40:05,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:40:05,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:40:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:05,227 INFO L225 Difference]: With dead ends: 1974 [2019-09-10 08:40:05,227 INFO L226 Difference]: Without dead ends: 1974 [2019-09-10 08:40:05,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:40:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-10 08:40:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1118. [2019-09-10 08:40:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-09-10 08:40:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1415 transitions. [2019-09-10 08:40:05,238 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1415 transitions. Word has length 122 [2019-09-10 08:40:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:05,238 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1415 transitions. [2019-09-10 08:40:05,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:40:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1415 transitions. [2019-09-10 08:40:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:40:05,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:05,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:05,240 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash -364307142, now seen corresponding path program 1 times [2019-09-10 08:40:05,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:05,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:05,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:05,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:05,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:06,386 INFO L134 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:40:06,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:06,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:40:06,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:06,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:40:06,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:40:06,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:40:06,388 INFO L87 Difference]: Start difference. First operand 1118 states and 1415 transitions. Second operand 17 states. [2019-09-10 08:40:07,039 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:40:07,183 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:40:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:09,369 INFO L93 Difference]: Finished difference Result 2020 states and 2589 transitions. [2019-09-10 08:40:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:40:09,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:40:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:09,372 INFO L225 Difference]: With dead ends: 2020 [2019-09-10 08:40:09,372 INFO L226 Difference]: Without dead ends: 2020 [2019-09-10 08:40:09,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:40:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-10 08:40:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1076. [2019-09-10 08:40:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-09-10 08:40:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1356 transitions. [2019-09-10 08:40:09,382 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1356 transitions. Word has length 122 [2019-09-10 08:40:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:09,382 INFO L475 AbstractCegarLoop]: Abstraction has 1076 states and 1356 transitions. [2019-09-10 08:40:09,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:40:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1356 transitions. [2019-09-10 08:40:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:40:09,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:09,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:09,384 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199447, now seen corresponding path program 1 times [2019-09-10 08:40:09,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:09,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:09,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:09,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:09,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:10,318 INFO L134 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:40:10,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:10,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:40:10,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:10,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:40:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:40:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:40:10,319 INFO L87 Difference]: Start difference. First operand 1076 states and 1356 transitions. Second operand 17 states. [2019-09-10 08:40:10,954 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:40:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:13,481 INFO L93 Difference]: Finished difference Result 1874 states and 2399 transitions. [2019-09-10 08:40:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:40:13,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:40:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:13,483 INFO L225 Difference]: With dead ends: 1874 [2019-09-10 08:40:13,483 INFO L226 Difference]: Without dead ends: 1874 [2019-09-10 08:40:13,484 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:40:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2019-09-10 08:40:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1021. [2019-09-10 08:40:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-09-10 08:40:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1286 transitions. [2019-09-10 08:40:13,498 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1286 transitions. Word has length 122 [2019-09-10 08:40:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:13,498 INFO L475 AbstractCegarLoop]: Abstraction has 1021 states and 1286 transitions. [2019-09-10 08:40:13,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:40:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1286 transitions. [2019-09-10 08:40:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:40:13,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:13,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,502 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:13,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1521800364, now seen corresponding path program 1 times [2019-09-10 08:40:13,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:13,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:14,656 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 08:40:14,816 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:40:14,984 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 08:40:15,148 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:40:15,315 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 08:40:15,488 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:40:15,655 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 08:40:16,937 INFO L134 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:40:16,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:16,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-10 08:40:16,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:16,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 08:40:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 08:40:16,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:40:16,938 INFO L87 Difference]: Start difference. First operand 1021 states and 1286 transitions. Second operand 35 states. [2019-09-10 08:40:17,174 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:40:18,272 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 08:40:18,436 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:40:18,615 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:40:18,824 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:40:19,170 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:40:19,792 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2019-09-10 08:40:20,169 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2019-09-10 08:40:20,609 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-09-10 08:40:21,099 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2019-09-10 08:40:21,692 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 110 [2019-09-10 08:40:22,005 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-09-10 08:40:22,302 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-10 08:40:22,622 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 08:40:22,872 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 08:40:23,190 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 08:40:23,652 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 08:40:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:45,884 INFO L93 Difference]: Finished difference Result 1983 states and 2526 transitions. [2019-09-10 08:40:45,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:40:45,884 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 122 [2019-09-10 08:40:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:45,886 INFO L225 Difference]: With dead ends: 1983 [2019-09-10 08:40:45,886 INFO L226 Difference]: Without dead ends: 1983 [2019-09-10 08:40:45,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=707, Invalid=2715, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:40:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-09-10 08:40:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1042. [2019-09-10 08:40:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-09-10 08:40:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1310 transitions. [2019-09-10 08:40:45,895 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1310 transitions. Word has length 122 [2019-09-10 08:40:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:45,896 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1310 transitions. [2019-09-10 08:40:45,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 08:40:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1310 transitions. [2019-09-10 08:40:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:40:45,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:45,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,898 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -784730414, now seen corresponding path program 1 times [2019-09-10 08:40:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:45,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:45,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:45,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:46,618 INFO L134 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:40:46,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:46,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:40:46,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:46,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:40:46,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:40:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:40:46,620 INFO L87 Difference]: Start difference. First operand 1042 states and 1310 transitions. Second operand 17 states. [2019-09-10 08:40:47,387 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:40:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:53,246 INFO L93 Difference]: Finished difference Result 1781 states and 2268 transitions. [2019-09-10 08:40:53,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:40:53,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:40:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:53,250 INFO L225 Difference]: With dead ends: 1781 [2019-09-10 08:40:53,250 INFO L226 Difference]: Without dead ends: 1781 [2019-09-10 08:40:53,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:40:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2019-09-10 08:40:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1042. [2019-09-10 08:40:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-09-10 08:40:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1308 transitions. [2019-09-10 08:40:53,263 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1308 transitions. Word has length 122 [2019-09-10 08:40:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:53,264 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1308 transitions. [2019-09-10 08:40:53,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:40:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1308 transitions. [2019-09-10 08:40:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:40:53,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:53,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:53,266 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash -442149559, now seen corresponding path program 1 times [2019-09-10 08:40:53,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:53,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:54,738 INFO L134 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:40:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:54,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:40:54,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:54,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:40:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:40:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:40:54,740 INFO L87 Difference]: Start difference. First operand 1042 states and 1308 transitions. Second operand 22 states. [2019-09-10 08:40:55,863 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:40:56,106 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 08:40:56,410 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 08:40:56,591 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:40:57,626 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 08:40:58,455 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-10 08:40:58,847 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 08:41:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:09,541 INFO L93 Difference]: Finished difference Result 2221 states and 2814 transitions. [2019-09-10 08:41:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:41:09,541 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:41:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:09,544 INFO L225 Difference]: With dead ends: 2221 [2019-09-10 08:41:09,544 INFO L226 Difference]: Without dead ends: 2221 [2019-09-10 08:41:09,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:41:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-09-10 08:41:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1048. [2019-09-10 08:41:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-10 08:41:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1314 transitions. [2019-09-10 08:41:09,555 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1314 transitions. Word has length 122 [2019-09-10 08:41:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:09,556 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1314 transitions. [2019-09-10 08:41:09,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:41:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1314 transitions. [2019-09-10 08:41:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:41:09,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:09,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, 1, 1, 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:41:09,557 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2080949619, now seen corresponding path program 1 times [2019-09-10 08:41:09,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:09,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:10,632 INFO L134 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:41:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:41:10,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:10,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:41:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:41:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:41:10,634 INFO L87 Difference]: Start difference. First operand 1048 states and 1314 transitions. Second operand 20 states. [2019-09-10 08:41:11,536 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:41:11,777 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-10 08:41:11,934 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:41:12,096 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:41:12,251 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 08:41:12,506 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:41:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:17,625 INFO L93 Difference]: Finished difference Result 1790 states and 2234 transitions. [2019-09-10 08:41:17,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:41:17,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 122 [2019-09-10 08:41:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:17,628 INFO L225 Difference]: With dead ends: 1790 [2019-09-10 08:41:17,628 INFO L226 Difference]: Without dead ends: 1790 [2019-09-10 08:41:17,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:41:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-10 08:41:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1033. [2019-09-10 08:41:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2019-09-10 08:41:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1296 transitions. [2019-09-10 08:41:17,638 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1296 transitions. Word has length 122 [2019-09-10 08:41:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:17,640 INFO L475 AbstractCegarLoop]: Abstraction has 1033 states and 1296 transitions. [2019-09-10 08:41:17,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:41:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1296 transitions. [2019-09-10 08:41:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:41:17,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:17,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, 1, 1, 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:41:17,641 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash -918579394, now seen corresponding path program 1 times [2019-09-10 08:41:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:17,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:17,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:17,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:17,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:18,580 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:41:18,724 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:41:19,273 INFO L134 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:41:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:41:19,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:19,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:41:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:41:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:41:19,275 INFO L87 Difference]: Start difference. First operand 1033 states and 1296 transitions. Second operand 22 states. [2019-09-10 08:41:20,545 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 08:41:20,851 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 08:41:21,150 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 08:41:21,326 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:41:21,516 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:41:21,691 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:41:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:24,996 INFO L93 Difference]: Finished difference Result 1757 states and 2216 transitions. [2019-09-10 08:41:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:41:24,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:41:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:24,998 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:41:24,998 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:41:24,999 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:41:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:41:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1039. [2019-09-10 08:41:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-09-10 08:41:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1302 transitions. [2019-09-10 08:41:25,008 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1302 transitions. Word has length 122 [2019-09-10 08:41:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:25,008 INFO L475 AbstractCegarLoop]: Abstraction has 1039 states and 1302 transitions. [2019-09-10 08:41:25,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:41:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1302 transitions. [2019-09-10 08:41:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:41:25,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:25,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,010 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1567040497, now seen corresponding path program 1 times [2019-09-10 08:41:25,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:25,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:26,267 INFO L134 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:41:26,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:26,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:41:26,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:26,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:41:26,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:41:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:41:26,268 INFO L87 Difference]: Start difference. First operand 1039 states and 1302 transitions. Second operand 22 states. [2019-09-10 08:41:27,424 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:41:27,662 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:41:28,022 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:41:28,189 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:41:28,476 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:41:28,876 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:41:29,476 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:41:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:40,162 INFO L93 Difference]: Finished difference Result 2211 states and 2801 transitions. [2019-09-10 08:41:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:41:40,163 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:41:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:40,166 INFO L225 Difference]: With dead ends: 2211 [2019-09-10 08:41:40,166 INFO L226 Difference]: Without dead ends: 2211 [2019-09-10 08:41:40,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:41:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-10 08:41:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 1045. [2019-09-10 08:41:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2019-09-10 08:41:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1308 transitions. [2019-09-10 08:41:40,177 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1308 transitions. Word has length 122 [2019-09-10 08:41:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:40,177 INFO L475 AbstractCegarLoop]: Abstraction has 1045 states and 1308 transitions. [2019-09-10 08:41:40,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:41:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1308 transitions. [2019-09-10 08:41:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:41:40,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:40,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:40,178 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:40,179 INFO L82 PathProgramCache]: Analyzing trace with hash 399995554, now seen corresponding path program 1 times [2019-09-10 08:41:40,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:40,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:40,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:40,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:40,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:40,344 INFO L134 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:41:40,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:40,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:40,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:40,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:40,345 INFO L87 Difference]: Start difference. First operand 1045 states and 1308 transitions. Second operand 9 states. [2019-09-10 08:41:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:43,502 INFO L93 Difference]: Finished difference Result 1590 states and 2010 transitions. [2019-09-10 08:41:43,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:43,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:41:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:43,505 INFO L225 Difference]: With dead ends: 1590 [2019-09-10 08:41:43,505 INFO L226 Difference]: Without dead ends: 1590 [2019-09-10 08:41:43,505 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:41:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-09-10 08:41:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1048. [2019-09-10 08:41:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-10 08:41:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1312 transitions. [2019-09-10 08:41:43,517 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1312 transitions. Word has length 122 [2019-09-10 08:41:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:43,517 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1312 transitions. [2019-09-10 08:41:43,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1312 transitions. [2019-09-10 08:41:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:41:43,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:43,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:43,519 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1752473276, now seen corresponding path program 1 times [2019-09-10 08:41:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:43,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:43,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:41:43,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:43,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:43,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:43,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:43,664 INFO L87 Difference]: Start difference. First operand 1048 states and 1312 transitions. Second operand 9 states. [2019-09-10 08:41:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:47,045 INFO L93 Difference]: Finished difference Result 1667 states and 2126 transitions. [2019-09-10 08:41:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:47,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:41:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:47,047 INFO L225 Difference]: With dead ends: 1667 [2019-09-10 08:41:47,047 INFO L226 Difference]: Without dead ends: 1667 [2019-09-10 08:41:47,048 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:41:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-10 08:41:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1048. [2019-09-10 08:41:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-10 08:41:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1311 transitions. [2019-09-10 08:41:47,057 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1311 transitions. Word has length 122 [2019-09-10 08:41:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:47,057 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1311 transitions. [2019-09-10 08:41:47,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1311 transitions. [2019-09-10 08:41:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:41:47,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:47,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, 1, 1, 1, 1, 1, 1, 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:41:47,058 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2064548872, now seen corresponding path program 1 times [2019-09-10 08:41:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:47,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:47,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:47,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:41:47,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:47,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:41:47,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:47,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:41:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:41:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:41:47,857 INFO L87 Difference]: Start difference. First operand 1048 states and 1311 transitions. Second operand 17 states. [2019-09-10 08:41:48,567 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:41:48,733 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42