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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:32:19,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:32:19,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:32:19,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:32:19,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:32:19,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:32:19,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:32:19,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:32:19,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:32:19,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:32:19,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:32:19,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:32:19,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:32:19,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:32:19,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:32:19,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:32:19,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:32:19,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:32:19,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:32:19,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:32:19,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:32:19,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:32:19,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:32:19,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:32:19,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:32:19,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:32:19,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:32:19,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:32:19,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:32:19,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:32:19,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:32:19,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:32:19,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:32:19,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:32:19,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:32:19,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:32:19,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:32:19,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:32:19,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:32:19,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:32:19,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:32:19,987 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:32:20,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:32:20,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:32:20,004 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:32:20,004 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:32:20,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:32:20,005 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:32:20,005 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:32:20,006 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:32:20,006 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:32:20,006 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:32:20,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:32:20,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:32:20,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:32:20,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:32:20,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:32:20,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:32:20,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:32:20,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:32:20,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:32:20,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:32:20,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:32:20,009 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:32:20,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:32:20,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:20,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:32:20,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:32:20,010 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:32:20,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:32:20,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:32:20,011 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:32:20,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:32:20,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:32:20,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:32:20,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:32:20,066 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:32:20,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2019-09-10 08:32:20,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf767785c/a033579a8a7a4f059da006eea6ce6a32/FLAG328199fcc [2019-09-10 08:32:21,128 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:32:21,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2019-09-10 08:32:21,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf767785c/a033579a8a7a4f059da006eea6ce6a32/FLAG328199fcc [2019-09-10 08:32:21,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf767785c/a033579a8a7a4f059da006eea6ce6a32 [2019-09-10 08:32:21,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:32:21,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:32:21,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:21,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:32:21,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:32:21,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:21" (1/1) ... [2019-09-10 08:32:21,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324045ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:21, skipping insertion in model container [2019-09-10 08:32:21,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:21" (1/1) ... [2019-09-10 08:32:21,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:32:21,934 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:32:25,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:25,844 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:32:28,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:28,787 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:32:28,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28 WrapperNode [2019-09-10 08:32:28,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:28,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:32:28,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:32:28,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:32:28,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:28,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:28,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:28,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:29,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:29,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:29,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (1/1) ... [2019-09-10 08:32:29,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:32:29,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:32:29,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:32:29,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:32:29,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (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:32:29,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:32:29,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:32:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:32:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:32:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:32:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:32:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:32:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:32:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:32:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:32:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:32:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:32:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:32:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:32:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:32:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:32:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:32:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 08:32:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:32:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:32:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:32:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:32:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:32:40,485 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:32:40,486 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:32:40,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:40 BoogieIcfgContainer [2019-09-10 08:32:40,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:32:40,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:32:40,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:32:40,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:32:40,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:32:21" (1/3) ... [2019-09-10 08:32:40,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645fde59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:40, skipping insertion in model container [2019-09-10 08:32:40,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:28" (2/3) ... [2019-09-10 08:32:40,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645fde59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:40, skipping insertion in model container [2019-09-10 08:32:40,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:40" (3/3) ... [2019-09-10 08:32:40,498 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2019-09-10 08:32:40,508 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:32:40,520 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-09-10 08:32:40,539 INFO L252 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-09-10 08:32:40,572 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:32:40,573 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:32:40,573 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:32:40,573 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:32:40,573 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:32:40,574 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:32:40,574 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:32:40,574 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:32:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states. [2019-09-10 08:32:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:32:40,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:40,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, 1] [2019-09-10 08:32:40,745 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2089593706, now seen corresponding path program 1 times [2019-09-10 08:32:40,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:40,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:40,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:41,849 INFO L134 CoverageAnalysis]: 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:41,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:41,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:41,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:41,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:41,878 INFO L87 Difference]: Start difference. First operand 3898 states. Second operand 5 states. [2019-09-10 08:32:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,167 INFO L93 Difference]: Finished difference Result 3899 states and 6777 transitions. [2019-09-10 08:32:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:46,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:32:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:46,228 INFO L225 Difference]: With dead ends: 3899 [2019-09-10 08:32:46,228 INFO L226 Difference]: Without dead ends: 3887 [2019-09-10 08:32:46,233 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:32:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2019-09-10 08:32:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3761. [2019-09-10 08:32:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2019-09-10 08:32:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 5110 transitions. [2019-09-10 08:32:46,436 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 5110 transitions. Word has length 121 [2019-09-10 08:32:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,437 INFO L475 AbstractCegarLoop]: Abstraction has 3761 states and 5110 transitions. [2019-09-10 08:32:46,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 5110 transitions. [2019-09-10 08:32:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:32:46,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,454 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -477701280, now seen corresponding path program 1 times [2019-09-10 08:32:46,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,945 INFO L134 CoverageAnalysis]: 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:46,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:46,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:46,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:46,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:46,956 INFO L87 Difference]: Start difference. First operand 3761 states and 5110 transitions. Second operand 5 states. [2019-09-10 08:32:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:50,157 INFO L93 Difference]: Finished difference Result 3441 states and 4724 transitions. [2019-09-10 08:32:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:50,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-10 08:32:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:50,175 INFO L225 Difference]: With dead ends: 3441 [2019-09-10 08:32:50,176 INFO L226 Difference]: Without dead ends: 3441 [2019-09-10 08:32:50,177 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:32:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2019-09-10 08:32:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3441. [2019-09-10 08:32:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3441 states. [2019-09-10 08:32:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4724 transitions. [2019-09-10 08:32:50,266 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4724 transitions. Word has length 122 [2019-09-10 08:32:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:50,267 INFO L475 AbstractCegarLoop]: Abstraction has 3441 states and 4724 transitions. [2019-09-10 08:32:50,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4724 transitions. [2019-09-10 08:32:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:32:50,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:50,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,278 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 201129342, now seen corresponding path program 1 times [2019-09-10 08:32:50,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:50,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:50,635 INFO L134 CoverageAnalysis]: 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:50,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:50,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:50,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:50,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:50,637 INFO L87 Difference]: Start difference. First operand 3441 states and 4724 transitions. Second operand 5 states. [2019-09-10 08:32:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:52,434 INFO L93 Difference]: Finished difference Result 3092 states and 4341 transitions. [2019-09-10 08:32:52,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:52,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-10 08:32:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:52,454 INFO L225 Difference]: With dead ends: 3092 [2019-09-10 08:32:52,454 INFO L226 Difference]: Without dead ends: 3092 [2019-09-10 08:32:52,455 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:32:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2019-09-10 08:32:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2019-09-10 08:32:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-10 08:32:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4341 transitions. [2019-09-10 08:32:52,520 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4341 transitions. Word has length 123 [2019-09-10 08:32:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:52,521 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 4341 transitions. [2019-09-10 08:32:52,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4341 transitions. [2019-09-10 08:32:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:52,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:52,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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:52,528 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1223888620, now seen corresponding path program 1 times [2019-09-10 08:32:52,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:52,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:52,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:52,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:52,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:52,831 INFO L134 CoverageAnalysis]: 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:52,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:52,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:52,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:52,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:52,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:52,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:52,834 INFO L87 Difference]: Start difference. First operand 3092 states and 4341 transitions. Second operand 5 states. [2019-09-10 08:32:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:55,048 INFO L93 Difference]: Finished difference Result 2964 states and 4195 transitions. [2019-09-10 08:32:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:55,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-10 08:32:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:55,064 INFO L225 Difference]: With dead ends: 2964 [2019-09-10 08:32:55,064 INFO L226 Difference]: Without dead ends: 2964 [2019-09-10 08:32:55,065 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:32:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2019-09-10 08:32:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2964. [2019-09-10 08:32:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2964 states. [2019-09-10 08:32:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4195 transitions. [2019-09-10 08:32:55,139 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4195 transitions. Word has length 124 [2019-09-10 08:32:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:55,139 INFO L475 AbstractCegarLoop]: Abstraction has 2964 states and 4195 transitions. [2019-09-10 08:32:55,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4195 transitions. [2019-09-10 08:32:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:32:55,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:55,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,148 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1175551034, now seen corresponding path program 1 times [2019-09-10 08:32:55,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:55,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:55,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:55,456 INFO L134 CoverageAnalysis]: 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,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:55,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:55,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:55,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:55,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:55,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:55,459 INFO L87 Difference]: Start difference. First operand 2964 states and 4195 transitions. Second operand 5 states. [2019-09-10 08:32:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:57,135 INFO L93 Difference]: Finished difference Result 2858 states and 4079 transitions. [2019-09-10 08:32:57,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:57,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 08:32:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:57,150 INFO L225 Difference]: With dead ends: 2858 [2019-09-10 08:32:57,150 INFO L226 Difference]: Without dead ends: 2858 [2019-09-10 08:32:57,151 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:32:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-09-10 08:32:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2019-09-10 08:32:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2019-09-10 08:32:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4079 transitions. [2019-09-10 08:32:57,216 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4079 transitions. Word has length 125 [2019-09-10 08:32:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:57,217 INFO L475 AbstractCegarLoop]: Abstraction has 2858 states and 4079 transitions. [2019-09-10 08:32:57,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4079 transitions. [2019-09-10 08:32:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:32:57,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:57,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,223 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1417854168, now seen corresponding path program 1 times [2019-09-10 08:32:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:57,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:57,556 INFO L134 CoverageAnalysis]: 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:57,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:57,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:57,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:57,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:57,558 INFO L87 Difference]: Start difference. First operand 2858 states and 4079 transitions. Second operand 5 states. [2019-09-10 08:32:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:59,223 INFO L93 Difference]: Finished difference Result 2808 states and 4023 transitions. [2019-09-10 08:32:59,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:59,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 08:32:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:59,239 INFO L225 Difference]: With dead ends: 2808 [2019-09-10 08:32:59,239 INFO L226 Difference]: Without dead ends: 2808 [2019-09-10 08:32:59,239 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:32:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-09-10 08:32:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2808. [2019-09-10 08:32:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-10 08:32:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4023 transitions. [2019-09-10 08:32:59,290 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4023 transitions. Word has length 126 [2019-09-10 08:32:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:59,290 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 4023 transitions. [2019-09-10 08:32:59,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4023 transitions. [2019-09-10 08:32:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:32:59,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:59,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,297 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1969050564, now seen corresponding path program 1 times [2019-09-10 08:32:59,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:59,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:59,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:59,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:59,533 INFO L134 CoverageAnalysis]: 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,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:59,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:59,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:59,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:59,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:59,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:59,534 INFO L87 Difference]: Start difference. First operand 2808 states and 4023 transitions. Second operand 5 states. [2019-09-10 08:33:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:01,120 INFO L93 Difference]: Finished difference Result 2777 states and 3988 transitions. [2019-09-10 08:33:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:01,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-10 08:33:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:01,138 INFO L225 Difference]: With dead ends: 2777 [2019-09-10 08:33:01,138 INFO L226 Difference]: Without dead ends: 2777 [2019-09-10 08:33:01,139 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:33:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-09-10 08:33:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2777. [2019-09-10 08:33:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2019-09-10 08:33:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3988 transitions. [2019-09-10 08:33:01,189 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3988 transitions. Word has length 127 [2019-09-10 08:33:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:01,189 INFO L475 AbstractCegarLoop]: Abstraction has 2777 states and 3988 transitions. [2019-09-10 08:33:01,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3988 transitions. [2019-09-10 08:33:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:33:01,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:01,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,196 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:01,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1363435270, now seen corresponding path program 1 times [2019-09-10 08:33:01,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:01,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:01,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:01,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:01,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:01,478 INFO L134 CoverageAnalysis]: 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:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:01,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:01,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:01,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:01,480 INFO L87 Difference]: Start difference. First operand 2777 states and 3988 transitions. Second operand 5 states. [2019-09-10 08:33:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:03,187 INFO L93 Difference]: Finished difference Result 2766 states and 3974 transitions. [2019-09-10 08:33:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:03,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-10 08:33:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:03,211 INFO L225 Difference]: With dead ends: 2766 [2019-09-10 08:33:03,212 INFO L226 Difference]: Without dead ends: 2766 [2019-09-10 08:33:03,212 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:33:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2019-09-10 08:33:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2766. [2019-09-10 08:33:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3974 transitions. [2019-09-10 08:33:03,263 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3974 transitions. Word has length 128 [2019-09-10 08:33:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:03,264 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3974 transitions. [2019-09-10 08:33:03,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3974 transitions. [2019-09-10 08:33:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:03,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:03,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,270 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2089118786, now seen corresponding path program 1 times [2019-09-10 08:33:03,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:03,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:03,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:03,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:03,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:03,757 INFO L134 CoverageAnalysis]: 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:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:03,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:33:03,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:03,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:33:03,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:33:03,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:33:03,760 INFO L87 Difference]: Start difference. First operand 2766 states and 3974 transitions. Second operand 8 states. [2019-09-10 08:33:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:07,938 INFO L93 Difference]: Finished difference Result 3484 states and 4780 transitions. [2019-09-10 08:33:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:33:07,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2019-09-10 08:33:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:07,951 INFO L225 Difference]: With dead ends: 3484 [2019-09-10 08:33:07,951 INFO L226 Difference]: Without dead ends: 3484 [2019-09-10 08:33:07,952 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:33:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2019-09-10 08:33:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 2766. [2019-09-10 08:33:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3973 transitions. [2019-09-10 08:33:08,005 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3973 transitions. Word has length 129 [2019-09-10 08:33:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:08,005 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3973 transitions. [2019-09-10 08:33:08,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:33:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3973 transitions. [2019-09-10 08:33:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:08,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:08,012 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash 344358934, now seen corresponding path program 1 times [2019-09-10 08:33:08,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:08,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:08,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:08,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:08,396 INFO L134 CoverageAnalysis]: 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:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:08,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:08,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:08,404 INFO L87 Difference]: Start difference. First operand 2766 states and 3973 transitions. Second operand 9 states. [2019-09-10 08:33:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:14,255 INFO L93 Difference]: Finished difference Result 3253 states and 4688 transitions. [2019-09-10 08:33:14,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:33:14,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-09-10 08:33:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:14,264 INFO L225 Difference]: With dead ends: 3253 [2019-09-10 08:33:14,264 INFO L226 Difference]: Without dead ends: 3253 [2019-09-10 08:33:14,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:33:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-10 08:33:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2766. [2019-09-10 08:33:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3972 transitions. [2019-09-10 08:33:14,327 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3972 transitions. Word has length 129 [2019-09-10 08:33:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:14,328 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3972 transitions. [2019-09-10 08:33:14,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3972 transitions. [2019-09-10 08:33:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:33:14,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:14,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:14,342 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1880291468, now seen corresponding path program 1 times [2019-09-10 08:33:14,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:14,749 INFO L134 CoverageAnalysis]: 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:14,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:14,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:14,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:14,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:14,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:14,751 INFO L87 Difference]: Start difference. First operand 2766 states and 3972 transitions. Second operand 9 states. [2019-09-10 08:33:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:19,870 INFO L93 Difference]: Finished difference Result 4646 states and 6675 transitions. [2019-09-10 08:33:19,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:19,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-09-10 08:33:19,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:19,879 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:33:19,880 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:33:19,880 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:33:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:33:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:33:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3971 transitions. [2019-09-10 08:33:19,937 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3971 transitions. Word has length 129 [2019-09-10 08:33:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:19,937 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3971 transitions. [2019-09-10 08:33:19,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3971 transitions. [2019-09-10 08:33:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:19,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:19,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,944 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1158692593, now seen corresponding path program 1 times [2019-09-10 08:33:19,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:20,301 INFO L134 CoverageAnalysis]: 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:20,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:20,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:20,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:20,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:20,305 INFO L87 Difference]: Start difference. First operand 2766 states and 3971 transitions. Second operand 9 states. [2019-09-10 08:33:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:26,456 INFO L93 Difference]: Finished difference Result 4646 states and 6673 transitions. [2019-09-10 08:33:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:26,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:33:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:26,466 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:33:26,467 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:33:26,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:33:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:33:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:33:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3969 transitions. [2019-09-10 08:33:26,520 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3969 transitions. Word has length 131 [2019-09-10 08:33:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:26,521 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3969 transitions. [2019-09-10 08:33:26,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3969 transitions. [2019-09-10 08:33:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:26,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:26,528 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2110751080, now seen corresponding path program 1 times [2019-09-10 08:33:26,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:26,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:26,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:26,847 INFO L134 CoverageAnalysis]: 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:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:26,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:26,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:26,850 INFO L87 Difference]: Start difference. First operand 2766 states and 3969 transitions. Second operand 9 states. [2019-09-10 08:33:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:32,467 INFO L93 Difference]: Finished difference Result 4646 states and 6669 transitions. [2019-09-10 08:33:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:32,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:33:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:32,480 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:33:32,480 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:33:32,481 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:33:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:33:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:33:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3967 transitions. [2019-09-10 08:33:32,539 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3967 transitions. Word has length 131 [2019-09-10 08:33:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:32,540 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3967 transitions. [2019-09-10 08:33:32,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3967 transitions. [2019-09-10 08:33:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:32,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:32,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,546 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:32,547 INFO L82 PathProgramCache]: Analyzing trace with hash -587953857, now seen corresponding path program 1 times [2019-09-10 08:33:32,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:32,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:32,872 INFO L134 CoverageAnalysis]: 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:32,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:32,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:32,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:32,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:32,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:32,875 INFO L87 Difference]: Start difference. First operand 2766 states and 3967 transitions. Second operand 9 states. [2019-09-10 08:33:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:39,503 INFO L93 Difference]: Finished difference Result 4682 states and 6729 transitions. [2019-09-10 08:33:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:39,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:33:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:39,513 INFO L225 Difference]: With dead ends: 4682 [2019-09-10 08:33:39,514 INFO L226 Difference]: Without dead ends: 4682 [2019-09-10 08:33:39,514 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:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-10 08:33:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-10 08:33:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3965 transitions. [2019-09-10 08:33:39,566 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3965 transitions. Word has length 131 [2019-09-10 08:33:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:39,567 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3965 transitions. [2019-09-10 08:33:39,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3965 transitions. [2019-09-10 08:33:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:39,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:39,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,573 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1083108632, now seen corresponding path program 1 times [2019-09-10 08:33:39,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:39,893 INFO L134 CoverageAnalysis]: 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,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:39,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:39,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:39,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:39,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:39,895 INFO L87 Difference]: Start difference. First operand 2766 states and 3965 transitions. Second operand 9 states. [2019-09-10 08:33:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:45,463 INFO L93 Difference]: Finished difference Result 3253 states and 4679 transitions. [2019-09-10 08:33:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:33:45,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:33:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:45,467 INFO L225 Difference]: With dead ends: 3253 [2019-09-10 08:33:45,467 INFO L226 Difference]: Without dead ends: 3253 [2019-09-10 08:33:45,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:33:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-10 08:33:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2766. [2019-09-10 08:33:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3963 transitions. [2019-09-10 08:33:45,509 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3963 transitions. Word has length 131 [2019-09-10 08:33:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:45,510 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3963 transitions. [2019-09-10 08:33:45,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3963 transitions. [2019-09-10 08:33:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:45,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:45,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:45,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash -768055919, now seen corresponding path program 1 times [2019-09-10 08:33:45,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:45,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:45,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:45,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:33:45,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:45,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:45,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:45,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:45,838 INFO L87 Difference]: Start difference. First operand 2766 states and 3963 transitions. Second operand 9 states. [2019-09-10 08:33:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:52,255 INFO L93 Difference]: Finished difference Result 4646 states and 6664 transitions. [2019-09-10 08:33:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:52,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:33:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:52,308 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:33:52,308 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:33:52,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:33:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:33:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:33:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:33:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3962 transitions. [2019-09-10 08:33:52,361 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3962 transitions. Word has length 131 [2019-09-10 08:33:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:52,362 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3962 transitions. [2019-09-10 08:33:52,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3962 transitions. [2019-09-10 08:33:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:33:52,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:52,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,368 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1342997610, now seen corresponding path program 1 times [2019-09-10 08:33:52,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:52,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:52,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:52,771 INFO L134 CoverageAnalysis]: 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:52,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:52,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:52,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:52,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:52,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:52,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:52,773 INFO L87 Difference]: Start difference. First operand 2766 states and 3962 transitions. Second operand 9 states. [2019-09-10 08:34:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:00,170 INFO L93 Difference]: Finished difference Result 4682 states and 6725 transitions. [2019-09-10 08:34:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:00,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:34:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:00,176 INFO L225 Difference]: With dead ends: 4682 [2019-09-10 08:34:00,176 INFO L226 Difference]: Without dead ends: 4682 [2019-09-10 08:34:00,177 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:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-10 08:34:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-10 08:34:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3961 transitions. [2019-09-10 08:34:00,220 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3961 transitions. Word has length 131 [2019-09-10 08:34:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:00,220 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3961 transitions. [2019-09-10 08:34:00,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3961 transitions. [2019-09-10 08:34:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:34:00,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:00,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,226 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1531428767, now seen corresponding path program 1 times [2019-09-10 08:34:00,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:00,538 INFO L134 CoverageAnalysis]: 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,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:00,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:00,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:00,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:00,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:00,540 INFO L87 Difference]: Start difference. First operand 2766 states and 3961 transitions. Second operand 9 states. [2019-09-10 08:34:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:06,787 INFO L93 Difference]: Finished difference Result 4646 states and 6662 transitions. [2019-09-10 08:34:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:06,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:34:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:06,793 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:34:06,794 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:34:06,794 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:34:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:34:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:34:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3960 transitions. [2019-09-10 08:34:06,838 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3960 transitions. Word has length 131 [2019-09-10 08:34:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:06,839 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3960 transitions. [2019-09-10 08:34:06,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3960 transitions. [2019-09-10 08:34:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:34:06,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:06,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,844 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1076586842, now seen corresponding path program 1 times [2019-09-10 08:34:06,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:06,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:06,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:06,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:06,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:07,239 INFO L134 CoverageAnalysis]: 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:07,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:07,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:07,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:07,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:07,242 INFO L87 Difference]: Start difference. First operand 2766 states and 3960 transitions. Second operand 9 states. [2019-09-10 08:34:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:14,442 INFO L93 Difference]: Finished difference Result 4682 states and 6721 transitions. [2019-09-10 08:34:14,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:14,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 08:34:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:14,448 INFO L225 Difference]: With dead ends: 4682 [2019-09-10 08:34:14,448 INFO L226 Difference]: Without dead ends: 4682 [2019-09-10 08:34:14,449 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:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-10 08:34:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-10 08:34:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3959 transitions. [2019-09-10 08:34:14,488 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3959 transitions. Word has length 131 [2019-09-10 08:34:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:14,488 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3959 transitions. [2019-09-10 08:34:14,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3959 transitions. [2019-09-10 08:34:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:14,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:14,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,492 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 736307517, now seen corresponding path program 1 times [2019-09-10 08:34:14,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:14,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:14,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:14,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:14,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:14,862 INFO L134 CoverageAnalysis]: 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:14,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:14,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:14,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:14,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:14,863 INFO L87 Difference]: Start difference. First operand 2766 states and 3959 transitions. Second operand 9 states. [2019-09-10 08:34:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,781 INFO L93 Difference]: Finished difference Result 4622 states and 6620 transitions. [2019-09-10 08:34:21,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:21,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:34:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,787 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:34:21,787 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:34:21,788 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:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:34:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:34:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3957 transitions. [2019-09-10 08:34:21,834 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3957 transitions. Word has length 133 [2019-09-10 08:34:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:21,835 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3957 transitions. [2019-09-10 08:34:21,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3957 transitions. [2019-09-10 08:34:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:21,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:21,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,839 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash 623712689, now seen corresponding path program 1 times [2019-09-10 08:34:21,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:22,170 INFO L134 CoverageAnalysis]: 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:22,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:22,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:22,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:22,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:22,173 INFO L87 Difference]: Start difference. First operand 2766 states and 3957 transitions. Second operand 9 states. [2019-09-10 08:34:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:27,761 INFO L93 Difference]: Finished difference Result 4478 states and 6364 transitions. [2019-09-10 08:34:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:27,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:34:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:27,769 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:34:27,769 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:34:27,769 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:34:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:34:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:34:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3955 transitions. [2019-09-10 08:34:27,815 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3955 transitions. Word has length 133 [2019-09-10 08:34:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:27,816 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3955 transitions. [2019-09-10 08:34:27,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3955 transitions. [2019-09-10 08:34:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:27,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:27,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,821 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1151280894, now seen corresponding path program 1 times [2019-09-10 08:34:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:27,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:27,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:28,127 INFO L134 CoverageAnalysis]: 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:28,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:28,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:28,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:28,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:28,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:28,129 INFO L87 Difference]: Start difference. First operand 2766 states and 3955 transitions. Second operand 9 states. [2019-09-10 08:34:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:34,065 INFO L93 Difference]: Finished difference Result 4622 states and 6614 transitions. [2019-09-10 08:34:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:34,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:34:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:34,072 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:34:34,072 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:34:34,072 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:34:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:34:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:34:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3953 transitions. [2019-09-10 08:34:34,103 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3953 transitions. Word has length 133 [2019-09-10 08:34:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:34,103 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3953 transitions. [2019-09-10 08:34:34,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3953 transitions. [2019-09-10 08:34:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:34,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:34,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,107 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1881878602, now seen corresponding path program 1 times [2019-09-10 08:34:34,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:34,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:34,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:34,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:34,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:34,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:34,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:34,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:34,410 INFO L87 Difference]: Start difference. First operand 2766 states and 3953 transitions. Second operand 9 states. [2019-09-10 08:34:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:40,302 INFO L93 Difference]: Finished difference Result 4646 states and 6651 transitions. [2019-09-10 08:34:40,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:40,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:34:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:40,308 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:34:40,308 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:34:40,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:34:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:34:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3951 transitions. [2019-09-10 08:34:40,342 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3951 transitions. Word has length 133 [2019-09-10 08:34:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:40,343 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3951 transitions. [2019-09-10 08:34:40,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3951 transitions. [2019-09-10 08:34:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:40,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:40,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,347 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash 222932807, now seen corresponding path program 1 times [2019-09-10 08:34:40,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:40,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:40,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:40,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:40,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:40,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:40,695 INFO L87 Difference]: Start difference. First operand 2766 states and 3951 transitions. Second operand 9 states. [2019-09-10 08:34:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:46,173 INFO L93 Difference]: Finished difference Result 4478 states and 6356 transitions. [2019-09-10 08:34:46,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:46,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:34:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:46,179 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:34:46,179 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:34:46,180 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:34:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:34:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:34:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3949 transitions. [2019-09-10 08:34:46,211 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3949 transitions. Word has length 133 [2019-09-10 08:34:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:46,212 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3949 transitions. [2019-09-10 08:34:46,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3949 transitions. [2019-09-10 08:34:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:46,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:46,217 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash 845437785, now seen corresponding path program 1 times [2019-09-10 08:34:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:46,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:46,570 INFO L134 CoverageAnalysis]: 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:46,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:46,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:46,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:46,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:46,573 INFO L87 Difference]: Start difference. First operand 2766 states and 3949 transitions. Second operand 9 states. [2019-09-10 08:34:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:53,752 INFO L93 Difference]: Finished difference Result 4682 states and 6703 transitions. [2019-09-10 08:34:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:53,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:34:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:53,762 INFO L225 Difference]: With dead ends: 4682 [2019-09-10 08:34:53,762 INFO L226 Difference]: Without dead ends: 4682 [2019-09-10 08:34:53,763 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:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-10 08:34:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-10 08:34:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:34:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3947 transitions. [2019-09-10 08:34:53,792 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3947 transitions. Word has length 133 [2019-09-10 08:34:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:53,792 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3947 transitions. [2019-09-10 08:34:53,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3947 transitions. [2019-09-10 08:34:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:34:53,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:53,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,796 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2083081898, now seen corresponding path program 1 times [2019-09-10 08:34:53,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:53,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:53,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:54,082 INFO L134 CoverageAnalysis]: 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:54,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:54,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:54,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:54,084 INFO L87 Difference]: Start difference. First operand 2766 states and 3947 transitions. Second operand 9 states. [2019-09-10 08:35:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:01,169 INFO L93 Difference]: Finished difference Result 4622 states and 6606 transitions. [2019-09-10 08:35:01,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:01,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:01,176 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:01,176 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:01,176 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:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3946 transitions. [2019-09-10 08:35:01,210 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3946 transitions. Word has length 133 [2019-09-10 08:35:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:01,210 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3946 transitions. [2019-09-10 08:35:01,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3946 transitions. [2019-09-10 08:35:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:01,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:01,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,214 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:01,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1507321918, now seen corresponding path program 1 times [2019-09-10 08:35:01,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:01,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:01,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:01,488 INFO L134 CoverageAnalysis]: 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:01,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:01,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:01,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:01,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:01,490 INFO L87 Difference]: Start difference. First operand 2766 states and 3946 transitions. Second operand 9 states. [2019-09-10 08:35:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:08,562 INFO L93 Difference]: Finished difference Result 4622 states and 6605 transitions. [2019-09-10 08:35:08,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:08,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:08,569 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:08,569 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:08,569 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:35:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3945 transitions. [2019-09-10 08:35:08,599 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3945 transitions. Word has length 133 [2019-09-10 08:35:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:08,599 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3945 transitions. [2019-09-10 08:35:08,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3945 transitions. [2019-09-10 08:35:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:08,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:08,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,602 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:08,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2120317287, now seen corresponding path program 1 times [2019-09-10 08:35:08,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:08,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:08,838 INFO L134 CoverageAnalysis]: 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:08,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:08,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:08,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:08,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:08,839 INFO L87 Difference]: Start difference. First operand 2766 states and 3945 transitions. Second operand 9 states. [2019-09-10 08:35:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:15,968 INFO L93 Difference]: Finished difference Result 4622 states and 6603 transitions. [2019-09-10 08:35:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:15,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:15,974 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:15,975 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:15,975 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:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3944 transitions. [2019-09-10 08:35:16,003 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3944 transitions. Word has length 133 [2019-09-10 08:35:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:16,004 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3944 transitions. [2019-09-10 08:35:16,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3944 transitions. [2019-09-10 08:35:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:16,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:16,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,006 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1595042912, now seen corresponding path program 1 times [2019-09-10 08:35:16,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:16,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:16,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:16,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:16,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:16,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:16,282 INFO L87 Difference]: Start difference. First operand 2766 states and 3944 transitions. Second operand 9 states. [2019-09-10 08:35:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:22,353 INFO L93 Difference]: Finished difference Result 4622 states and 6602 transitions. [2019-09-10 08:35:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:22,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:22,359 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:22,359 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:22,360 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:35:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3943 transitions. [2019-09-10 08:35:22,388 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3943 transitions. Word has length 133 [2019-09-10 08:35:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:22,388 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3943 transitions. [2019-09-10 08:35:22,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3943 transitions. [2019-09-10 08:35:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:22,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:22,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,391 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:22,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:22,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2083896402, now seen corresponding path program 1 times [2019-09-10 08:35:22,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:22,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:22,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:22,642 INFO L134 CoverageAnalysis]: 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:22,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:22,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:22,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:22,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:22,643 INFO L87 Difference]: Start difference. First operand 2766 states and 3943 transitions. Second operand 9 states. [2019-09-10 08:35:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:29,667 INFO L93 Difference]: Finished difference Result 4622 states and 6601 transitions. [2019-09-10 08:35:29,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:29,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:29,674 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:29,675 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:29,675 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:35:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3942 transitions. [2019-09-10 08:35:29,708 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3942 transitions. Word has length 133 [2019-09-10 08:35:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:29,708 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3942 transitions. [2019-09-10 08:35:29,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3942 transitions. [2019-09-10 08:35:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:29,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:29,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,711 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash -531295320, now seen corresponding path program 1 times [2019-09-10 08:35:29,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:29,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:29,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:29,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:29,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:30,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:30,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:30,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:30,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:30,067 INFO L87 Difference]: Start difference. First operand 2766 states and 3942 transitions. Second operand 9 states. [2019-09-10 08:35:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:37,442 INFO L93 Difference]: Finished difference Result 4646 states and 6637 transitions. [2019-09-10 08:35:37,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:37,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:37,448 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:35:37,448 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:35:37,449 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:35:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:35:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:35:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3941 transitions. [2019-09-10 08:35:37,481 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3941 transitions. Word has length 133 [2019-09-10 08:35:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:37,482 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3941 transitions. [2019-09-10 08:35:37,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3941 transitions. [2019-09-10 08:35:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:37,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:37,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,486 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash -67638233, now seen corresponding path program 1 times [2019-09-10 08:35:37,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:37,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:37,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:37,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:37,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:37,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:37,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:37,743 INFO L87 Difference]: Start difference. First operand 2766 states and 3941 transitions. Second operand 9 states. [2019-09-10 08:35:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:44,583 INFO L93 Difference]: Finished difference Result 4622 states and 6599 transitions. [2019-09-10 08:35:44,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:44,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:44,590 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:44,591 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:44,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:35:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3940 transitions. [2019-09-10 08:35:44,625 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3940 transitions. Word has length 133 [2019-09-10 08:35:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:44,625 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3940 transitions. [2019-09-10 08:35:44,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3940 transitions. [2019-09-10 08:35:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:35:44,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:44,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,629 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash -694771806, now seen corresponding path program 1 times [2019-09-10 08:35:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:44,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:44,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:44,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:44,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:44,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:44,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:44,918 INFO L87 Difference]: Start difference. First operand 2766 states and 3940 transitions. Second operand 9 states. [2019-09-10 08:35:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:52,210 INFO L93 Difference]: Finished difference Result 4622 states and 6597 transitions. [2019-09-10 08:35:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:52,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-10 08:35:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:52,216 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:52,216 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:52,217 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:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3939 transitions. [2019-09-10 08:35:52,247 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3939 transitions. Word has length 133 [2019-09-10 08:35:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:52,248 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3939 transitions. [2019-09-10 08:35:52,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3939 transitions. [2019-09-10 08:35:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:35:52,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:52,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:52,251 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -39049766, now seen corresponding path program 1 times [2019-09-10 08:35:52,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:52,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:52,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:52,491 INFO L134 CoverageAnalysis]: 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:52,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:52,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:52,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:52,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:52,492 INFO L87 Difference]: Start difference. First operand 2766 states and 3939 transitions. Second operand 9 states. [2019-09-10 08:35:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:59,772 INFO L93 Difference]: Finished difference Result 4622 states and 6593 transitions. [2019-09-10 08:35:59,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:59,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:35:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:59,778 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:35:59,778 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:35:59,778 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:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:35:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:35:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:35:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3937 transitions. [2019-09-10 08:35:59,804 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3937 transitions. Word has length 135 [2019-09-10 08:35:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:59,804 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3937 transitions. [2019-09-10 08:35:59,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3937 transitions. [2019-09-10 08:35:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:35:59,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:59,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,807 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1435754152, now seen corresponding path program 1 times [2019-09-10 08:35:59,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:59,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:00,051 INFO L134 CoverageAnalysis]: 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:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:00,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:00,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:00,052 INFO L87 Difference]: Start difference. First operand 2766 states and 3937 transitions. Second operand 9 states. [2019-09-10 08:36:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:06,815 INFO L93 Difference]: Finished difference Result 4574 states and 6510 transitions. [2019-09-10 08:36:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:06,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:06,822 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:36:06,822 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:36:06,822 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:36:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:36:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:36:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3935 transitions. [2019-09-10 08:36:06,891 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3935 transitions. Word has length 135 [2019-09-10 08:36:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:06,892 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3935 transitions. [2019-09-10 08:36:06,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3935 transitions. [2019-09-10 08:36:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:06,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:06,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,894 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:06,895 INFO L82 PathProgramCache]: Analyzing trace with hash -755352912, now seen corresponding path program 1 times [2019-09-10 08:36:06,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:06,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:06,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:06,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:06,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:07,224 INFO L134 CoverageAnalysis]: 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:07,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:07,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:07,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:07,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:07,227 INFO L87 Difference]: Start difference. First operand 2766 states and 3935 transitions. Second operand 9 states. [2019-09-10 08:36:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:14,789 INFO L93 Difference]: Finished difference Result 4574 states and 6508 transitions. [2019-09-10 08:36:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:14,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:14,795 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:36:14,795 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:36:14,796 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:36:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:36:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:36:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3933 transitions. [2019-09-10 08:36:14,839 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3933 transitions. Word has length 135 [2019-09-10 08:36:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:14,841 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3933 transitions. [2019-09-10 08:36:14,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3933 transitions. [2019-09-10 08:36:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:14,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:14,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,843 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1389363612, now seen corresponding path program 1 times [2019-09-10 08:36:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:14,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:15,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:15,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:15,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:15,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:15,044 INFO L87 Difference]: Start difference. First operand 2766 states and 3933 transitions. Second operand 9 states. [2019-09-10 08:36:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:20,573 INFO L93 Difference]: Finished difference Result 4478 states and 6336 transitions. [2019-09-10 08:36:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:20,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:20,579 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:36:20,579 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:36:20,579 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:36:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:36:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:36:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3931 transitions. [2019-09-10 08:36:20,609 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3931 transitions. Word has length 135 [2019-09-10 08:36:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:20,609 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3931 transitions. [2019-09-10 08:36:20,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3931 transitions. [2019-09-10 08:36:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:20,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:20,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,613 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash -748174051, now seen corresponding path program 1 times [2019-09-10 08:36:20,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:20,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:20,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:20,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:20,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:20,904 INFO L134 CoverageAnalysis]: 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,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:20,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:20,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:20,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:20,906 INFO L87 Difference]: Start difference. First operand 2766 states and 3931 transitions. Second operand 9 states. [2019-09-10 08:36:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:28,021 INFO L93 Difference]: Finished difference Result 4622 states and 6581 transitions. [2019-09-10 08:36:28,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:28,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:28,027 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:36:28,027 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:36:28,027 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:36:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:36:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:36:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3929 transitions. [2019-09-10 08:36:28,053 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3929 transitions. Word has length 135 [2019-09-10 08:36:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:28,054 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3929 transitions. [2019-09-10 08:36:28,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3929 transitions. [2019-09-10 08:36:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:28,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:28,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,056 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1585175971, now seen corresponding path program 1 times [2019-09-10 08:36:28,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:28,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:28,345 INFO L134 CoverageAnalysis]: 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:28,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:28,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:28,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:28,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:28,347 INFO L87 Difference]: Start difference. First operand 2766 states and 3929 transitions. Second operand 9 states. [2019-09-10 08:36:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:34,458 INFO L93 Difference]: Finished difference Result 4574 states and 6500 transitions. [2019-09-10 08:36:34,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:34,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:34,464 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:36:34,464 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:36:34,465 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:36:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:36:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:36:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3927 transitions. [2019-09-10 08:36:34,497 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3927 transitions. Word has length 135 [2019-09-10 08:36:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:34,497 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3927 transitions. [2019-09-10 08:36:34,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3927 transitions. [2019-09-10 08:36:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:34,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:34,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, 1, 1, 1, 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,501 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 22016039, now seen corresponding path program 1 times [2019-09-10 08:36:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:34,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:34,817 INFO L134 CoverageAnalysis]: 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:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:34,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:34,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:34,822 INFO L87 Difference]: Start difference. First operand 2766 states and 3927 transitions. Second operand 9 states. [2019-09-10 08:36:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:41,111 INFO L93 Difference]: Finished difference Result 4574 states and 6496 transitions. [2019-09-10 08:36:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:41,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:41,117 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:36:41,118 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:36:41,118 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:36:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:36:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:36:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3925 transitions. [2019-09-10 08:36:41,148 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3925 transitions. Word has length 135 [2019-09-10 08:36:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:41,148 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3925 transitions. [2019-09-10 08:36:41,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3925 transitions. [2019-09-10 08:36:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:41,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:41,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,150 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:41,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2071378897, now seen corresponding path program 1 times [2019-09-10 08:36:41,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:41,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:41,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:41,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:41,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:41,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:41,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:41,384 INFO L87 Difference]: Start difference. First operand 2766 states and 3925 transitions. Second operand 9 states. [2019-09-10 08:36:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:48,311 INFO L93 Difference]: Finished difference Result 4574 states and 6494 transitions. [2019-09-10 08:36:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:48,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:48,316 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:36:48,317 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:36:48,317 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:36:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:36:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:36:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3923 transitions. [2019-09-10 08:36:48,345 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3923 transitions. Word has length 135 [2019-09-10 08:36:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:48,345 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3923 transitions. [2019-09-10 08:36:48,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3923 transitions. [2019-09-10 08:36:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:48,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:48,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,348 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash -107791751, now seen corresponding path program 1 times [2019-09-10 08:36:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:48,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:48,574 INFO L134 CoverageAnalysis]: 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:48,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:48,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:48,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:48,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:48,576 INFO L87 Difference]: Start difference. First operand 2766 states and 3923 transitions. Second operand 9 states. [2019-09-10 08:36:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:55,545 INFO L93 Difference]: Finished difference Result 4574 states and 6492 transitions. [2019-09-10 08:36:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:55,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:36:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:55,557 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:36:55,557 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:36:55,557 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:36:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:36:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:36:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:36:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3921 transitions. [2019-09-10 08:36:55,594 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3921 transitions. Word has length 135 [2019-09-10 08:36:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:55,594 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3921 transitions. [2019-09-10 08:36:55,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3921 transitions. [2019-09-10 08:36:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:36:55,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:55,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,598 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -747622809, now seen corresponding path program 1 times [2019-09-10 08:36:55,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:55,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:55,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:55,829 INFO L134 CoverageAnalysis]: 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:55,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:55,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:55,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:55,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:55,831 INFO L87 Difference]: Start difference. First operand 2766 states and 3921 transitions. Second operand 9 states. [2019-09-10 08:37:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:02,917 INFO L93 Difference]: Finished difference Result 4622 states and 6569 transitions. [2019-09-10 08:37:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:02,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:02,923 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:37:02,923 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:37:02,924 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:37:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:37:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:37:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3919 transitions. [2019-09-10 08:37:02,954 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3919 transitions. Word has length 135 [2019-09-10 08:37:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:02,955 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3919 transitions. [2019-09-10 08:37:02,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3919 transitions. [2019-09-10 08:37:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:02,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:02,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,957 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash 195793146, now seen corresponding path program 1 times [2019-09-10 08:37:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:02,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:02,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:03,200 INFO L134 CoverageAnalysis]: 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:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:03,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:03,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:03,202 INFO L87 Difference]: Start difference. First operand 2766 states and 3919 transitions. Second operand 9 states. [2019-09-10 08:37:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:10,601 INFO L93 Difference]: Finished difference Result 4646 states and 6599 transitions. [2019-09-10 08:37:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:10,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:10,608 INFO L225 Difference]: With dead ends: 4646 [2019-09-10 08:37:10,608 INFO L226 Difference]: Without dead ends: 4646 [2019-09-10 08:37:10,608 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:37:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-10 08:37:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-10 08:37:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3917 transitions. [2019-09-10 08:37:10,635 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3917 transitions. Word has length 135 [2019-09-10 08:37:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:10,635 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3917 transitions. [2019-09-10 08:37:10,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3917 transitions. [2019-09-10 08:37:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:10,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:10,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,637 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1032140353, now seen corresponding path program 1 times [2019-09-10 08:37:10,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:10,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:10,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:10,825 INFO L134 CoverageAnalysis]: 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:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:10,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:10,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:10,826 INFO L87 Difference]: Start difference. First operand 2766 states and 3917 transitions. Second operand 9 states. [2019-09-10 08:37:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:17,721 INFO L93 Difference]: Finished difference Result 4574 states and 6486 transitions. [2019-09-10 08:37:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:17,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:17,726 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:37:17,727 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:37:17,727 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:37:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:37:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:37:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3915 transitions. [2019-09-10 08:37:17,755 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3915 transitions. Word has length 135 [2019-09-10 08:37:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:17,755 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3915 transitions. [2019-09-10 08:37:17,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3915 transitions. [2019-09-10 08:37:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:17,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:17,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,759 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1671971411, now seen corresponding path program 1 times [2019-09-10 08:37:17,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:17,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:17,999 INFO L134 CoverageAnalysis]: 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,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:17,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:17,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:17,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:18,000 INFO L87 Difference]: Start difference. First operand 2766 states and 3915 transitions. Second operand 9 states. [2019-09-10 08:37:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:23,549 INFO L93 Difference]: Finished difference Result 4478 states and 6316 transitions. [2019-09-10 08:37:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:23,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:23,558 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:37:23,558 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:37:23,558 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:37:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:37:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:37:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3913 transitions. [2019-09-10 08:37:23,588 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3913 transitions. Word has length 135 [2019-09-10 08:37:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:23,588 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3913 transitions. [2019-09-10 08:37:23,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3913 transitions. [2019-09-10 08:37:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:23,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:23,590 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,591 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 693839373, now seen corresponding path program 1 times [2019-09-10 08:37:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:23,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:23,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:23,786 INFO L134 CoverageAnalysis]: 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:23,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:23,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:23,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:23,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:23,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:23,787 INFO L87 Difference]: Start difference. First operand 2766 states and 3913 transitions. Second operand 9 states. [2019-09-10 08:37:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:31,231 INFO L93 Difference]: Finished difference Result 4622 states and 6555 transitions. [2019-09-10 08:37:31,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:31,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:31,238 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:37:31,238 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:37:31,238 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:37:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:37:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:37:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3911 transitions. [2019-09-10 08:37:31,268 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3911 transitions. Word has length 135 [2019-09-10 08:37:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:31,268 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3911 transitions. [2019-09-10 08:37:31,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3911 transitions. [2019-09-10 08:37:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:31,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:31,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:31,271 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -376808769, now seen corresponding path program 1 times [2019-09-10 08:37:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:31,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:31,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:31,513 INFO L134 CoverageAnalysis]: 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:31,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:31,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:31,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:31,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:31,515 INFO L87 Difference]: Start difference. First operand 2766 states and 3911 transitions. Second operand 9 states. [2019-09-10 08:37:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:38,061 INFO L93 Difference]: Finished difference Result 4574 states and 6478 transitions. [2019-09-10 08:37:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:38,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:38,067 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:37:38,068 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:37:38,068 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:37:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:37:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:37:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3909 transitions. [2019-09-10 08:37:38,097 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3909 transitions. Word has length 135 [2019-09-10 08:37:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:38,097 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3909 transitions. [2019-09-10 08:37:38,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3909 transitions. [2019-09-10 08:37:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:38,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:38,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,100 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1764484084, now seen corresponding path program 1 times [2019-09-10 08:37:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:38,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:38,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:38,292 INFO L134 CoverageAnalysis]: 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:38,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:38,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:38,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:38,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:38,293 INFO L87 Difference]: Start difference. First operand 2766 states and 3909 transitions. Second operand 9 states. [2019-09-10 08:37:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:43,943 INFO L93 Difference]: Finished difference Result 4478 states and 6310 transitions. [2019-09-10 08:37:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:43,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:43,949 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:37:43,949 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:37:43,950 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:37:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:37:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:37:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3907 transitions. [2019-09-10 08:37:43,983 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3907 transitions. Word has length 135 [2019-09-10 08:37:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:43,983 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3907 transitions. [2019-09-10 08:37:43,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3907 transitions. [2019-09-10 08:37:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:43,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:43,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,986 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 812047935, now seen corresponding path program 1 times [2019-09-10 08:37:43,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:43,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:43,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:43,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:43,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:44,183 INFO L134 CoverageAnalysis]: 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:44,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:44,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:44,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:44,184 INFO L87 Difference]: Start difference. First operand 2766 states and 3907 transitions. Second operand 9 states. [2019-09-10 08:37:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:51,617 INFO L93 Difference]: Finished difference Result 4622 states and 6549 transitions. [2019-09-10 08:37:51,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:51,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:51,624 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:37:51,624 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:37:51,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:37:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:37:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:37:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3905 transitions. [2019-09-10 08:37:51,654 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3905 transitions. Word has length 135 [2019-09-10 08:37:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:51,654 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3905 transitions. [2019-09-10 08:37:51,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3905 transitions. [2019-09-10 08:37:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:51,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:51,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,656 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash -410135329, now seen corresponding path program 1 times [2019-09-10 08:37:51,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:51,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:51,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:51,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:51,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:51,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:51,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:51,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:51,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:51,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:51,940 INFO L87 Difference]: Start difference. First operand 2766 states and 3905 transitions. Second operand 9 states. [2019-09-10 08:37:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:59,193 INFO L93 Difference]: Finished difference Result 4574 states and 6470 transitions. [2019-09-10 08:37:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:59,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:37:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:59,200 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:37:59,200 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:37:59,200 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:37:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:37:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:37:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:37:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3904 transitions. [2019-09-10 08:37:59,231 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3904 transitions. Word has length 135 [2019-09-10 08:37:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:59,231 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3904 transitions. [2019-09-10 08:37:59,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3904 transitions. [2019-09-10 08:37:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:37:59,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:59,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,236 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash 466364518, now seen corresponding path program 1 times [2019-09-10 08:37:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:59,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:59,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:59,431 INFO L134 CoverageAnalysis]: 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:59,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:59,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:59,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:59,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:59,432 INFO L87 Difference]: Start difference. First operand 2766 states and 3904 transitions. Second operand 9 states. [2019-09-10 08:38:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:06,121 INFO L93 Difference]: Finished difference Result 4574 states and 6469 transitions. [2019-09-10 08:38:06,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:06,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:06,128 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:06,128 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:06,128 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:38:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3903 transitions. [2019-09-10 08:38:06,157 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3903 transitions. Word has length 135 [2019-09-10 08:38:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:06,158 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3903 transitions. [2019-09-10 08:38:06,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3903 transitions. [2019-09-10 08:38:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:06,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:06,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,160 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash -912187828, now seen corresponding path program 1 times [2019-09-10 08:38:06,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:06,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:06,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:06,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:06,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:06,346 INFO L134 CoverageAnalysis]: 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:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:06,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:06,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:06,347 INFO L87 Difference]: Start difference. First operand 2766 states and 3903 transitions. Second operand 9 states. [2019-09-10 08:38:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:13,482 INFO L93 Difference]: Finished difference Result 4574 states and 6467 transitions. [2019-09-10 08:38:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:13,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:13,488 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:13,488 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:13,489 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:38:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3902 transitions. [2019-09-10 08:38:13,527 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3902 transitions. Word has length 135 [2019-09-10 08:38:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:13,528 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3902 transitions. [2019-09-10 08:38:13,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3902 transitions. [2019-09-10 08:38:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:13,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:13,530 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:13,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1490283073, now seen corresponding path program 1 times [2019-09-10 08:38:13,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:13,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:13,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:13,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:13,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:13,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:13,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:13,740 INFO L87 Difference]: Start difference. First operand 2766 states and 3902 transitions. Second operand 9 states. [2019-09-10 08:38:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:20,423 INFO L93 Difference]: Finished difference Result 4574 states and 6466 transitions. [2019-09-10 08:38:20,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:20,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:20,429 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:20,429 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:20,429 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:38:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3901 transitions. [2019-09-10 08:38:20,456 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3901 transitions. Word has length 135 [2019-09-10 08:38:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:20,456 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3901 transitions. [2019-09-10 08:38:20,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3901 transitions. [2019-09-10 08:38:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:20,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:20,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,459 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2121611680, now seen corresponding path program 1 times [2019-09-10 08:38:20,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:20,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:20,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:20,647 INFO L134 CoverageAnalysis]: 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:20,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:20,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:20,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:20,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:20,649 INFO L87 Difference]: Start difference. First operand 2766 states and 3901 transitions. Second operand 9 states. [2019-09-10 08:38:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:27,760 INFO L93 Difference]: Finished difference Result 4574 states and 6464 transitions. [2019-09-10 08:38:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:27,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:27,767 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:27,767 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:27,767 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:38:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3900 transitions. [2019-09-10 08:38:27,795 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3900 transitions. Word has length 135 [2019-09-10 08:38:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:27,795 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3900 transitions. [2019-09-10 08:38:27,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3900 transitions. [2019-09-10 08:38:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:27,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:27,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,798 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1744708295, now seen corresponding path program 1 times [2019-09-10 08:38:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:27,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:28,002 INFO L134 CoverageAnalysis]: 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:28,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:28,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:28,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:28,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:28,003 INFO L87 Difference]: Start difference. First operand 2766 states and 3900 transitions. Second operand 9 states. [2019-09-10 08:38:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:34,710 INFO L93 Difference]: Finished difference Result 4574 states and 6463 transitions. [2019-09-10 08:38:34,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:34,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:34,716 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:34,716 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:34,717 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:38:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3899 transitions. [2019-09-10 08:38:34,747 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3899 transitions. Word has length 135 [2019-09-10 08:38:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:34,747 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3899 transitions. [2019-09-10 08:38:34,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3899 transitions. [2019-09-10 08:38:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:34,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:34,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:34,750 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 116908937, now seen corresponding path program 1 times [2019-09-10 08:38:34,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:34,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:34,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:34,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:34,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:34,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:34,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:34,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:34,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:34,984 INFO L87 Difference]: Start difference. First operand 2766 states and 3899 transitions. Second operand 9 states. [2019-09-10 08:38:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:42,157 INFO L93 Difference]: Finished difference Result 4574 states and 6461 transitions. [2019-09-10 08:38:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:42,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:42,161 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:42,161 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:42,161 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:38:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3898 transitions. [2019-09-10 08:38:42,184 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3898 transitions. Word has length 135 [2019-09-10 08:38:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:42,184 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3898 transitions. [2019-09-10 08:38:42,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3898 transitions. [2019-09-10 08:38:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:42,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:42,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,187 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:42,187 INFO L82 PathProgramCache]: Analyzing trace with hash 137176145, now seen corresponding path program 1 times [2019-09-10 08:38:42,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:42,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:42,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:42,372 INFO L134 CoverageAnalysis]: 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:42,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:42,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:42,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:42,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:42,374 INFO L87 Difference]: Start difference. First operand 2766 states and 3898 transitions. Second operand 9 states. [2019-09-10 08:38:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:49,615 INFO L93 Difference]: Finished difference Result 4622 states and 6536 transitions. [2019-09-10 08:38:49,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:49,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:49,621 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:38:49,621 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:38:49,621 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:38:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:38:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:38:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3897 transitions. [2019-09-10 08:38:49,658 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3897 transitions. Word has length 135 [2019-09-10 08:38:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:49,659 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3897 transitions. [2019-09-10 08:38:49,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3897 transitions. [2019-09-10 08:38:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:49,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:49,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,662 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 647556458, now seen corresponding path program 1 times [2019-09-10 08:38:49,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:49,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:49,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:49,859 INFO L134 CoverageAnalysis]: 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:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:49,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:49,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:49,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:49,860 INFO L87 Difference]: Start difference. First operand 2766 states and 3897 transitions. Second operand 9 states. [2019-09-10 08:38:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:56,933 INFO L93 Difference]: Finished difference Result 4574 states and 6459 transitions. [2019-09-10 08:38:56,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:56,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:38:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:56,938 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:38:56,939 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:38:56,939 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:38:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:38:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:38:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:38:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3896 transitions. [2019-09-10 08:38:56,964 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3896 transitions. Word has length 135 [2019-09-10 08:38:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:56,964 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3896 transitions. [2019-09-10 08:38:56,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3896 transitions. [2019-09-10 08:38:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:38:56,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:56,966 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1300493919, now seen corresponding path program 1 times [2019-09-10 08:38:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:56,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:56,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:57,197 INFO L134 CoverageAnalysis]: 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:57,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:57,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:57,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:57,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:57,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:57,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:57,198 INFO L87 Difference]: Start difference. First operand 2766 states and 3896 transitions. Second operand 9 states. [2019-09-10 08:39:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:03,977 INFO L93 Difference]: Finished difference Result 4574 states and 6458 transitions. [2019-09-10 08:39:03,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:03,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:39:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:03,983 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:39:03,983 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:39:03,984 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:39:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:39:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:39:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3895 transitions. [2019-09-10 08:39:04,012 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3895 transitions. Word has length 135 [2019-09-10 08:39:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:04,012 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3895 transitions. [2019-09-10 08:39:04,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3895 transitions. [2019-09-10 08:39:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:39:04,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:04,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,014 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:04,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash 918178650, now seen corresponding path program 1 times [2019-09-10 08:39:04,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:04,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:04,229 INFO L134 CoverageAnalysis]: 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:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:04,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:04,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:04,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:04,230 INFO L87 Difference]: Start difference. First operand 2766 states and 3895 transitions. Second operand 9 states. [2019-09-10 08:39:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:11,569 INFO L93 Difference]: Finished difference Result 4574 states and 6456 transitions. [2019-09-10 08:39:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:11,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:39:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:11,575 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:39:11,576 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:39:11,576 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:39:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:39:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:39:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3894 transitions. [2019-09-10 08:39:11,601 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3894 transitions. Word has length 135 [2019-09-10 08:39:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:11,602 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3894 transitions. [2019-09-10 08:39:11,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3894 transitions. [2019-09-10 08:39:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:39:11,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:11,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,604 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1625740784, now seen corresponding path program 1 times [2019-09-10 08:39:11,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:11,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:11,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:11,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:11,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:11,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:11,838 INFO L87 Difference]: Start difference. First operand 2766 states and 3894 transitions. Second operand 9 states. [2019-09-10 08:39:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:18,568 INFO L93 Difference]: Finished difference Result 4574 states and 6454 transitions. [2019-09-10 08:39:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:18,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:39:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:18,574 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:39:18,574 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:39:18,574 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:39:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:39:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:39:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3893 transitions. [2019-09-10 08:39:18,599 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3893 transitions. Word has length 135 [2019-09-10 08:39:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:18,599 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3893 transitions. [2019-09-10 08:39:18,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3893 transitions. [2019-09-10 08:39:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:39:18,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:18,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,602 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1825339865, now seen corresponding path program 1 times [2019-09-10 08:39:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:18,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:18,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:18,797 INFO L134 CoverageAnalysis]: 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:18,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:18,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:18,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:18,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:18,798 INFO L87 Difference]: Start difference. First operand 2766 states and 3893 transitions. Second operand 9 states. [2019-09-10 08:39:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:26,081 INFO L93 Difference]: Finished difference Result 4574 states and 6453 transitions. [2019-09-10 08:39:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:26,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:39:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:26,086 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:39:26,087 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:39:26,087 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:39:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:39:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:39:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3892 transitions. [2019-09-10 08:39:26,114 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3892 transitions. Word has length 135 [2019-09-10 08:39:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:26,114 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3892 transitions. [2019-09-10 08:39:26,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3892 transitions. [2019-09-10 08:39:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:39:26,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:26,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,117 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2087701418, now seen corresponding path program 1 times [2019-09-10 08:39:26,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:26,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:26,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:26,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:26,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:26,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:26,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:26,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:26,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:26,338 INFO L87 Difference]: Start difference. First operand 2766 states and 3892 transitions. Second operand 9 states. [2019-09-10 08:39:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:33,525 INFO L93 Difference]: Finished difference Result 4574 states and 6451 transitions. [2019-09-10 08:39:33,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:33,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:39:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:33,531 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:39:33,531 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:39:33,531 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:39:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:39:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:39:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3891 transitions. [2019-09-10 08:39:33,559 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3891 transitions. Word has length 135 [2019-09-10 08:39:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:33,559 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3891 transitions. [2019-09-10 08:39:33,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3891 transitions. [2019-09-10 08:39:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:39:33,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:33,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,562 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash 144242291, now seen corresponding path program 1 times [2019-09-10 08:39:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:33,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:33,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:33,781 INFO L134 CoverageAnalysis]: 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:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:33,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:33,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:33,783 INFO L87 Difference]: Start difference. First operand 2766 states and 3891 transitions. Second operand 9 states. [2019-09-10 08:39:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:39,752 INFO L93 Difference]: Finished difference Result 4478 states and 6292 transitions. [2019-09-10 08:39:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:39,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:39:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:39,758 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:39:39,758 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:39:39,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:39:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:39:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:39:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3890 transitions. [2019-09-10 08:39:39,783 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3890 transitions. Word has length 136 [2019-09-10 08:39:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:39,783 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3890 transitions. [2019-09-10 08:39:39,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3890 transitions. [2019-09-10 08:39:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:39:39,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:39,786 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1686864049, now seen corresponding path program 1 times [2019-09-10 08:39:39,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:39,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:39,985 INFO L134 CoverageAnalysis]: 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:39,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:39,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:39,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:39,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:39,987 INFO L87 Difference]: Start difference. First operand 2766 states and 3890 transitions. Second operand 9 states. [2019-09-10 08:39:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:46,421 INFO L93 Difference]: Finished difference Result 4478 states and 6290 transitions. [2019-09-10 08:39:46,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:46,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:39:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:46,427 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:39:46,427 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:39:46,428 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:39:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:39:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:39:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3888 transitions. [2019-09-10 08:39:46,456 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3888 transitions. Word has length 137 [2019-09-10 08:39:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:46,457 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3888 transitions. [2019-09-10 08:39:46,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3888 transitions. [2019-09-10 08:39:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:39:46,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:46,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,461 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2049773003, now seen corresponding path program 1 times [2019-09-10 08:39:46,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:46,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:46,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:46,673 INFO L134 CoverageAnalysis]: 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:46,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:46,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:46,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:46,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:46,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:46,674 INFO L87 Difference]: Start difference. First operand 2766 states and 3888 transitions. Second operand 9 states. [2019-09-10 08:39:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:53,227 INFO L93 Difference]: Finished difference Result 4478 states and 6286 transitions. [2019-09-10 08:39:53,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:53,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:39:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:53,232 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:39:53,232 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:39:53,233 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:39:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:39:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:39:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:39:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3886 transitions. [2019-09-10 08:39:53,259 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3886 transitions. Word has length 137 [2019-09-10 08:39:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:53,259 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3886 transitions. [2019-09-10 08:39:53,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3886 transitions. [2019-09-10 08:39:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:39:53,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:53,262 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -736196611, now seen corresponding path program 1 times [2019-09-10 08:39:53,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:53,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:53,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:53,464 INFO L134 CoverageAnalysis]: 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:53,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:53,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:53,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:53,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:53,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:53,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:53,466 INFO L87 Difference]: Start difference. First operand 2766 states and 3886 transitions. Second operand 9 states. [2019-09-10 08:40:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:00,612 INFO L93 Difference]: Finished difference Result 4478 states and 6284 transitions. [2019-09-10 08:40:00,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:00,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:00,618 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:40:00,618 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:40:00,618 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:40:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:40:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:40:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3884 transitions. [2019-09-10 08:40:00,649 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3884 transitions. Word has length 137 [2019-09-10 08:40:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:00,649 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3884 transitions. [2019-09-10 08:40:00,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3884 transitions. [2019-09-10 08:40:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:00,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:00,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,651 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2086215576, now seen corresponding path program 1 times [2019-09-10 08:40:00,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:00,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:00,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:00,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:00,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:40:00,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:00,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:00,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:00,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:00,876 INFO L87 Difference]: Start difference. First operand 2766 states and 3884 transitions. Second operand 9 states. [2019-09-10 08:40:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:08,543 INFO L93 Difference]: Finished difference Result 4574 states and 6438 transitions. [2019-09-10 08:40:08,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:08,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:08,548 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:40:08,548 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:40:08,548 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:40:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:40:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:40:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3882 transitions. [2019-09-10 08:40:08,578 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3882 transitions. Word has length 137 [2019-09-10 08:40:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:08,579 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3882 transitions. [2019-09-10 08:40:08,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3882 transitions. [2019-09-10 08:40:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:08,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:08,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:08,581 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash -697623189, now seen corresponding path program 1 times [2019-09-10 08:40:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:08,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:08,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:08,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:08,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:08,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:08,803 INFO L87 Difference]: Start difference. First operand 2766 states and 3882 transitions. Second operand 9 states. [2019-09-10 08:40:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:16,068 INFO L93 Difference]: Finished difference Result 4478 states and 6280 transitions. [2019-09-10 08:40:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:16,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:16,073 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:40:16,073 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:40:16,073 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:40:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:40:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:40:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3880 transitions. [2019-09-10 08:40:16,101 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3880 transitions. Word has length 137 [2019-09-10 08:40:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:16,101 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3880 transitions. [2019-09-10 08:40:16,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3880 transitions. [2019-09-10 08:40:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:16,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:16,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,104 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2077693142, now seen corresponding path program 1 times [2019-09-10 08:40:16,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:16,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:16,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:16,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:16,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:16,331 INFO L87 Difference]: Start difference. First operand 2766 states and 3880 transitions. Second operand 9 states. [2019-09-10 08:40:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:23,464 INFO L93 Difference]: Finished difference Result 4478 states and 6276 transitions. [2019-09-10 08:40:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:23,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:23,470 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:40:23,470 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:40:23,470 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:40:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:40:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:40:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3878 transitions. [2019-09-10 08:40:23,525 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3878 transitions. Word has length 137 [2019-09-10 08:40:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:23,525 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3878 transitions. [2019-09-10 08:40:23,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3878 transitions. [2019-09-10 08:40:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:23,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:23,527 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash 444186417, now seen corresponding path program 1 times [2019-09-10 08:40:23,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:23,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:23,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:23,718 INFO L134 CoverageAnalysis]: 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:23,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:23,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:23,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:23,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:23,719 INFO L87 Difference]: Start difference. First operand 2766 states and 3878 transitions. Second operand 9 states. [2019-09-10 08:40:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:30,950 INFO L93 Difference]: Finished difference Result 4574 states and 6430 transitions. [2019-09-10 08:40:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:30,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:30,955 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:40:30,956 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:40:30,956 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:40:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:40:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:40:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3876 transitions. [2019-09-10 08:40:30,986 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3876 transitions. Word has length 137 [2019-09-10 08:40:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:30,986 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3876 transitions. [2019-09-10 08:40:30,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3876 transitions. [2019-09-10 08:40:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:30,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:30,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:30,989 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash -55425074, now seen corresponding path program 1 times [2019-09-10 08:40:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:30,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:30,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:31,200 INFO L134 CoverageAnalysis]: 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:31,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:31,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:31,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:31,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:31,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:31,201 INFO L87 Difference]: Start difference. First operand 2766 states and 3876 transitions. Second operand 9 states. [2019-09-10 08:40:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:38,182 INFO L93 Difference]: Finished difference Result 4478 states and 6272 transitions. [2019-09-10 08:40:38,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:38,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:38,189 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:40:38,189 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:40:38,190 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:40:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:40:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:40:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3874 transitions. [2019-09-10 08:40:38,220 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3874 transitions. Word has length 137 [2019-09-10 08:40:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:38,220 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3874 transitions. [2019-09-10 08:40:38,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3874 transitions. [2019-09-10 08:40:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:38,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:38,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,224 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -802138012, now seen corresponding path program 1 times [2019-09-10 08:40:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:38,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:38,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:38,986 INFO L134 CoverageAnalysis]: 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:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:38,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:38,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:38,987 INFO L87 Difference]: Start difference. First operand 2766 states and 3874 transitions. Second operand 9 states. [2019-09-10 08:40:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:46,124 INFO L93 Difference]: Finished difference Result 4574 states and 6422 transitions. [2019-09-10 08:40:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:46,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:46,130 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:40:46,130 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:40:46,130 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:40:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:40:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:40:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3872 transitions. [2019-09-10 08:40:46,155 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3872 transitions. Word has length 137 [2019-09-10 08:40:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:46,156 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3872 transitions. [2019-09-10 08:40:46,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3872 transitions. [2019-09-10 08:40:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:46,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:46,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,158 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:46,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1721277275, now seen corresponding path program 1 times [2019-09-10 08:40:46,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:46,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:46,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:46,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:46,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:46,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:46,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:46,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:46,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:46,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:46,366 INFO L87 Difference]: Start difference. First operand 2766 states and 3872 transitions. Second operand 9 states. [2019-09-10 08:40:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:53,245 INFO L93 Difference]: Finished difference Result 4478 states and 6268 transitions. [2019-09-10 08:40:53,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:53,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:40:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:53,252 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:40:53,252 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:40:53,252 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:40:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:40:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:40:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:40:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3870 transitions. [2019-09-10 08:40:53,286 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3870 transitions. Word has length 137 [2019-09-10 08:40:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:53,287 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3870 transitions. [2019-09-10 08:40:53,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3870 transitions. [2019-09-10 08:40:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:40:53,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:53,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, 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,291 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1897729281, now seen corresponding path program 1 times [2019-09-10 08:40:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:53,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:53,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:53,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:53,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:53,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:53,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:53,551 INFO L87 Difference]: Start difference. First operand 2766 states and 3870 transitions. Second operand 9 states. [2019-09-10 08:41:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:00,532 INFO L93 Difference]: Finished difference Result 4478 states and 6266 transitions. [2019-09-10 08:41:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:00,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:00,538 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:41:00,538 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:41:00,538 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:41:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:41:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:41:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3868 transitions. [2019-09-10 08:41:00,567 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3868 transitions. Word has length 137 [2019-09-10 08:41:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:00,568 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3868 transitions. [2019-09-10 08:41:00,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3868 transitions. [2019-09-10 08:41:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:00,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:00,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:00,570 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -300990793, now seen corresponding path program 1 times [2019-09-10 08:41:00,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:00,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:00,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:00,825 INFO L134 CoverageAnalysis]: 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:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:00,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:00,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:00,826 INFO L87 Difference]: Start difference. First operand 2766 states and 3868 transitions. Second operand 9 states. [2019-09-10 08:41:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:07,809 INFO L93 Difference]: Finished difference Result 4478 states and 6262 transitions. [2019-09-10 08:41:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:07,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:07,814 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:41:07,815 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:41:07,815 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:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:41:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:41:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3866 transitions. [2019-09-10 08:41:07,842 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3866 transitions. Word has length 137 [2019-09-10 08:41:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:07,842 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3866 transitions. [2019-09-10 08:41:07,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3866 transitions. [2019-09-10 08:41:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:07,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:07,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,845 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:07,845 INFO L82 PathProgramCache]: Analyzing trace with hash -309521725, now seen corresponding path program 1 times [2019-09-10 08:41:07,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:07,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:07,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:07,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:07,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:08,038 INFO L134 CoverageAnalysis]: 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:08,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:08,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:08,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:08,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:08,039 INFO L87 Difference]: Start difference. First operand 2766 states and 3866 transitions. Second operand 9 states. [2019-09-10 08:41:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:14,997 INFO L93 Difference]: Finished difference Result 4478 states and 6260 transitions. [2019-09-10 08:41:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:14,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:15,002 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:41:15,003 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:41:15,003 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:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:41:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:41:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3864 transitions. [2019-09-10 08:41:15,029 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3864 transitions. Word has length 137 [2019-09-10 08:41:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:15,029 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3864 transitions. [2019-09-10 08:41:15,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3864 transitions. [2019-09-10 08:41:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:15,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:15,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,032 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1800379711, now seen corresponding path program 1 times [2019-09-10 08:41:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:15,241 INFO L134 CoverageAnalysis]: 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:15,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:15,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:15,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:15,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:15,243 INFO L87 Difference]: Start difference. First operand 2766 states and 3864 transitions. Second operand 9 states. [2019-09-10 08:41:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:21,665 INFO L93 Difference]: Finished difference Result 4478 states and 6256 transitions. [2019-09-10 08:41:21,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:21,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:21,670 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:41:21,670 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:41:21,671 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:41:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:41:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:41:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3862 transitions. [2019-09-10 08:41:21,696 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3862 transitions. Word has length 137 [2019-09-10 08:41:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:21,696 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3862 transitions. [2019-09-10 08:41:21,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3862 transitions. [2019-09-10 08:41:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:21,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:21,698 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:21,699 INFO L82 PathProgramCache]: Analyzing trace with hash -919121388, now seen corresponding path program 1 times [2019-09-10 08:41:21,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:21,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:21,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:21,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:21,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:21,890 INFO L134 CoverageAnalysis]: 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:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:21,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:21,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:21,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:21,891 INFO L87 Difference]: Start difference. First operand 2766 states and 3862 transitions. Second operand 9 states. [2019-09-10 08:41:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:28,831 INFO L93 Difference]: Finished difference Result 4478 states and 6252 transitions. [2019-09-10 08:41:28,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:28,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:28,836 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:41:28,836 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:41:28,837 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:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:41:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:41:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3860 transitions. [2019-09-10 08:41:28,865 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3860 transitions. Word has length 137 [2019-09-10 08:41:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:28,866 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3860 transitions. [2019-09-10 08:41:28,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3860 transitions. [2019-09-10 08:41:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:28,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:28,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,868 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1698314947, now seen corresponding path program 1 times [2019-09-10 08:41:28,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:28,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:28,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:28,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:29,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:41:29,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:29,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:29,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:29,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:29,103 INFO L87 Difference]: Start difference. First operand 2766 states and 3860 transitions. Second operand 9 states. [2019-09-10 08:41:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:35,375 INFO L93 Difference]: Finished difference Result 4622 states and 6476 transitions. [2019-09-10 08:41:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:35,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:35,381 INFO L225 Difference]: With dead ends: 4622 [2019-09-10 08:41:35,381 INFO L226 Difference]: Without dead ends: 4622 [2019-09-10 08:41:35,381 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:41:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-10 08:41:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-10 08:41:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3858 transitions. [2019-09-10 08:41:35,408 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3858 transitions. Word has length 137 [2019-09-10 08:41:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:35,408 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3858 transitions. [2019-09-10 08:41:35,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3858 transitions. [2019-09-10 08:41:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:35,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:35,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,410 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1245069544, now seen corresponding path program 1 times [2019-09-10 08:41:35,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:35,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:35,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:35,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:35,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:35,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:35,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:35,608 INFO L87 Difference]: Start difference. First operand 2766 states and 3858 transitions. Second operand 9 states. [2019-09-10 08:41:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:41,781 INFO L93 Difference]: Finished difference Result 4574 states and 6400 transitions. [2019-09-10 08:41:41,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:41,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:41,787 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:41:41,787 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:41:41,787 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:41:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:41:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:41:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3856 transitions. [2019-09-10 08:41:41,813 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3856 transitions. Word has length 137 [2019-09-10 08:41:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:41,814 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3856 transitions. [2019-09-10 08:41:41,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3856 transitions. [2019-09-10 08:41:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:41,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:41,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,816 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash 813537713, now seen corresponding path program 1 times [2019-09-10 08:41:41,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:41,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:41,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:42,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:41:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:42,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:42,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:42,013 INFO L87 Difference]: Start difference. First operand 2766 states and 3856 transitions. Second operand 9 states. [2019-09-10 08:41:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:48,857 INFO L93 Difference]: Finished difference Result 4478 states and 6246 transitions. [2019-09-10 08:41:48,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:48,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:48,863 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:41:48,863 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:41:48,863 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:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:41:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:41:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3854 transitions. [2019-09-10 08:41:48,889 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3854 transitions. Word has length 137 [2019-09-10 08:41:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:48,890 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3854 transitions. [2019-09-10 08:41:48,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3854 transitions. [2019-09-10 08:41:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:48,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:48,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,892 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1206644294, now seen corresponding path program 1 times [2019-09-10 08:41:48,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:48,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:48,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:49,116 INFO L134 CoverageAnalysis]: 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:49,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:49,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:49,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:49,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:49,117 INFO L87 Difference]: Start difference. First operand 2766 states and 3854 transitions. Second operand 9 states. [2019-09-10 08:41:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:56,444 INFO L93 Difference]: Finished difference Result 4574 states and 6394 transitions. [2019-09-10 08:41:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:56,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:41:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:56,450 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:41:56,450 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:41:56,450 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:41:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:41:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:41:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:41:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3852 transitions. [2019-09-10 08:41:56,477 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3852 transitions. Word has length 137 [2019-09-10 08:41:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:56,477 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3852 transitions. [2019-09-10 08:41:56,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3852 transitions. [2019-09-10 08:41:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:41:56,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:56,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,480 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1336095039, now seen corresponding path program 1 times [2019-09-10 08:41:56,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:56,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:56,689 INFO L134 CoverageAnalysis]: 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:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:56,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:56,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:56,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:56,691 INFO L87 Difference]: Start difference. First operand 2766 states and 3852 transitions. Second operand 9 states. [2019-09-10 08:42:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:03,766 INFO L93 Difference]: Finished difference Result 4478 states and 6242 transitions. [2019-09-10 08:42:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:03,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:03,772 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:03,772 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:03,772 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:42:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3850 transitions. [2019-09-10 08:42:03,805 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3850 transitions. Word has length 137 [2019-09-10 08:42:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:03,805 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3850 transitions. [2019-09-10 08:42:03,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3850 transitions. [2019-09-10 08:42:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:03,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:03,809 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash -332508341, now seen corresponding path program 1 times [2019-09-10 08:42:03,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:03,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:04,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:04,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:04,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:04,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:04,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:04,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:04,011 INFO L87 Difference]: Start difference. First operand 2766 states and 3850 transitions. Second operand 9 states. [2019-09-10 08:42:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:11,388 INFO L93 Difference]: Finished difference Result 4478 states and 6238 transitions. [2019-09-10 08:42:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:11,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:11,393 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:11,393 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:11,393 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:42:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3848 transitions. [2019-09-10 08:42:11,425 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3848 transitions. Word has length 137 [2019-09-10 08:42:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:11,425 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3848 transitions. [2019-09-10 08:42:11,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3848 transitions. [2019-09-10 08:42:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:11,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:11,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:11,429 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1766393205, now seen corresponding path program 1 times [2019-09-10 08:42:11,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:11,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:11,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:11,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:11,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:11,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:11,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:11,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:11,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:11,644 INFO L87 Difference]: Start difference. First operand 2766 states and 3848 transitions. Second operand 9 states. [2019-09-10 08:42:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:18,879 INFO L93 Difference]: Finished difference Result 4478 states and 6236 transitions. [2019-09-10 08:42:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:18,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:18,884 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:18,885 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:18,885 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:42:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3846 transitions. [2019-09-10 08:42:18,912 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3846 transitions. Word has length 137 [2019-09-10 08:42:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:18,912 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3846 transitions. [2019-09-10 08:42:18,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3846 transitions. [2019-09-10 08:42:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:18,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:18,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:18,915 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 36725900, now seen corresponding path program 1 times [2019-09-10 08:42:18,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:18,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:19,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:19,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:19,116 INFO L87 Difference]: Start difference. First operand 2766 states and 3846 transitions. Second operand 9 states. [2019-09-10 08:42:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:26,672 INFO L93 Difference]: Finished difference Result 4574 states and 6382 transitions. [2019-09-10 08:42:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:26,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:26,678 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:42:26,678 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:42:26,679 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:42:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:42:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:42:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3844 transitions. [2019-09-10 08:42:26,708 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3844 transitions. Word has length 137 [2019-09-10 08:42:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:26,708 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3844 transitions. [2019-09-10 08:42:26,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3844 transitions. [2019-09-10 08:42:26,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:26,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:26,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:26,711 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:26,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2095333157, now seen corresponding path program 1 times [2019-09-10 08:42:26,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:26,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:26,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:26,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:26,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:26,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:42:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:26,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:26,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:26,921 INFO L87 Difference]: Start difference. First operand 2766 states and 3844 transitions. Second operand 9 states. [2019-09-10 08:42:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:34,209 INFO L93 Difference]: Finished difference Result 4478 states and 6232 transitions. [2019-09-10 08:42:34,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:34,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:34,215 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:34,215 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:34,215 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:42:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3842 transitions. [2019-09-10 08:42:34,246 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3842 transitions. Word has length 137 [2019-09-10 08:42:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:34,247 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3842 transitions. [2019-09-10 08:42:34,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3842 transitions. [2019-09-10 08:42:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:34,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:34,250 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1769781830, now seen corresponding path program 1 times [2019-09-10 08:42:34,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:34,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:34,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:34,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:34,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:34,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:34,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:34,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:34,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:34,447 INFO L87 Difference]: Start difference. First operand 2766 states and 3842 transitions. Second operand 9 states. [2019-09-10 08:42:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:41,890 INFO L93 Difference]: Finished difference Result 4478 states and 6230 transitions. [2019-09-10 08:42:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:41,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:41,895 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:41,895 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:41,896 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:42:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3840 transitions. [2019-09-10 08:42:41,922 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3840 transitions. Word has length 137 [2019-09-10 08:42:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:41,922 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3840 transitions. [2019-09-10 08:42:41,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3840 transitions. [2019-09-10 08:42:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:41,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:41,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:41,925 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash 426729777, now seen corresponding path program 1 times [2019-09-10 08:42:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:41,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:41,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:42,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:42,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:42,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:42,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:42,133 INFO L87 Difference]: Start difference. First operand 2766 states and 3840 transitions. Second operand 9 states. [2019-09-10 08:42:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:49,631 INFO L93 Difference]: Finished difference Result 4478 states and 6226 transitions. [2019-09-10 08:42:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:49,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:49,635 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:49,635 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:49,636 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:42:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3838 transitions. [2019-09-10 08:42:49,662 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3838 transitions. Word has length 137 [2019-09-10 08:42:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:49,662 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3838 transitions. [2019-09-10 08:42:49,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3838 transitions. [2019-09-10 08:42:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:49,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:49,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:49,664 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 129006585, now seen corresponding path program 1 times [2019-09-10 08:42:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:49,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:49,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:49,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:49,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:49,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:49,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:49,860 INFO L87 Difference]: Start difference. First operand 2766 states and 3838 transitions. Second operand 9 states. [2019-09-10 08:42:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:57,289 INFO L93 Difference]: Finished difference Result 4478 states and 6222 transitions. [2019-09-10 08:42:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:57,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:42:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:57,296 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:42:57,296 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:42:57,297 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:42:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:42:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:42:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:42:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3836 transitions. [2019-09-10 08:42:57,336 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3836 transitions. Word has length 137 [2019-09-10 08:42:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:57,336 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3836 transitions. [2019-09-10 08:42:57,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3836 transitions. [2019-09-10 08:42:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:42:57,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:57,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:57,340 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -352527193, now seen corresponding path program 1 times [2019-09-10 08:42:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:57,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:57,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:42:57,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:57,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:57,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:57,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:57,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:57,586 INFO L87 Difference]: Start difference. First operand 2766 states and 3836 transitions. Second operand 9 states. [2019-09-10 08:43:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:05,281 INFO L93 Difference]: Finished difference Result 4574 states and 6368 transitions. [2019-09-10 08:43:05,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:05,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:05,288 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:43:05,288 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:43:05,288 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:43:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:43:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:43:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3834 transitions. [2019-09-10 08:43:05,317 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3834 transitions. Word has length 137 [2019-09-10 08:43:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:05,317 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3834 transitions. [2019-09-10 08:43:05,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3834 transitions. [2019-09-10 08:43:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:05,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:05,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:05,319 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852232, now seen corresponding path program 1 times [2019-09-10 08:43:05,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:05,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:05,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:05,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:05,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:05,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:05,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:05,548 INFO L87 Difference]: Start difference. First operand 2766 states and 3834 transitions. Second operand 9 states. [2019-09-10 08:43:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:13,033 INFO L93 Difference]: Finished difference Result 4478 states and 6219 transitions. [2019-09-10 08:43:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:13,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:13,040 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:13,041 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:13,041 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:43:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3833 transitions. [2019-09-10 08:43:13,074 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3833 transitions. Word has length 137 [2019-09-10 08:43:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:13,075 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3833 transitions. [2019-09-10 08:43:13,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3833 transitions. [2019-09-10 08:43:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:13,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:13,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:13,077 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2043120089, now seen corresponding path program 1 times [2019-09-10 08:43:13,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:13,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:13,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:13,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:13,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:13,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:13,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:13,272 INFO L87 Difference]: Start difference. First operand 2766 states and 3833 transitions. Second operand 9 states. [2019-09-10 08:43:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:20,765 INFO L93 Difference]: Finished difference Result 4478 states and 6217 transitions. [2019-09-10 08:43:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:20,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:20,772 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:20,772 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:20,772 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:43:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3832 transitions. [2019-09-10 08:43:20,798 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3832 transitions. Word has length 137 [2019-09-10 08:43:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:20,798 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3832 transitions. [2019-09-10 08:43:20,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3832 transitions. [2019-09-10 08:43:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:20,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:20,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:20,800 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1751515401, now seen corresponding path program 1 times [2019-09-10 08:43:20,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:20,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:20,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:20,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:20,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:20,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:20,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:20,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:20,988 INFO L87 Difference]: Start difference. First operand 2766 states and 3832 transitions. Second operand 9 states. [2019-09-10 08:43:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:28,540 INFO L93 Difference]: Finished difference Result 4478 states and 6215 transitions. [2019-09-10 08:43:28,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:28,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:28,549 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:28,549 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:28,549 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:43:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3831 transitions. [2019-09-10 08:43:28,580 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3831 transitions. Word has length 137 [2019-09-10 08:43:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:28,580 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3831 transitions. [2019-09-10 08:43:28,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3831 transitions. [2019-09-10 08:43:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:28,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:28,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:28,583 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 455078159, now seen corresponding path program 1 times [2019-09-10 08:43:28,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:28,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:28,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:28,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:28,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:28,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:28,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:28,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:28,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:28,782 INFO L87 Difference]: Start difference. First operand 2766 states and 3831 transitions. Second operand 9 states. [2019-09-10 08:43:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:36,166 INFO L93 Difference]: Finished difference Result 4478 states and 6213 transitions. [2019-09-10 08:43:36,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:36,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:36,172 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:36,172 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:36,172 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:43:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3830 transitions. [2019-09-10 08:43:36,201 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3830 transitions. Word has length 137 [2019-09-10 08:43:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:36,201 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3830 transitions. [2019-09-10 08:43:36,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3830 transitions. [2019-09-10 08:43:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:36,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:36,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:36,204 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1686170407, now seen corresponding path program 1 times [2019-09-10 08:43:36,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:36,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:36,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:36,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:36,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:36,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:43:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:36,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:36,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:36,410 INFO L87 Difference]: Start difference. First operand 2766 states and 3830 transitions. Second operand 9 states. [2019-09-10 08:43:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:43,854 INFO L93 Difference]: Finished difference Result 4478 states and 6212 transitions. [2019-09-10 08:43:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:43,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:43,860 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:43,860 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:43,861 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:43:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3829 transitions. [2019-09-10 08:43:43,889 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3829 transitions. Word has length 137 [2019-09-10 08:43:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:43,889 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3829 transitions. [2019-09-10 08:43:43,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3829 transitions. [2019-09-10 08:43:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:43,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:43,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:43,891 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1396045607, now seen corresponding path program 1 times [2019-09-10 08:43:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:43,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:44,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:44,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:44,085 INFO L87 Difference]: Start difference. First operand 2766 states and 3829 transitions. Second operand 9 states. [2019-09-10 08:43:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:50,767 INFO L93 Difference]: Finished difference Result 4478 states and 6210 transitions. [2019-09-10 08:43:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:50,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:50,772 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:50,772 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:50,772 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:43:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3828 transitions. [2019-09-10 08:43:50,802 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3828 transitions. Word has length 137 [2019-09-10 08:43:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:50,802 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3828 transitions. [2019-09-10 08:43:50,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3828 transitions. [2019-09-10 08:43:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:50,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:50,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:50,804 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash 70777875, now seen corresponding path program 1 times [2019-09-10 08:43:50,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:50,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:50,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:50,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:50,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:50,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:50,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:50,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:50,999 INFO L87 Difference]: Start difference. First operand 2766 states and 3828 transitions. Second operand 9 states. [2019-09-10 08:43:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:58,351 INFO L93 Difference]: Finished difference Result 4478 states and 6208 transitions. [2019-09-10 08:43:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:58,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:43:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:58,360 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:43:58,360 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:43:58,360 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:43:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:43:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:43:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:43:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3827 transitions. [2019-09-10 08:43:58,427 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3827 transitions. Word has length 137 [2019-09-10 08:43:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:58,427 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3827 transitions. [2019-09-10 08:43:58,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3827 transitions. [2019-09-10 08:43:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:43:58,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:58,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:58,430 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash 626222461, now seen corresponding path program 1 times [2019-09-10 08:43:58,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:58,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:58,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:58,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:58,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:58,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:58,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:58,653 INFO L87 Difference]: Start difference. First operand 2766 states and 3827 transitions. Second operand 9 states. [2019-09-10 08:44:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:05,322 INFO L93 Difference]: Finished difference Result 4478 states and 6207 transitions. [2019-09-10 08:44:05,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:05,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:05,328 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:44:05,328 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:44:05,328 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:44:05,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:44:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:44:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3826 transitions. [2019-09-10 08:44:05,358 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3826 transitions. Word has length 137 [2019-09-10 08:44:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:05,358 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3826 transitions. [2019-09-10 08:44:05,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3826 transitions. [2019-09-10 08:44:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:05,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:05,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:05,360 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1630188996, now seen corresponding path program 1 times [2019-09-10 08:44:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:05,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:05,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:05,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:05,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:05,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:05,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:05,556 INFO L87 Difference]: Start difference. First operand 2766 states and 3826 transitions. Second operand 9 states. [2019-09-10 08:44:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:12,877 INFO L93 Difference]: Finished difference Result 4478 states and 6205 transitions. [2019-09-10 08:44:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:12,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:12,884 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:44:12,884 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:44:12,884 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:44:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:44:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:44:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3825 transitions. [2019-09-10 08:44:12,913 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3825 transitions. Word has length 137 [2019-09-10 08:44:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:12,913 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3825 transitions. [2019-09-10 08:44:12,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:12,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3825 transitions. [2019-09-10 08:44:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:12,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:12,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:12,916 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1020589333, now seen corresponding path program 1 times [2019-09-10 08:44:12,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:12,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:12,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:12,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:12,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:13,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:13,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:13,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:13,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:13,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:13,112 INFO L87 Difference]: Start difference. First operand 2766 states and 3825 transitions. Second operand 9 states. [2019-09-10 08:44:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:20,535 INFO L93 Difference]: Finished difference Result 4478 states and 6204 transitions. [2019-09-10 08:44:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:20,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:20,542 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:44:20,542 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:44:20,542 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:44:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:44:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:44:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3824 transitions. [2019-09-10 08:44:20,573 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3824 transitions. Word has length 137 [2019-09-10 08:44:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:20,573 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3824 transitions. [2019-09-10 08:44:20,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3824 transitions. [2019-09-10 08:44:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:20,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:20,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:20,576 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:20,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1399532771, now seen corresponding path program 1 times [2019-09-10 08:44:20,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:20,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:20,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:20,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:20,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:20,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:20,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:20,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:20,782 INFO L87 Difference]: Start difference. First operand 2766 states and 3824 transitions. Second operand 9 states. [2019-09-10 08:44:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:27,429 INFO L93 Difference]: Finished difference Result 4478 states and 6202 transitions. [2019-09-10 08:44:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:27,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:27,435 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:44:27,435 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:44:27,435 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:44:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:44:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:44:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3823 transitions. [2019-09-10 08:44:27,465 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3823 transitions. Word has length 137 [2019-09-10 08:44:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:27,466 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3823 transitions. [2019-09-10 08:44:27,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3823 transitions. [2019-09-10 08:44:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:27,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:27,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:27,468 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1376342384, now seen corresponding path program 1 times [2019-09-10 08:44:27,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:27,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:27,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:27,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:27,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:27,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:27,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:27,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:27,671 INFO L87 Difference]: Start difference. First operand 2766 states and 3823 transitions. Second operand 9 states. [2019-09-10 08:44:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:34,831 INFO L93 Difference]: Finished difference Result 4478 states and 6201 transitions. [2019-09-10 08:44:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:34,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:34,835 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:44:34,835 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:44:34,835 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:44:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:44:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:44:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3822 transitions. [2019-09-10 08:44:34,858 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3822 transitions. Word has length 137 [2019-09-10 08:44:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:34,859 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3822 transitions. [2019-09-10 08:44:34,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3822 transitions. [2019-09-10 08:44:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:34,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:34,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:34,861 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash -682264873, now seen corresponding path program 1 times [2019-09-10 08:44:34,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:34,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:34,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:35,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:44:35,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:35,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:35,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:35,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:35,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:35,051 INFO L87 Difference]: Start difference. First operand 2766 states and 3822 transitions. Second operand 9 states. [2019-09-10 08:44:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:42,667 INFO L93 Difference]: Finished difference Result 4574 states and 6346 transitions. [2019-09-10 08:44:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:42,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:42,675 INFO L225 Difference]: With dead ends: 4574 [2019-09-10 08:44:42,675 INFO L226 Difference]: Without dead ends: 4574 [2019-09-10 08:44:42,675 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:44:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-10 08:44:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-10 08:44:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3821 transitions. [2019-09-10 08:44:42,711 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3821 transitions. Word has length 137 [2019-09-10 08:44:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:42,712 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3821 transitions. [2019-09-10 08:44:42,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3821 transitions. [2019-09-10 08:44:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:42,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:42,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:42,715 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1803800570, now seen corresponding path program 1 times [2019-09-10 08:44:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:42,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:42,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:42,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:42,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:42,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:42,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:42,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:42,934 INFO L87 Difference]: Start difference. First operand 2766 states and 3821 transitions. Second operand 9 states. [2019-09-10 08:44:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:50,298 INFO L93 Difference]: Finished difference Result 4478 states and 6199 transitions. [2019-09-10 08:44:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:50,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 08:44:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:50,304 INFO L225 Difference]: With dead ends: 4478 [2019-09-10 08:44:50,304 INFO L226 Difference]: Without dead ends: 4478 [2019-09-10 08:44:50,304 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:44:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-10 08:44:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-10 08:44:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-10 08:44:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3820 transitions. [2019-09-10 08:44:50,332 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3820 transitions. Word has length 137 [2019-09-10 08:44:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:50,332 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3820 transitions. [2019-09-10 08:44:50,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3820 transitions. [2019-09-10 08:44:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:44:50,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:50,334 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash -292260996, now seen corresponding path program 1 times [2019-09-10 08:44:50,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:50,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:50,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:50,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:50,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:50,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:44:50,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:50,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:50,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:50,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:50,554 INFO L87 Difference]: Start difference. First operand 2766 states and 3820 transitions. Second operand 9 states.