java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:11:28,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:11:28,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:11:28,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:11:28,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:11:28,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:11:28,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:11:28,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:11:28,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:11:28,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:11:28,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:11:28,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:11:28,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:11:28,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:11:28,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:11:28,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:11:28,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:11:28,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:11:28,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:11:28,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:11:28,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:11:28,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:11:29,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:11:29,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:11:29,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:11:29,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:11:29,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:11:29,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:11:29,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:11:29,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:11:29,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:11:29,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:11:29,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:11:29,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:11:29,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:11:29,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:11:29,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:11:29,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:11:29,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:11:29,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:11:29,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:11:29,015 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:11:29,038 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:11:29,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:11:29,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:11:29,039 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:11:29,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:11:29,039 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:11:29,040 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:11:29,040 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:11:29,040 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:11:29,040 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:11:29,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:11:29,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:11:29,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:11:29,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:11:29,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:11:29,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:11:29,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:11:29,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:11:29,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:11:29,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:11:29,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:11:29,043 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:11:29,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:11:29,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:11:29,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:11:29,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:11:29,044 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:11:29,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:11:29,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:11:29,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:11:29,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:11:29,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:11:29,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:11:29,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:11:29,102 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:11:29,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-10 08:11:29,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31cad0e9/ba4cb7e53caf4336b52a8262fb8d23dd/FLAGc01af698e [2019-09-10 08:11:29,988 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:11:29,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-10 08:11:30,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31cad0e9/ba4cb7e53caf4336b52a8262fb8d23dd/FLAGc01af698e [2019-09-10 08:11:30,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31cad0e9/ba4cb7e53caf4336b52a8262fb8d23dd [2019-09-10 08:11:30,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:11:30,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:11:30,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:11:30,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:11:30,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:11:30,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:11:30" (1/1) ... [2019-09-10 08:11:30,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a697fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:30, skipping insertion in model container [2019-09-10 08:11:30,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:11:30" (1/1) ... [2019-09-10 08:11:30,568 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:11:30,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:11:32,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:11:32,846 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:11:34,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:11:34,281 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:11:34,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34 WrapperNode [2019-09-10 08:11:34,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:11:34,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:11:34,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:11:34,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:11:34,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (1/1) ... [2019-09-10 08:11:34,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:11:34,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:11:34,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:11:34,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:11:34,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (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:11:34,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:11:34,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:11:34,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:11:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:11:34,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:11:34,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:11:34,681 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:11:34,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:11:34,682 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:11:34,682 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:11:34,682 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:11:34,683 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:11:34,683 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:11:34,684 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:11:34,684 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:11:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:11:41,609 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:11:41,609 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:11:41,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:11:41 BoogieIcfgContainer [2019-09-10 08:11:41,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:11:41,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:11:41,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:11:41,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:11:41,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:11:30" (1/3) ... [2019-09-10 08:11:41,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f43aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:11:41, skipping insertion in model container [2019-09-10 08:11:41,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:11:34" (2/3) ... [2019-09-10 08:11:41,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f43aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:11:41, skipping insertion in model container [2019-09-10 08:11:41,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:11:41" (3/3) ... [2019-09-10 08:11:41,621 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-10 08:11:41,632 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:11:41,643 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:11:41,660 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:11:41,690 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:11:41,690 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:11:41,690 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:11:41,690 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:11:41,690 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:11:41,691 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:11:41,691 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:11:41,691 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:11:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states. [2019-09-10 08:11:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:11:41,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:41,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:41,786 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1776998407, now seen corresponding path program 1 times [2019-09-10 08:11:41,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:42,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:42,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:42,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:42,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:42,777 INFO L87 Difference]: Start difference. First operand 2546 states. Second operand 5 states. [2019-09-10 08:11:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:47,010 INFO L93 Difference]: Finished difference Result 2957 states and 4904 transitions. [2019-09-10 08:11:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:47,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:11:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:47,050 INFO L225 Difference]: With dead ends: 2957 [2019-09-10 08:11:47,051 INFO L226 Difference]: Without dead ends: 2945 [2019-09-10 08:11:47,052 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:11:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2019-09-10 08:11:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2759. [2019-09-10 08:11:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2019-09-10 08:11:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3623 transitions. [2019-09-10 08:11:47,220 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3623 transitions. Word has length 91 [2019-09-10 08:11:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:47,221 INFO L475 AbstractCegarLoop]: Abstraction has 2759 states and 3623 transitions. [2019-09-10 08:11:47,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3623 transitions. [2019-09-10 08:11:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:11:47,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:47,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:47,231 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash 303122164, now seen corresponding path program 1 times [2019-09-10 08:11:47,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:47,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:47,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:47,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:47,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:47,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:47,471 INFO L87 Difference]: Start difference. First operand 2759 states and 3623 transitions. Second operand 5 states. [2019-09-10 08:11:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:49,299 INFO L93 Difference]: Finished difference Result 2266 states and 3016 transitions. [2019-09-10 08:11:49,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:49,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:11:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:49,313 INFO L225 Difference]: With dead ends: 2266 [2019-09-10 08:11:49,313 INFO L226 Difference]: Without dead ends: 2266 [2019-09-10 08:11:49,314 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:11:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-09-10 08:11:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2266. [2019-09-10 08:11:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2019-09-10 08:11:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3016 transitions. [2019-09-10 08:11:49,376 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3016 transitions. Word has length 91 [2019-09-10 08:11:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:49,376 INFO L475 AbstractCegarLoop]: Abstraction has 2266 states and 3016 transitions. [2019-09-10 08:11:49,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3016 transitions. [2019-09-10 08:11:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:11:49,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:49,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:49,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1974545675, now seen corresponding path program 1 times [2019-09-10 08:11:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:49,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:49,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:49,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:49,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:49,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:49,615 INFO L87 Difference]: Start difference. First operand 2266 states and 3016 transitions. Second operand 5 states. [2019-09-10 08:11:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:50,954 INFO L93 Difference]: Finished difference Result 1637 states and 2191 transitions. [2019-09-10 08:11:50,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:50,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:11:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:50,966 INFO L225 Difference]: With dead ends: 1637 [2019-09-10 08:11:50,967 INFO L226 Difference]: Without dead ends: 1637 [2019-09-10 08:11:50,967 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:11:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-09-10 08:11:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2019-09-10 08:11:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-09-10 08:11:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2191 transitions. [2019-09-10 08:11:51,023 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2191 transitions. Word has length 91 [2019-09-10 08:11:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:51,024 INFO L475 AbstractCegarLoop]: Abstraction has 1637 states and 2191 transitions. [2019-09-10 08:11:51,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2191 transitions. [2019-09-10 08:11:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:11:51,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:51,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:51,043 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash -920384266, now seen corresponding path program 1 times [2019-09-10 08:11:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:51,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:51,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:51,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:51,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:51,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:51,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:51,348 INFO L87 Difference]: Start difference. First operand 1637 states and 2191 transitions. Second operand 5 states. [2019-09-10 08:11:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:52,143 INFO L93 Difference]: Finished difference Result 1126 states and 1509 transitions. [2019-09-10 08:11:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:52,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:11:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:52,152 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 08:11:52,152 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 08:11:52,152 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:11:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 08:11:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2019-09-10 08:11:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2019-09-10 08:11:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1509 transitions. [2019-09-10 08:11:52,179 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1509 transitions. Word has length 93 [2019-09-10 08:11:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:52,180 INFO L475 AbstractCegarLoop]: Abstraction has 1126 states and 1509 transitions. [2019-09-10 08:11:52,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1509 transitions. [2019-09-10 08:11:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:11:52,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:52,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:52,184 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1089233402, now seen corresponding path program 1 times [2019-09-10 08:11:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:52,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:52,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:52,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:52,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:52,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:52,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:52,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:52,495 INFO L87 Difference]: Start difference. First operand 1126 states and 1509 transitions. Second operand 5 states. [2019-09-10 08:11:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:53,027 INFO L93 Difference]: Finished difference Result 1006 states and 1355 transitions. [2019-09-10 08:11:53,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:53,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 08:11:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:53,034 INFO L225 Difference]: With dead ends: 1006 [2019-09-10 08:11:53,034 INFO L226 Difference]: Without dead ends: 1006 [2019-09-10 08:11:53,035 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:11:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-10 08:11:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2019-09-10 08:11:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-09-10 08:11:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1355 transitions. [2019-09-10 08:11:53,062 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1355 transitions. Word has length 95 [2019-09-10 08:11:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:53,063 INFO L475 AbstractCegarLoop]: Abstraction has 1006 states and 1355 transitions. [2019-09-10 08:11:53,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1355 transitions. [2019-09-10 08:11:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:11:53,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:53,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:53,068 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash -414406108, now seen corresponding path program 1 times [2019-09-10 08:11:53,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:53,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:53,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:53,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:53,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:53,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:53,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:53,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:53,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:53,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:53,314 INFO L87 Difference]: Start difference. First operand 1006 states and 1355 transitions. Second operand 5 states. [2019-09-10 08:11:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:54,084 INFO L93 Difference]: Finished difference Result 998 states and 1344 transitions. [2019-09-10 08:11:54,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:54,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:11:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:54,092 INFO L225 Difference]: With dead ends: 998 [2019-09-10 08:11:54,092 INFO L226 Difference]: Without dead ends: 998 [2019-09-10 08:11:54,093 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:11:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-10 08:11:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2019-09-10 08:11:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:11:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1344 transitions. [2019-09-10 08:11:54,114 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1344 transitions. Word has length 97 [2019-09-10 08:11:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:54,115 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1344 transitions. [2019-09-10 08:11:54,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1344 transitions. [2019-09-10 08:11:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:11:54,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:54,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:54,119 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash -358667265, now seen corresponding path program 1 times [2019-09-10 08:11:54,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:54,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:54,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:54,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:54,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:54,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:54,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:54,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:54,500 INFO L87 Difference]: Start difference. First operand 998 states and 1344 transitions. Second operand 8 states. [2019-09-10 08:11:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:55,920 INFO L93 Difference]: Finished difference Result 1361 states and 1772 transitions. [2019-09-10 08:11:55,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:55,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-09-10 08:11:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:55,927 INFO L225 Difference]: With dead ends: 1361 [2019-09-10 08:11:55,928 INFO L226 Difference]: Without dead ends: 1361 [2019-09-10 08:11:55,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:11:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-10 08:11:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 998. [2019-09-10 08:11:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:11:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1343 transitions. [2019-09-10 08:11:55,954 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1343 transitions. Word has length 99 [2019-09-10 08:11:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:55,955 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1343 transitions. [2019-09-10 08:11:55,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1343 transitions. [2019-09-10 08:11:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:11:55,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:55,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:55,958 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1672611521, now seen corresponding path program 1 times [2019-09-10 08:11:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:55,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:55,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:55,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:56,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:11:56,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:56,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:56,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:56,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:56,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:56,304 INFO L87 Difference]: Start difference. First operand 998 states and 1343 transitions. Second operand 9 states. [2019-09-10 08:11:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:58,779 INFO L93 Difference]: Finished difference Result 1840 states and 2516 transitions. [2019-09-10 08:11:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:58,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:11:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:58,789 INFO L225 Difference]: With dead ends: 1840 [2019-09-10 08:11:58,790 INFO L226 Difference]: Without dead ends: 1840 [2019-09-10 08:11:58,790 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:11:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-10 08:11:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-10 08:11:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:11:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1342 transitions. [2019-09-10 08:11:58,815 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1342 transitions. Word has length 99 [2019-09-10 08:11:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:58,815 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1342 transitions. [2019-09-10 08:11:58,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1342 transitions. [2019-09-10 08:11:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:11:58,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:58,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:58,819 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1607232673, now seen corresponding path program 1 times [2019-09-10 08:11:58,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:58,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:58,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:59,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:11:59,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:59,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:59,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:59,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:59,116 INFO L87 Difference]: Start difference. First operand 998 states and 1342 transitions. Second operand 9 states. [2019-09-10 08:12:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:01,091 INFO L93 Difference]: Finished difference Result 1380 states and 1902 transitions. [2019-09-10 08:12:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:12:01,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:12:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:01,099 INFO L225 Difference]: With dead ends: 1380 [2019-09-10 08:12:01,100 INFO L226 Difference]: Without dead ends: 1380 [2019-09-10 08:12:01,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:12:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-09-10 08:12:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 998. [2019-09-10 08:12:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1341 transitions. [2019-09-10 08:12:01,126 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1341 transitions. Word has length 99 [2019-09-10 08:12:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:01,127 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1341 transitions. [2019-09-10 08:12:01,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1341 transitions. [2019-09-10 08:12:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:12:01,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:01,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:01,131 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -45829627, now seen corresponding path program 1 times [2019-09-10 08:12:01,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:01,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:01,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:01,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:01,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:01,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:01,433 INFO L87 Difference]: Start difference. First operand 998 states and 1341 transitions. Second operand 9 states. [2019-09-10 08:12:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:03,492 INFO L93 Difference]: Finished difference Result 1816 states and 2472 transitions. [2019-09-10 08:12:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:03,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:12:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:03,502 INFO L225 Difference]: With dead ends: 1816 [2019-09-10 08:12:03,503 INFO L226 Difference]: Without dead ends: 1816 [2019-09-10 08:12:03,503 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:12:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-10 08:12:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 998. [2019-09-10 08:12:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1340 transitions. [2019-09-10 08:12:03,530 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1340 transitions. Word has length 100 [2019-09-10 08:12:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:03,531 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1340 transitions. [2019-09-10 08:12:03,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1340 transitions. [2019-09-10 08:12:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:12:03,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:03,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:03,534 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1007680891, now seen corresponding path program 1 times [2019-09-10 08:12:03,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:03,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:03,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:03,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:03,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:03,804 INFO L87 Difference]: Start difference. First operand 998 states and 1340 transitions. Second operand 9 states. [2019-09-10 08:12:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:05,824 INFO L93 Difference]: Finished difference Result 1816 states and 2471 transitions. [2019-09-10 08:12:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:05,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:12:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:05,834 INFO L225 Difference]: With dead ends: 1816 [2019-09-10 08:12:05,835 INFO L226 Difference]: Without dead ends: 1816 [2019-09-10 08:12:05,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-10 08:12:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 998. [2019-09-10 08:12:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1339 transitions. [2019-09-10 08:12:05,861 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1339 transitions. Word has length 100 [2019-09-10 08:12:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:05,861 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1339 transitions. [2019-09-10 08:12:05,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1339 transitions. [2019-09-10 08:12:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:05,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:05,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:05,865 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1056417724, now seen corresponding path program 1 times [2019-09-10 08:12:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:05,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:05,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:05,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:06,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:06,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:06,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:06,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:06,170 INFO L87 Difference]: Start difference. First operand 998 states and 1339 transitions. Second operand 9 states. [2019-09-10 08:12:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:08,145 INFO L93 Difference]: Finished difference Result 1840 states and 2508 transitions. [2019-09-10 08:12:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:08,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:08,155 INFO L225 Difference]: With dead ends: 1840 [2019-09-10 08:12:08,155 INFO L226 Difference]: Without dead ends: 1840 [2019-09-10 08:12:08,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-10 08:12:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-10 08:12:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1337 transitions. [2019-09-10 08:12:08,178 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1337 transitions. Word has length 101 [2019-09-10 08:12:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:08,179 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1337 transitions. [2019-09-10 08:12:08,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1337 transitions. [2019-09-10 08:12:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:08,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:08,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:08,182 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash -434839516, now seen corresponding path program 1 times [2019-09-10 08:12:08,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:08,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:08,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:08,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:08,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:08,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:08,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:08,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:08,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:08,436 INFO L87 Difference]: Start difference. First operand 998 states and 1337 transitions. Second operand 9 states. [2019-09-10 08:12:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:10,827 INFO L93 Difference]: Finished difference Result 1870 states and 2559 transitions. [2019-09-10 08:12:10,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:10,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:10,836 INFO L225 Difference]: With dead ends: 1870 [2019-09-10 08:12:10,836 INFO L226 Difference]: Without dead ends: 1870 [2019-09-10 08:12:10,837 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:12:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-09-10 08:12:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 998. [2019-09-10 08:12:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1335 transitions. [2019-09-10 08:12:10,857 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1335 transitions. Word has length 101 [2019-09-10 08:12:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:10,857 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1335 transitions. [2019-09-10 08:12:10,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1335 transitions. [2019-09-10 08:12:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:10,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:10,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:10,861 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash -674178492, now seen corresponding path program 1 times [2019-09-10 08:12:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:10,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:10,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:11,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:11,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:11,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:11,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:11,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:11,109 INFO L87 Difference]: Start difference. First operand 998 states and 1335 transitions. Second operand 9 states. [2019-09-10 08:12:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:13,145 INFO L93 Difference]: Finished difference Result 1840 states and 2504 transitions. [2019-09-10 08:12:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:13,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:13,153 INFO L225 Difference]: With dead ends: 1840 [2019-09-10 08:12:13,153 INFO L226 Difference]: Without dead ends: 1840 [2019-09-10 08:12:13,153 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:12:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-10 08:12:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-10 08:12:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1333 transitions. [2019-09-10 08:12:13,176 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1333 transitions. Word has length 101 [2019-09-10 08:12:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:13,176 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1333 transitions. [2019-09-10 08:12:13,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1333 transitions. [2019-09-10 08:12:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:13,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:13,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:13,180 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1611690492, now seen corresponding path program 1 times [2019-09-10 08:12:13,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:13,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:13,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:13,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:13,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:13,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:13,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:13,430 INFO L87 Difference]: Start difference. First operand 998 states and 1333 transitions. Second operand 9 states. [2019-09-10 08:12:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:15,262 INFO L93 Difference]: Finished difference Result 1380 states and 1892 transitions. [2019-09-10 08:12:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:12:15,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:15,268 INFO L225 Difference]: With dead ends: 1380 [2019-09-10 08:12:15,268 INFO L226 Difference]: Without dead ends: 1380 [2019-09-10 08:12:15,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:12:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-09-10 08:12:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 998. [2019-09-10 08:12:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1331 transitions. [2019-09-10 08:12:15,288 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1331 transitions. Word has length 101 [2019-09-10 08:12:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:15,288 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1331 transitions. [2019-09-10 08:12:15,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1331 transitions. [2019-09-10 08:12:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:15,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:15,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] [2019-09-10 08:12:15,292 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1392154140, now seen corresponding path program 1 times [2019-09-10 08:12:15,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:15,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:15,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:15,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:15,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:15,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:15,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:15,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:15,540 INFO L87 Difference]: Start difference. First operand 998 states and 1331 transitions. Second operand 9 states. [2019-09-10 08:12:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:17,552 INFO L93 Difference]: Finished difference Result 1840 states and 2501 transitions. [2019-09-10 08:12:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:17,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:17,561 INFO L225 Difference]: With dead ends: 1840 [2019-09-10 08:12:17,562 INFO L226 Difference]: Without dead ends: 1840 [2019-09-10 08:12:17,562 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:12:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-10 08:12:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-10 08:12:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1330 transitions. [2019-09-10 08:12:17,585 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1330 transitions. Word has length 101 [2019-09-10 08:12:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:17,585 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1330 transitions. [2019-09-10 08:12:17,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1330 transitions. [2019-09-10 08:12:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:17,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:17,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:17,589 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 277444804, now seen corresponding path program 1 times [2019-09-10 08:12:17,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:17,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:17,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:17,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:17,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:17,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:17,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:17,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:17,825 INFO L87 Difference]: Start difference. First operand 998 states and 1330 transitions. Second operand 9 states. [2019-09-10 08:12:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:20,366 INFO L93 Difference]: Finished difference Result 1870 states and 2551 transitions. [2019-09-10 08:12:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:20,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:20,374 INFO L225 Difference]: With dead ends: 1870 [2019-09-10 08:12:20,375 INFO L226 Difference]: Without dead ends: 1870 [2019-09-10 08:12:20,375 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:12:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-09-10 08:12:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 998. [2019-09-10 08:12:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1329 transitions. [2019-09-10 08:12:20,395 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1329 transitions. Word has length 101 [2019-09-10 08:12:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:20,396 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1329 transitions. [2019-09-10 08:12:20,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1329 transitions. [2019-09-10 08:12:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:20,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:20,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:20,399 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash -807413543, now seen corresponding path program 1 times [2019-09-10 08:12:20,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:20,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:20,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:20,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:20,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:20,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:20,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:20,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:20,638 INFO L87 Difference]: Start difference. First operand 998 states and 1329 transitions. Second operand 9 states. [2019-09-10 08:12:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:22,593 INFO L93 Difference]: Finished difference Result 1840 states and 2499 transitions. [2019-09-10 08:12:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:22,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:22,599 INFO L225 Difference]: With dead ends: 1840 [2019-09-10 08:12:22,600 INFO L226 Difference]: Without dead ends: 1840 [2019-09-10 08:12:22,600 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:12:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-10 08:12:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-10 08:12:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-10 08:12:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1328 transitions. [2019-09-10 08:12:22,619 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1328 transitions. Word has length 101 [2019-09-10 08:12:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:22,620 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1328 transitions. [2019-09-10 08:12:22,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1328 transitions. [2019-09-10 08:12:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:22,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:22,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:22,623 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1914839865, now seen corresponding path program 1 times [2019-09-10 08:12:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:22,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:22,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:22,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:22,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:22,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:22,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:22,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:22,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:22,855 INFO L87 Difference]: Start difference. First operand 998 states and 1328 transitions. Second operand 9 states. [2019-09-10 08:12:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:24,875 INFO L93 Difference]: Finished difference Result 1766 states and 2373 transitions. [2019-09-10 08:12:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:24,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:24,880 INFO L225 Difference]: With dead ends: 1766 [2019-09-10 08:12:24,880 INFO L226 Difference]: Without dead ends: 1766 [2019-09-10 08:12:24,881 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:12:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-09-10 08:12:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 997. [2019-09-10 08:12:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1326 transitions. [2019-09-10 08:12:24,897 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1326 transitions. Word has length 101 [2019-09-10 08:12:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:24,898 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1326 transitions. [2019-09-10 08:12:24,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1326 transitions. [2019-09-10 08:12:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:12:24,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:24,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:24,901 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1193894972, now seen corresponding path program 1 times [2019-09-10 08:12:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:24,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:24,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:25,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:25,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:25,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:25,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:25,130 INFO L87 Difference]: Start difference. First operand 997 states and 1326 transitions. Second operand 9 states. [2019-09-10 08:12:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:27,720 INFO L93 Difference]: Finished difference Result 1869 states and 2547 transitions. [2019-09-10 08:12:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:27,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:12:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:27,726 INFO L225 Difference]: With dead ends: 1869 [2019-09-10 08:12:27,726 INFO L226 Difference]: Without dead ends: 1869 [2019-09-10 08:12:27,726 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:12:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-10 08:12:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 997. [2019-09-10 08:12:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1325 transitions. [2019-09-10 08:12:27,743 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1325 transitions. Word has length 101 [2019-09-10 08:12:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:27,743 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1325 transitions. [2019-09-10 08:12:27,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1325 transitions. [2019-09-10 08:12:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:27,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:27,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:27,746 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1049586336, now seen corresponding path program 1 times [2019-09-10 08:12:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:27,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:27,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:27,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:27,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:27,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:27,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:27,983 INFO L87 Difference]: Start difference. First operand 997 states and 1325 transitions. Second operand 9 states. [2019-09-10 08:12:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:30,078 INFO L93 Difference]: Finished difference Result 1815 states and 2455 transitions. [2019-09-10 08:12:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:30,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:30,084 INFO L225 Difference]: With dead ends: 1815 [2019-09-10 08:12:30,084 INFO L226 Difference]: Without dead ends: 1815 [2019-09-10 08:12:30,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-10 08:12:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-10 08:12:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1323 transitions. [2019-09-10 08:12:30,101 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1323 transitions. Word has length 102 [2019-09-10 08:12:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:30,102 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1323 transitions. [2019-09-10 08:12:30,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1323 transitions. [2019-09-10 08:12:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:30,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:30,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:30,105 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash -474327840, now seen corresponding path program 1 times [2019-09-10 08:12:30,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:30,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:30,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:30,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:30,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:30,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:30,397 INFO L87 Difference]: Start difference. First operand 997 states and 1323 transitions. Second operand 9 states. [2019-09-10 08:12:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:32,336 INFO L93 Difference]: Finished difference Result 1766 states and 2368 transitions. [2019-09-10 08:12:32,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:32,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:32,343 INFO L225 Difference]: With dead ends: 1766 [2019-09-10 08:12:32,344 INFO L226 Difference]: Without dead ends: 1766 [2019-09-10 08:12:32,344 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:12:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-09-10 08:12:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 997. [2019-09-10 08:12:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1322 transitions. [2019-09-10 08:12:32,362 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1322 transitions. Word has length 102 [2019-09-10 08:12:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:32,363 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1322 transitions. [2019-09-10 08:12:32,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1322 transitions. [2019-09-10 08:12:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:32,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:32,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:32,366 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash 259593247, now seen corresponding path program 1 times [2019-09-10 08:12:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:32,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:32,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:32,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:32,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:32,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:32,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:32,604 INFO L87 Difference]: Start difference. First operand 997 states and 1322 transitions. Second operand 9 states. [2019-09-10 08:12:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:34,621 INFO L93 Difference]: Finished difference Result 1766 states and 2367 transitions. [2019-09-10 08:12:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:34,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:34,626 INFO L225 Difference]: With dead ends: 1766 [2019-09-10 08:12:34,627 INFO L226 Difference]: Without dead ends: 1766 [2019-09-10 08:12:34,627 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:12:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-09-10 08:12:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 997. [2019-09-10 08:12:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1321 transitions. [2019-09-10 08:12:34,643 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1321 transitions. Word has length 102 [2019-09-10 08:12:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:34,644 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1321 transitions. [2019-09-10 08:12:34,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1321 transitions. [2019-09-10 08:12:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:34,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:34,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:34,647 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1176930359, now seen corresponding path program 1 times [2019-09-10 08:12:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:34,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:34,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:35,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:12:35,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:35,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:35,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:35,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:35,008 INFO L87 Difference]: Start difference. First operand 997 states and 1321 transitions. Second operand 9 states. [2019-09-10 08:12:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:37,182 INFO L93 Difference]: Finished difference Result 1839 states and 2490 transitions. [2019-09-10 08:12:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:37,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:37,187 INFO L225 Difference]: With dead ends: 1839 [2019-09-10 08:12:37,187 INFO L226 Difference]: Without dead ends: 1839 [2019-09-10 08:12:37,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-09-10 08:12:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 997. [2019-09-10 08:12:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1319 transitions. [2019-09-10 08:12:37,205 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1319 transitions. Word has length 103 [2019-09-10 08:12:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:37,205 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1319 transitions. [2019-09-10 08:12:37,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1319 transitions. [2019-09-10 08:12:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:37,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:37,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:37,208 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash 870365257, now seen corresponding path program 1 times [2019-09-10 08:12:37,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:37,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:37,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:37,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:37,453 INFO L87 Difference]: Start difference. First operand 997 states and 1319 transitions. Second operand 9 states. [2019-09-10 08:12:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:39,576 INFO L93 Difference]: Finished difference Result 1815 states and 2449 transitions. [2019-09-10 08:12:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:39,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:39,580 INFO L225 Difference]: With dead ends: 1815 [2019-09-10 08:12:39,580 INFO L226 Difference]: Without dead ends: 1815 [2019-09-10 08:12:39,581 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:12:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-10 08:12:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-10 08:12:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1317 transitions. [2019-09-10 08:12:39,598 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1317 transitions. Word has length 103 [2019-09-10 08:12:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:39,598 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1317 transitions. [2019-09-10 08:12:39,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1317 transitions. [2019-09-10 08:12:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:39,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:39,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] [2019-09-10 08:12:39,602 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash -516081623, now seen corresponding path program 1 times [2019-09-10 08:12:39,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:39,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:39,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:39,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:39,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:39,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:39,867 INFO L87 Difference]: Start difference. First operand 997 states and 1317 transitions. Second operand 9 states. [2019-09-10 08:12:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:42,095 INFO L93 Difference]: Finished difference Result 1815 states and 2447 transitions. [2019-09-10 08:12:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:42,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:42,098 INFO L225 Difference]: With dead ends: 1815 [2019-09-10 08:12:42,099 INFO L226 Difference]: Without dead ends: 1815 [2019-09-10 08:12:42,099 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:12:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-10 08:12:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-10 08:12:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1315 transitions. [2019-09-10 08:12:42,112 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1315 transitions. Word has length 103 [2019-09-10 08:12:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:42,112 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1315 transitions. [2019-09-10 08:12:42,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1315 transitions. [2019-09-10 08:12:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:42,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:42,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:42,114 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1348564727, now seen corresponding path program 1 times [2019-09-10 08:12:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:42,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:42,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:42,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:42,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:42,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:42,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:42,334 INFO L87 Difference]: Start difference. First operand 997 states and 1315 transitions. Second operand 9 states. [2019-09-10 08:12:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:44,994 INFO L93 Difference]: Finished difference Result 1869 states and 2526 transitions. [2019-09-10 08:12:44,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:44,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:44,998 INFO L225 Difference]: With dead ends: 1869 [2019-09-10 08:12:44,998 INFO L226 Difference]: Without dead ends: 1869 [2019-09-10 08:12:44,998 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:12:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-10 08:12:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 997. [2019-09-10 08:12:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1313 transitions. [2019-09-10 08:12:45,016 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1313 transitions. Word has length 103 [2019-09-10 08:12:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:45,017 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1313 transitions. [2019-09-10 08:12:45,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1313 transitions. [2019-09-10 08:12:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:45,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:45,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:45,020 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash -673803223, now seen corresponding path program 1 times [2019-09-10 08:12:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:45,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:45,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:45,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:45,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:45,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:45,262 INFO L87 Difference]: Start difference. First operand 997 states and 1313 transitions. Second operand 9 states. [2019-09-10 08:12:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:47,541 INFO L93 Difference]: Finished difference Result 1815 states and 2443 transitions. [2019-09-10 08:12:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:47,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:47,545 INFO L225 Difference]: With dead ends: 1815 [2019-09-10 08:12:47,545 INFO L226 Difference]: Without dead ends: 1815 [2019-09-10 08:12:47,545 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:12:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-10 08:12:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-10 08:12:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:12:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1311 transitions. [2019-09-10 08:12:47,557 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1311 transitions. Word has length 103 [2019-09-10 08:12:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:47,557 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1311 transitions. [2019-09-10 08:12:47,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1311 transitions. [2019-09-10 08:12:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:47,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:47,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:47,559 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1113694153, now seen corresponding path program 1 times [2019-09-10 08:12:47,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:47,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:12:47,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:47,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:47,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:47,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:47,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:47,782 INFO L87 Difference]: Start difference. First operand 997 states and 1311 transitions. Second operand 9 states. [2019-09-10 08:12:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:50,123 INFO L93 Difference]: Finished difference Result 1764 states and 2353 transitions. [2019-09-10 08:12:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:50,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:50,126 INFO L225 Difference]: With dead ends: 1764 [2019-09-10 08:12:50,126 INFO L226 Difference]: Without dead ends: 1764 [2019-09-10 08:12:50,127 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:12:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-09-10 08:12:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 995. [2019-09-10 08:12:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-10 08:12:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1307 transitions. [2019-09-10 08:12:50,140 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1307 transitions. Word has length 103 [2019-09-10 08:12:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:50,140 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1307 transitions. [2019-09-10 08:12:50,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1307 transitions. [2019-09-10 08:12:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:50,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:50,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:50,142 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1754695543, now seen corresponding path program 1 times [2019-09-10 08:12:50,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:50,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:50,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:50,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:50,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:50,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:50,357 INFO L87 Difference]: Start difference. First operand 995 states and 1307 transitions. Second operand 9 states. [2019-09-10 08:12:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:52,930 INFO L93 Difference]: Finished difference Result 1813 states and 2435 transitions. [2019-09-10 08:12:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:52,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:52,933 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:12:52,934 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:12:52,935 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:12:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:12:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-10 08:12:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-10 08:12:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1305 transitions. [2019-09-10 08:12:52,946 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1305 transitions. Word has length 103 [2019-09-10 08:12:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:52,946 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1305 transitions. [2019-09-10 08:12:52,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1305 transitions. [2019-09-10 08:12:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:52,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:52,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:52,948 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1429386601, now seen corresponding path program 1 times [2019-09-10 08:12:52,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:52,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:52,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:52,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:52,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:53,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:53,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:53,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:53,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:53,164 INFO L87 Difference]: Start difference. First operand 995 states and 1305 transitions. Second operand 9 states. [2019-09-10 08:12:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:55,634 INFO L93 Difference]: Finished difference Result 1813 states and 2434 transitions. [2019-09-10 08:12:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:55,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:55,637 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:12:55,637 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:12:55,638 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:12:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:12:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-10 08:12:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-10 08:12:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1304 transitions. [2019-09-10 08:12:55,651 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1304 transitions. Word has length 103 [2019-09-10 08:12:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:55,652 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1304 transitions. [2019-09-10 08:12:55,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1304 transitions. [2019-09-10 08:12:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:55,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:55,654 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:55,654 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1352247863, now seen corresponding path program 1 times [2019-09-10 08:12:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:55,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:55,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:55,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:55,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:55,887 INFO L87 Difference]: Start difference. First operand 995 states and 1304 transitions. Second operand 9 states. [2019-09-10 08:12:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:58,098 INFO L93 Difference]: Finished difference Result 1837 states and 2468 transitions. [2019-09-10 08:12:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:58,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:58,101 INFO L225 Difference]: With dead ends: 1837 [2019-09-10 08:12:58,101 INFO L226 Difference]: Without dead ends: 1837 [2019-09-10 08:12:58,102 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:12:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-09-10 08:12:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 995. [2019-09-10 08:12:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-10 08:12:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1303 transitions. [2019-09-10 08:12:58,117 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1303 transitions. Word has length 103 [2019-09-10 08:12:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:58,117 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1303 transitions. [2019-09-10 08:12:58,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1303 transitions. [2019-09-10 08:12:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:58,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:58,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:58,120 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:58,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1081765687, now seen corresponding path program 1 times [2019-09-10 08:12:58,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:58,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:58,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:58,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:58,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:58,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:58,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:58,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:58,318 INFO L87 Difference]: Start difference. First operand 995 states and 1303 transitions. Second operand 9 states. [2019-09-10 08:13:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:00,894 INFO L93 Difference]: Finished difference Result 1813 states and 2431 transitions. [2019-09-10 08:13:00,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:00,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:13:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:00,897 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:13:00,897 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:13:00,898 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:13:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:13:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-10 08:13:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-10 08:13:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1302 transitions. [2019-09-10 08:13:00,911 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1302 transitions. Word has length 103 [2019-09-10 08:13:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:00,912 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1302 transitions. [2019-09-10 08:13:00,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1302 transitions. [2019-09-10 08:13:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:13:00,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:00,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] [2019-09-10 08:13:00,914 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash 429596489, now seen corresponding path program 1 times [2019-09-10 08:13:00,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:01,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:01,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:01,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:01,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:01,124 INFO L87 Difference]: Start difference. First operand 995 states and 1302 transitions. Second operand 9 states. [2019-09-10 08:13:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:03,697 INFO L93 Difference]: Finished difference Result 1813 states and 2429 transitions. [2019-09-10 08:13:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:03,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:13:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:03,701 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:13:03,701 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:13:03,702 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:13:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:13:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-10 08:13:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-10 08:13:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1301 transitions. [2019-09-10 08:13:03,718 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1301 transitions. Word has length 103 [2019-09-10 08:13:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:03,718 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1301 transitions. [2019-09-10 08:13:03,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1301 transitions. [2019-09-10 08:13:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:13:03,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:03,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:03,721 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1112545982, now seen corresponding path program 1 times [2019-09-10 08:13:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:03,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:03,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:03,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:03,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:03,935 INFO L87 Difference]: Start difference. First operand 995 states and 1301 transitions. Second operand 9 states. [2019-09-10 08:13:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:06,281 INFO L93 Difference]: Finished difference Result 1763 states and 2345 transitions. [2019-09-10 08:13:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:06,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:13:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:06,285 INFO L225 Difference]: With dead ends: 1763 [2019-09-10 08:13:06,285 INFO L226 Difference]: Without dead ends: 1763 [2019-09-10 08:13:06,286 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:13:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-09-10 08:13:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 994. [2019-09-10 08:13:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-09-10 08:13:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1299 transitions. [2019-09-10 08:13:06,297 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1299 transitions. Word has length 103 [2019-09-10 08:13:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:06,298 INFO L475 AbstractCegarLoop]: Abstraction has 994 states and 1299 transitions. [2019-09-10 08:13:06,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1299 transitions. [2019-09-10 08:13:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:13:06,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:06,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:06,300 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -462834018, now seen corresponding path program 1 times [2019-09-10 08:13:06,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:06,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:06,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:06,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:06,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:06,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:13:06,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:06,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:06,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:06,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:06,586 INFO L87 Difference]: Start difference. First operand 994 states and 1299 transitions. Second operand 9 states. [2019-09-10 08:13:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:08,879 INFO L93 Difference]: Finished difference Result 1762 states and 2343 transitions. [2019-09-10 08:13:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:08,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:13:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:08,882 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:08,882 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:08,883 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:13:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1297 transitions. [2019-09-10 08:13:08,895 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1297 transitions. Word has length 103 [2019-09-10 08:13:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:08,895 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1297 transitions. [2019-09-10 08:13:08,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1297 transitions. [2019-09-10 08:13:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:13:08,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:08,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:08,897 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 368358430, now seen corresponding path program 1 times [2019-09-10 08:13:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:08,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:09,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:09,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:13:09,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:09,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:13:09,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:13:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:13:09,868 INFO L87 Difference]: Start difference. First operand 993 states and 1297 transitions. Second operand 17 states. [2019-09-10 08:13:10,542 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:13:10,699 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:13:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:14,856 INFO L93 Difference]: Finished difference Result 1953 states and 2598 transitions. [2019-09-10 08:13:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:13:14,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:13:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:14,859 INFO L225 Difference]: With dead ends: 1953 [2019-09-10 08:13:14,860 INFO L226 Difference]: Without dead ends: 1953 [2019-09-10 08:13:14,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:13:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-10 08:13:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 993. [2019-09-10 08:13:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1295 transitions. [2019-09-10 08:13:14,871 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1295 transitions. Word has length 103 [2019-09-10 08:13:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:14,872 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1295 transitions. [2019-09-10 08:13:14,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:13:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1295 transitions. [2019-09-10 08:13:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:14,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:14,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:14,875 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1453139291, now seen corresponding path program 1 times [2019-09-10 08:13:14,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:14,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:15,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:15,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:15,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:15,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:15,093 INFO L87 Difference]: Start difference. First operand 993 states and 1295 transitions. Second operand 9 states. [2019-09-10 08:13:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:17,446 INFO L93 Difference]: Finished difference Result 1762 states and 2339 transitions. [2019-09-10 08:13:17,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:17,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:17,449 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:17,449 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:17,450 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:13:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1293 transitions. [2019-09-10 08:13:17,461 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1293 transitions. Word has length 104 [2019-09-10 08:13:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:17,461 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1293 transitions. [2019-09-10 08:13:17,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1293 transitions. [2019-09-10 08:13:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:17,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:17,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:17,464 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash -872187749, now seen corresponding path program 1 times [2019-09-10 08:13:17,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:17,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:17,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:17,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:17,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:17,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:17,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:17,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:17,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:17,678 INFO L87 Difference]: Start difference. First operand 993 states and 1293 transitions. Second operand 9 states. [2019-09-10 08:13:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:20,095 INFO L93 Difference]: Finished difference Result 1762 states and 2337 transitions. [2019-09-10 08:13:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:20,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:20,098 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:20,098 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:20,099 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:13:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1291 transitions. [2019-09-10 08:13:20,110 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1291 transitions. Word has length 104 [2019-09-10 08:13:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:20,110 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1291 transitions. [2019-09-10 08:13:20,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1291 transitions. [2019-09-10 08:13:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:20,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:20,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:20,113 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:20,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1637494085, now seen corresponding path program 1 times [2019-09-10 08:13:20,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:20,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:20,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:20,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:20,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:20,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:20,361 INFO L87 Difference]: Start difference. First operand 993 states and 1291 transitions. Second operand 9 states. [2019-09-10 08:13:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:22,628 INFO L93 Difference]: Finished difference Result 1762 states and 2333 transitions. [2019-09-10 08:13:22,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:22,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:22,631 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:22,631 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:22,632 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:13:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1289 transitions. [2019-09-10 08:13:22,643 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1289 transitions. Word has length 104 [2019-09-10 08:13:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:22,644 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1289 transitions. [2019-09-10 08:13:22,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1289 transitions. [2019-09-10 08:13:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:22,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:22,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:22,646 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash -18959589, now seen corresponding path program 1 times [2019-09-10 08:13:22,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:22,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:22,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:22,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:22,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:22,856 INFO L87 Difference]: Start difference. First operand 993 states and 1289 transitions. Second operand 9 states. [2019-09-10 08:13:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:25,203 INFO L93 Difference]: Finished difference Result 1762 states and 2331 transitions. [2019-09-10 08:13:25,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:25,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:25,205 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:25,206 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:25,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:13:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1287 transitions. [2019-09-10 08:13:25,220 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1287 transitions. Word has length 104 [2019-09-10 08:13:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:25,220 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1287 transitions. [2019-09-10 08:13:25,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1287 transitions. [2019-09-10 08:13:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:25,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:25,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:25,223 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 988410427, now seen corresponding path program 1 times [2019-09-10 08:13:25,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:25,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:25,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:25,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:25,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:25,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:25,424 INFO L87 Difference]: Start difference. First operand 993 states and 1287 transitions. Second operand 9 states. [2019-09-10 08:13:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:27,756 INFO L93 Difference]: Finished difference Result 1762 states and 2330 transitions. [2019-09-10 08:13:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:27,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:27,759 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:27,759 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:27,760 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:13:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1286 transitions. [2019-09-10 08:13:27,775 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1286 transitions. Word has length 104 [2019-09-10 08:13:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:27,775 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1286 transitions. [2019-09-10 08:13:27,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1286 transitions. [2019-09-10 08:13:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:27,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:27,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:27,778 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash -803008197, now seen corresponding path program 1 times [2019-09-10 08:13:27,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:27,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:27,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:27,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:27,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:27,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:27,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:27,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:27,983 INFO L87 Difference]: Start difference. First operand 993 states and 1286 transitions. Second operand 9 states. [2019-09-10 08:13:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:30,335 INFO L93 Difference]: Finished difference Result 1762 states and 2329 transitions. [2019-09-10 08:13:30,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:30,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:30,338 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:30,338 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:30,339 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:13:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1285 transitions. [2019-09-10 08:13:30,351 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1285 transitions. Word has length 104 [2019-09-10 08:13:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:30,351 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1285 transitions. [2019-09-10 08:13:30,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1285 transitions. [2019-09-10 08:13:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:30,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:30,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:30,353 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1451697275, now seen corresponding path program 1 times [2019-09-10 08:13:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:30,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:30,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:30,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:30,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:30,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:30,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:30,624 INFO L87 Difference]: Start difference. First operand 993 states and 1285 transitions. Second operand 9 states. [2019-09-10 08:13:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:33,026 INFO L93 Difference]: Finished difference Result 1810 states and 2407 transitions. [2019-09-10 08:13:33,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:33,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:33,029 INFO L225 Difference]: With dead ends: 1810 [2019-09-10 08:13:33,030 INFO L226 Difference]: Without dead ends: 1810 [2019-09-10 08:13:33,030 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:13:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-09-10 08:13:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 993. [2019-09-10 08:13:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1284 transitions. [2019-09-10 08:13:33,045 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1284 transitions. Word has length 104 [2019-09-10 08:13:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:33,045 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1284 transitions. [2019-09-10 08:13:33,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1284 transitions. [2019-09-10 08:13:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:33,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:33,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:33,047 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -369299811, now seen corresponding path program 1 times [2019-09-10 08:13:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:33,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:33,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:33,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:33,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:33,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:33,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:33,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:33,287 INFO L87 Difference]: Start difference. First operand 993 states and 1284 transitions. Second operand 9 states. [2019-09-10 08:13:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:35,635 INFO L93 Difference]: Finished difference Result 1762 states and 2327 transitions. [2019-09-10 08:13:35,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:35,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:35,638 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:35,639 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:35,639 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:13:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1283 transitions. [2019-09-10 08:13:35,649 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1283 transitions. Word has length 104 [2019-09-10 08:13:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:35,650 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1283 transitions. [2019-09-10 08:13:35,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1283 transitions. [2019-09-10 08:13:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:35,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:35,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] [2019-09-10 08:13:35,651 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:35,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash -339789701, now seen corresponding path program 1 times [2019-09-10 08:13:35,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:35,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:35,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:35,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:35,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:35,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:13:35,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:35,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:35,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:35,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:35,850 INFO L87 Difference]: Start difference. First operand 993 states and 1283 transitions. Second operand 9 states. [2019-09-10 08:13:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:38,342 INFO L93 Difference]: Finished difference Result 1762 states and 2326 transitions. [2019-09-10 08:13:38,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:38,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:38,345 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:38,345 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:38,346 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:13:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1282 transitions. [2019-09-10 08:13:38,359 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1282 transitions. Word has length 104 [2019-09-10 08:13:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:38,359 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1282 transitions. [2019-09-10 08:13:38,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1282 transitions. [2019-09-10 08:13:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:38,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:38,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:38,361 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash 480435067, now seen corresponding path program 1 times [2019-09-10 08:13:38,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:38,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:38,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:13:38,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:38,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:38,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:38,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:38,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:38,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:38,558 INFO L87 Difference]: Start difference. First operand 993 states and 1282 transitions. Second operand 9 states. [2019-09-10 08:13:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:41,104 INFO L93 Difference]: Finished difference Result 1762 states and 2324 transitions. [2019-09-10 08:13:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:41,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:41,108 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:41,108 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:41,108 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:13:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1281 transitions. [2019-09-10 08:13:41,119 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1281 transitions. Word has length 104 [2019-09-10 08:13:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:41,119 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1281 transitions. [2019-09-10 08:13:41,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1281 transitions. [2019-09-10 08:13:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:41,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:41,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:41,120 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash -696828453, now seen corresponding path program 1 times [2019-09-10 08:13:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:41,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:41,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:41,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:41,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:41,322 INFO L87 Difference]: Start difference. First operand 993 states and 1281 transitions. Second operand 9 states. [2019-09-10 08:13:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:43,441 INFO L93 Difference]: Finished difference Result 1762 states and 2322 transitions. [2019-09-10 08:13:43,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:43,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:43,444 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 08:13:43,444 INFO L226 Difference]: Without dead ends: 1762 [2019-09-10 08:13:43,445 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:13:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-10 08:13:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-10 08:13:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 08:13:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1280 transitions. [2019-09-10 08:13:43,455 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1280 transitions. Word has length 104 [2019-09-10 08:13:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:43,455 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1280 transitions. [2019-09-10 08:13:43,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1280 transitions. [2019-09-10 08:13:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:43,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:43,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:43,457 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1221610680, now seen corresponding path program 1 times [2019-09-10 08:13:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:43,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:43,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:44,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:44,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:13:44,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:44,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:13:44,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:13:44,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:13:44,726 INFO L87 Difference]: Start difference. First operand 993 states and 1280 transitions. Second operand 20 states. [2019-09-10 08:13:44,992 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 08:13:45,321 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:13:45,500 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-10 08:13:45,725 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:13:45,955 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:13:46,235 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 08:13:46,682 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:13:47,074 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-09-10 08:13:47,402 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 08:13:47,718 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 08:13:48,172 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 08:13:48,604 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-10 08:13:49,016 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:13:49,342 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:13:49,597 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 08:13:50,081 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 08:13:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:54,550 INFO L93 Difference]: Finished difference Result 1700 states and 2165 transitions. [2019-09-10 08:13:54,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:13:54,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-10 08:13:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:54,555 INFO L225 Difference]: With dead ends: 1700 [2019-09-10 08:13:54,555 INFO L226 Difference]: Without dead ends: 1697 [2019-09-10 08:13:54,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:13:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-10 08:13:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 988. [2019-09-10 08:13:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:13:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1274 transitions. [2019-09-10 08:13:54,569 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1274 transitions. Word has length 104 [2019-09-10 08:13:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:54,569 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1274 transitions. [2019-09-10 08:13:54,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:13:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1274 transitions. [2019-09-10 08:13:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:54,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:54,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:54,571 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1817218209, now seen corresponding path program 1 times [2019-09-10 08:13:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:54,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:54,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:54,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:54,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:54,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:54,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:54,808 INFO L87 Difference]: Start difference. First operand 988 states and 1274 transitions. Second operand 9 states. [2019-09-10 08:13:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:57,198 INFO L93 Difference]: Finished difference Result 1805 states and 2394 transitions. [2019-09-10 08:13:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:57,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:13:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:57,202 INFO L225 Difference]: With dead ends: 1805 [2019-09-10 08:13:57,202 INFO L226 Difference]: Without dead ends: 1805 [2019-09-10 08:13:57,202 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:13:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-10 08:13:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-10 08:13:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:13:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1273 transitions. [2019-09-10 08:13:57,220 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1273 transitions. Word has length 104 [2019-09-10 08:13:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:57,221 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1273 transitions. [2019-09-10 08:13:57,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1273 transitions. [2019-09-10 08:13:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:13:57,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:57,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:57,223 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 796878734, now seen corresponding path program 1 times [2019-09-10 08:13:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:57,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:57,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:57,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:57,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:57,481 INFO L87 Difference]: Start difference. First operand 988 states and 1273 transitions. Second operand 9 states. [2019-09-10 08:13:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:59,765 INFO L93 Difference]: Finished difference Result 1757 states and 2313 transitions. [2019-09-10 08:13:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:59,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:13:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:59,771 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:13:59,772 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:13:59,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:13:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:13:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:13:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:13:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1271 transitions. [2019-09-10 08:13:59,784 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1271 transitions. Word has length 105 [2019-09-10 08:13:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:59,784 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1271 transitions. [2019-09-10 08:13:59,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1271 transitions. [2019-09-10 08:13:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:13:59,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:59,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] [2019-09-10 08:13:59,787 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 585181006, now seen corresponding path program 1 times [2019-09-10 08:13:59,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:59,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:59,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:00,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:00,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:00,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:00,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:00,022 INFO L87 Difference]: Start difference. First operand 988 states and 1271 transitions. Second operand 9 states. [2019-09-10 08:14:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:02,579 INFO L93 Difference]: Finished difference Result 1829 states and 2422 transitions. [2019-09-10 08:14:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:02,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:02,582 INFO L225 Difference]: With dead ends: 1829 [2019-09-10 08:14:02,583 INFO L226 Difference]: Without dead ends: 1829 [2019-09-10 08:14:02,583 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:14:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-09-10 08:14:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 988. [2019-09-10 08:14:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1269 transitions. [2019-09-10 08:14:02,595 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1269 transitions. Word has length 105 [2019-09-10 08:14:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:02,595 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1269 transitions. [2019-09-10 08:14:02,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1269 transitions. [2019-09-10 08:14:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:02,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:02,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:02,597 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 126959758, now seen corresponding path program 1 times [2019-09-10 08:14:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:02,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:02,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:02,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:14:02,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:02,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:02,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:02,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:02,803 INFO L87 Difference]: Start difference. First operand 988 states and 1269 transitions. Second operand 9 states. [2019-09-10 08:14:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:05,258 INFO L93 Difference]: Finished difference Result 1805 states and 2386 transitions. [2019-09-10 08:14:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:05,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:05,262 INFO L225 Difference]: With dead ends: 1805 [2019-09-10 08:14:05,262 INFO L226 Difference]: Without dead ends: 1805 [2019-09-10 08:14:05,262 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:14:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-10 08:14:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-10 08:14:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1267 transitions. [2019-09-10 08:14:05,273 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1267 transitions. Word has length 105 [2019-09-10 08:14:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:05,273 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1267 transitions. [2019-09-10 08:14:05,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1267 transitions. [2019-09-10 08:14:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:05,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:05,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:05,275 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -705523346, now seen corresponding path program 1 times [2019-09-10 08:14:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:05,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:05,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:05,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:05,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:05,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:05,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:05,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:05,473 INFO L87 Difference]: Start difference. First operand 988 states and 1267 transitions. Second operand 9 states. [2019-09-10 08:14:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:07,920 INFO L93 Difference]: Finished difference Result 1757 states and 2307 transitions. [2019-09-10 08:14:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:07,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:07,925 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:07,926 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:07,926 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:14:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1265 transitions. [2019-09-10 08:14:07,940 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1265 transitions. Word has length 105 [2019-09-10 08:14:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:07,941 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1265 transitions. [2019-09-10 08:14:07,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1265 transitions. [2019-09-10 08:14:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:07,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:07,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:07,946 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1644071758, now seen corresponding path program 1 times [2019-09-10 08:14:07,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:07,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:07,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:07,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:08,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:08,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:08,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:08,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:08,172 INFO L87 Difference]: Start difference. First operand 988 states and 1265 transitions. Second operand 9 states. [2019-09-10 08:14:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:10,605 INFO L93 Difference]: Finished difference Result 1757 states and 2303 transitions. [2019-09-10 08:14:10,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:10,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:10,608 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:10,608 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14: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:14:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1263 transitions. [2019-09-10 08:14:10,618 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1263 transitions. Word has length 105 [2019-09-10 08:14:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:10,619 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1263 transitions. [2019-09-10 08:14:10,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1263 transitions. [2019-09-10 08:14:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:10,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:10,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:10,620 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash -916618386, now seen corresponding path program 1 times [2019-09-10 08:14:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:10,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:10,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:10,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:10,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:10,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:10,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:10,806 INFO L87 Difference]: Start difference. First operand 988 states and 1263 transitions. Second operand 9 states. [2019-09-10 08:14:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:13,112 INFO L93 Difference]: Finished difference Result 1757 states and 2301 transitions. [2019-09-10 08:14:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:13,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:13,115 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:13,115 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:13,116 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:14:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1261 transitions. [2019-09-10 08:14:13,127 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1261 transitions. Word has length 105 [2019-09-10 08:14:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:13,127 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1261 transitions. [2019-09-10 08:14:13,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1261 transitions. [2019-09-10 08:14:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:13,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:13,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:13,129 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1550934542, now seen corresponding path program 1 times [2019-09-10 08:14:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:13,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:13,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:13,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:13,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:13,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:13,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:13,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:13,329 INFO L87 Difference]: Start difference. First operand 988 states and 1261 transitions. Second operand 9 states. [2019-09-10 08:14:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:15,637 INFO L93 Difference]: Finished difference Result 1805 states and 2372 transitions. [2019-09-10 08:14:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:15,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:15,640 INFO L225 Difference]: With dead ends: 1805 [2019-09-10 08:14:15,640 INFO L226 Difference]: Without dead ends: 1805 [2019-09-10 08:14:15,640 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:14:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-10 08:14:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-10 08:14:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1259 transitions. [2019-09-10 08:14:15,651 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1259 transitions. Word has length 105 [2019-09-10 08:14:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:15,652 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1259 transitions. [2019-09-10 08:14:15,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1259 transitions. [2019-09-10 08:14:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:15,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:15,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:15,653 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash -825223794, now seen corresponding path program 1 times [2019-09-10 08:14:15,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:15,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:15,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:15,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:15,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:15,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:15,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:15,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:15,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:15,813 INFO L87 Difference]: Start difference. First operand 988 states and 1259 transitions. Second operand 9 states. [2019-09-10 08:14:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:18,323 INFO L93 Difference]: Finished difference Result 1757 states and 2295 transitions. [2019-09-10 08:14:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:18,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:18,325 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:18,325 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:18,326 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:14:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1257 transitions. [2019-09-10 08:14:18,343 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1257 transitions. Word has length 105 [2019-09-10 08:14:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:18,343 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1257 transitions. [2019-09-10 08:14:18,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1257 transitions. [2019-09-10 08:14:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:18,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:18,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:18,345 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -180694834, now seen corresponding path program 1 times [2019-09-10 08:14:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:18,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:18,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:18,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:18,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:18,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:18,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:18,516 INFO L87 Difference]: Start difference. First operand 988 states and 1257 transitions. Second operand 9 states. [2019-09-10 08:14:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:20,654 INFO L93 Difference]: Finished difference Result 1757 states and 2291 transitions. [2019-09-10 08:14:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:20,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:20,657 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:20,657 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:20,657 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:14:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1255 transitions. [2019-09-10 08:14:20,670 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1255 transitions. Word has length 105 [2019-09-10 08:14:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:20,670 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1255 transitions. [2019-09-10 08:14:20,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1255 transitions. [2019-09-10 08:14:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:20,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:20,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:20,672 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1974492206, now seen corresponding path program 1 times [2019-09-10 08:14:20,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:20,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:20,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:20,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:20,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:20,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:20,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:20,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:20,866 INFO L87 Difference]: Start difference. First operand 988 states and 1255 transitions. Second operand 9 states. [2019-09-10 08:14:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:23,242 INFO L93 Difference]: Finished difference Result 1757 states and 2290 transitions. [2019-09-10 08:14:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:23,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:23,245 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:23,246 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:23,246 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:14:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1254 transitions. [2019-09-10 08:14:23,258 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1254 transitions. Word has length 105 [2019-09-10 08:14:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:23,258 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1254 transitions. [2019-09-10 08:14:23,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1254 transitions. [2019-09-10 08:14:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:23,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:23,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:23,260 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:23,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1864649998, now seen corresponding path program 1 times [2019-09-10 08:14:23,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:23,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:23,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:23,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:23,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:23,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:23,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:23,475 INFO L87 Difference]: Start difference. First operand 988 states and 1254 transitions. Second operand 9 states. [2019-09-10 08:14:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:25,982 INFO L93 Difference]: Finished difference Result 1805 states and 2362 transitions. [2019-09-10 08:14:25,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:25,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:25,986 INFO L225 Difference]: With dead ends: 1805 [2019-09-10 08:14:25,986 INFO L226 Difference]: Without dead ends: 1805 [2019-09-10 08:14:25,987 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:14:25,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-10 08:14:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-10 08:14:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1253 transitions. [2019-09-10 08:14:25,998 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1253 transitions. Word has length 105 [2019-09-10 08:14:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:25,998 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1253 transitions. [2019-09-10 08:14:25,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1253 transitions. [2019-09-10 08:14:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:26,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:26,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:26,000 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -69024242, now seen corresponding path program 1 times [2019-09-10 08:14:26,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:26,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:26,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:26,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:26,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:26,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:26,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:26,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:26,158 INFO L87 Difference]: Start difference. First operand 988 states and 1253 transitions. Second operand 9 states. [2019-09-10 08:14:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:28,717 INFO L93 Difference]: Finished difference Result 1757 states and 2287 transitions. [2019-09-10 08:14:28,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:28,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:28,721 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:28,721 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:28,721 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:14:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1252 transitions. [2019-09-10 08:14:28,733 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1252 transitions. Word has length 105 [2019-09-10 08:14:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:28,733 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1252 transitions. [2019-09-10 08:14:28,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1252 transitions. [2019-09-10 08:14:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:28,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:28,735 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:28,735 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash -387747698, now seen corresponding path program 1 times [2019-09-10 08:14:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:28,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:28,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:28,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:28,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:28,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:28,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:28,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:28,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:28,932 INFO L87 Difference]: Start difference. First operand 988 states and 1252 transitions. Second operand 9 states. [2019-09-10 08:14:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:31,379 INFO L93 Difference]: Finished difference Result 1757 states and 2285 transitions. [2019-09-10 08:14:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:31,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:31,383 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:31,383 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:31,383 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:14:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1251 transitions. [2019-09-10 08:14:31,393 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1251 transitions. Word has length 105 [2019-09-10 08:14:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:31,394 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1251 transitions. [2019-09-10 08:14:31,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1251 transitions. [2019-09-10 08:14:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:14:31,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:31,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:31,395 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1642130034, now seen corresponding path program 1 times [2019-09-10 08:14:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:31,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:31,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:31,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:31,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:31,575 INFO L87 Difference]: Start difference. First operand 988 states and 1251 transitions. Second operand 9 states. [2019-09-10 08:14:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:33,991 INFO L93 Difference]: Finished difference Result 1757 states and 2283 transitions. [2019-09-10 08:14:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:33,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:14:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:33,994 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:14:33,995 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:14:33,995 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:14:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:14:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-10 08:14:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-10 08:14:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1250 transitions. [2019-09-10 08:14:34,006 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1250 transitions. Word has length 105 [2019-09-10 08:14:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:34,006 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1250 transitions. [2019-09-10 08:14:34,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1250 transitions. [2019-09-10 08:14:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:14:34,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:34,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:34,008 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash -543142122, now seen corresponding path program 1 times [2019-09-10 08:14:34,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:34,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:34,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:35,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:35,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:14:35,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:35,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:14:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:14:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:14:35,906 INFO L87 Difference]: Start difference. First operand 988 states and 1250 transitions. Second operand 26 states. [2019-09-10 08:14:36,079 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:14:37,372 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:14:37,639 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:14:37,932 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:14:38,309 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 08:14:38,555 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:14:38,788 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:14:39,040 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:14:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:47,697 INFO L93 Difference]: Finished difference Result 1646 states and 2147 transitions. [2019-09-10 08:14:47,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:14:47,697 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-10 08:14:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:47,700 INFO L225 Difference]: With dead ends: 1646 [2019-09-10 08:14:47,700 INFO L226 Difference]: Without dead ends: 1646 [2019-09-10 08:14:47,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:14:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-09-10 08:14:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1009. [2019-09-10 08:14:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-09-10 08:14:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1277 transitions. [2019-09-10 08:14:47,710 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1277 transitions. Word has length 106 [2019-09-10 08:14:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:47,711 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1277 transitions. [2019-09-10 08:14:47,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:14:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1277 transitions. [2019-09-10 08:14:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:14:47,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:47,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:47,713 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash 128153622, now seen corresponding path program 1 times [2019-09-10 08:14:47,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:47,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:48,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:48,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:14:48,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:48,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:14:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:14:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:14:48,466 INFO L87 Difference]: Start difference. First operand 1009 states and 1277 transitions. Second operand 17 states. [2019-09-10 08:14:49,133 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:14:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:51,338 INFO L93 Difference]: Finished difference Result 1941 states and 2528 transitions. [2019-09-10 08:14:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:14:51,338 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-10 08:14:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:51,341 INFO L225 Difference]: With dead ends: 1941 [2019-09-10 08:14:51,341 INFO L226 Difference]: Without dead ends: 1941 [2019-09-10 08:14:51,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:14:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2019-09-10 08:14:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 957. [2019-09-10 08:14:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-09-10 08:14:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1208 transitions. [2019-09-10 08:14:51,351 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1208 transitions. Word has length 106 [2019-09-10 08:14:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:51,352 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1208 transitions. [2019-09-10 08:14:51,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:14:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1208 transitions. [2019-09-10 08:14:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:14:51,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:51,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:51,354 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2118591338, now seen corresponding path program 1 times [2019-09-10 08:14:51,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:51,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:51,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:52,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:14:52,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:52,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:14:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:14:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:14:52,160 INFO L87 Difference]: Start difference. First operand 957 states and 1208 transitions. Second operand 16 states. [2019-09-10 08:14:52,926 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:14:53,085 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:14:53,243 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:14:53,435 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:14:53,650 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:14:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:57,721 INFO L93 Difference]: Finished difference Result 1493 states and 1857 transitions. [2019-09-10 08:14:57,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:14:57,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-10 08:14:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:57,724 INFO L225 Difference]: With dead ends: 1493 [2019-09-10 08:14:57,724 INFO L226 Difference]: Without dead ends: 1493 [2019-09-10 08:14:57,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:14:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-09-10 08:14:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 956. [2019-09-10 08:14:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-09-10 08:14:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1206 transitions. [2019-09-10 08:14:57,735 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1206 transitions. Word has length 106 [2019-09-10 08:14:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:57,736 INFO L475 AbstractCegarLoop]: Abstraction has 956 states and 1206 transitions. [2019-09-10 08:14:57,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:14:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1206 transitions. [2019-09-10 08:14:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:14:57,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:57,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:57,737 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 715197526, now seen corresponding path program 1 times [2019-09-10 08:14:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:57,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:57,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:58,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:58,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:14:58,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:58,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:14:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:14:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:14:58,679 INFO L87 Difference]: Start difference. First operand 956 states and 1206 transitions. Second operand 17 states. [2019-09-10 08:14:59,310 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:15:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:00,619 INFO L93 Difference]: Finished difference Result 1215 states and 1571 transitions. [2019-09-10 08:15:00,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:15:00,619 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-10 08:15:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:00,621 INFO L225 Difference]: With dead ends: 1215 [2019-09-10 08:15:00,622 INFO L226 Difference]: Without dead ends: 1215 [2019-09-10 08:15:00,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:15:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-10 08:15:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 853. [2019-09-10 08:15:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-09-10 08:15:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1072 transitions. [2019-09-10 08:15:00,630 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1072 transitions. Word has length 106 [2019-09-10 08:15:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:00,631 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1072 transitions. [2019-09-10 08:15:00,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:15:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1072 transitions. [2019-09-10 08:15:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:15:00,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:00,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:00,632 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:00,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:00,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1432850954, now seen corresponding path program 1 times [2019-09-10 08:15:00,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:00,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:00,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:01,900 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-09-10 08:15:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:02,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:02,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:15:02,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:02,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:15:02,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:15:02,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:15:02,294 INFO L87 Difference]: Start difference. First operand 853 states and 1072 transitions. Second operand 25 states. [2019-09-10 08:15:02,473 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:15:03,420 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:15:03,792 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:15:04,071 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 08:15:04,394 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:15:04,603 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:15:04,796 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:15:04,989 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:15:05,158 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:15:05,379 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:15:05,643 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:15:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,651 INFO L93 Difference]: Finished difference Result 1463 states and 1871 transitions. [2019-09-10 08:15:11,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:15:11,651 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2019-09-10 08:15:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,653 INFO L225 Difference]: With dead ends: 1463 [2019-09-10 08:15:11,654 INFO L226 Difference]: Without dead ends: 1463 [2019-09-10 08:15:11,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:15:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2019-09-10 08:15:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 866. [2019-09-10 08:15:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-09-10 08:15:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1086 transitions. [2019-09-10 08:15:11,664 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1086 transitions. Word has length 106 [2019-09-10 08:15:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:11,664 INFO L475 AbstractCegarLoop]: Abstraction has 866 states and 1086 transitions. [2019-09-10 08:15:11,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:15:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2019-09-10 08:15:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:15:11,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,666 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1395534550, now seen corresponding path program 1 times [2019-09-10 08:15:11,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:12,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:12,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:15:12,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:12,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:15:12,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:15:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:12,292 INFO L87 Difference]: Start difference. First operand 866 states and 1086 transitions. Second operand 15 states. [2019-09-10 08:15:12,888 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:15:13,024 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:15:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:14,773 INFO L93 Difference]: Finished difference Result 1092 states and 1424 transitions. [2019-09-10 08:15:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:15:14,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2019-09-10 08:15:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:14,776 INFO L225 Difference]: With dead ends: 1092 [2019-09-10 08:15:14,776 INFO L226 Difference]: Without dead ends: 1092 [2019-09-10 08:15:14,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-10 08:15:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 750. [2019-09-10 08:15:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-10 08:15:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 941 transitions. [2019-09-10 08:15:14,784 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 941 transitions. Word has length 106 [2019-09-10 08:15:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:14,784 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 941 transitions. [2019-09-10 08:15:14,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:15:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 941 transitions. [2019-09-10 08:15:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:15:14,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:14,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] [2019-09-10 08:15:14,786 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:14,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:14,787 INFO L82 PathProgramCache]: Analyzing trace with hash -219637197, now seen corresponding path program 1 times [2019-09-10 08:15:14,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:14,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:14,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:14,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:14,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:15,769 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:15:15,919 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:15:16,103 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:15:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:17,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:15:17,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:17,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:15:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:15:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:15:17,501 INFO L87 Difference]: Start difference. First operand 750 states and 941 transitions. Second operand 31 states. [2019-09-10 08:15:17,737 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:15:18,914 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:15:19,102 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:15:19,597 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:15:19,907 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:15:20,252 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-10 08:15:20,663 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 08:15:21,176 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-09-10 08:15:21,469 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:15:21,744 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:15:22,066 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:15:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:29,370 INFO L93 Difference]: Finished difference Result 984 states and 1235 transitions. [2019-09-10 08:15:29,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:15:29,371 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2019-09-10 08:15:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:29,372 INFO L225 Difference]: With dead ends: 984 [2019-09-10 08:15:29,373 INFO L226 Difference]: Without dead ends: 984 [2019-09-10 08:15:29,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=475, Invalid=1975, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:15:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-10 08:15:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 761. [2019-09-10 08:15:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-10 08:15:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 957 transitions. [2019-09-10 08:15:29,380 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 957 transitions. Word has length 107 [2019-09-10 08:15:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:29,381 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 957 transitions. [2019-09-10 08:15:29,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:15:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 957 transitions. [2019-09-10 08:15:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:15:29,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:29,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:29,383 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash 294360019, now seen corresponding path program 1 times [2019-09-10 08:15:29,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:30,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:15:30,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:30,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:15:30,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:30,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:15:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:15:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:15:30,201 INFO L87 Difference]: Start difference. First operand 761 states and 957 transitions. Second operand 17 states. [2019-09-10 08:15:30,911 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:15:31,083 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:15:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:33,421 INFO L93 Difference]: Finished difference Result 1464 states and 1918 transitions. [2019-09-10 08:15:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:15:33,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-10 08:15:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:33,424 INFO L225 Difference]: With dead ends: 1464 [2019-09-10 08:15:33,424 INFO L226 Difference]: Without dead ends: 1464 [2019-09-10 08:15:33,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-09-10 08:15:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 730. [2019-09-10 08:15:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 08:15:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 913 transitions. [2019-09-10 08:15:33,433 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 913 transitions. Word has length 107 [2019-09-10 08:15:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:33,433 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 913 transitions. [2019-09-10 08:15:33,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:15:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 913 transitions. [2019-09-10 08:15:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:15:33,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:33,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:33,435 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1716120548, now seen corresponding path program 1 times [2019-09-10 08:15:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:33,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:33,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:33,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:15:33,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:33,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:15:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:15:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:33,981 INFO L87 Difference]: Start difference. First operand 730 states and 913 transitions. Second operand 12 states. [2019-09-10 08:15:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:35,259 INFO L93 Difference]: Finished difference Result 1669 states and 2247 transitions. [2019-09-10 08:15:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:15:35,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2019-09-10 08:15:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:35,262 INFO L225 Difference]: With dead ends: 1669 [2019-09-10 08:15:35,263 INFO L226 Difference]: Without dead ends: 1669 [2019-09-10 08:15:35,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:15:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-10 08:15:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 708. [2019-09-10 08:15:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-10 08:15:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 884 transitions. [2019-09-10 08:15:35,272 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 884 transitions. Word has length 107 [2019-09-10 08:15:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:35,272 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 884 transitions. [2019-09-10 08:15:35,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:15:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 884 transitions. [2019-09-10 08:15:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:15:35,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:35,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:35,274 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:35,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1681056201, now seen corresponding path program 1 times [2019-09-10 08:15:35,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:35,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:35,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:35,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:35,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:36,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:15:36,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:36,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:15:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:15:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:15:36,056 INFO L87 Difference]: Start difference. First operand 708 states and 884 transitions. Second operand 16 states. [2019-09-10 08:15:36,828 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:15:36,986 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:15:37,138 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:15:37,323 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:15:37,494 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:15:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:40,238 INFO L93 Difference]: Finished difference Result 1095 states and 1359 transitions. [2019-09-10 08:15:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:15:40,238 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2019-09-10 08:15:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:40,240 INFO L225 Difference]: With dead ends: 1095 [2019-09-10 08:15:40,241 INFO L226 Difference]: Without dead ends: 1095 [2019-09-10 08:15:40,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:15:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-09-10 08:15:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 707. [2019-09-10 08:15:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-09-10 08:15:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 882 transitions. [2019-09-10 08:15:40,248 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 882 transitions. Word has length 107 [2019-09-10 08:15:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:40,249 INFO L475 AbstractCegarLoop]: Abstraction has 707 states and 882 transitions. [2019-09-10 08:15:40,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:15:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 882 transitions. [2019-09-10 08:15:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:15:40,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:40,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:40,250 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:40,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1048990583, now seen corresponding path program 1 times [2019-09-10 08:15:40,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:40,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:40,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:41,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:15:41,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:41,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:15:41,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:41,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:15:41,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:15:41,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:15:41,065 INFO L87 Difference]: Start difference. First operand 707 states and 882 transitions. Second operand 17 states. [2019-09-10 08:15:41,854 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:15:42,022 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 08:15:42,180 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:15:42,374 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:15:42,569 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:15:42,874 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:15:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:44,431 INFO L93 Difference]: Finished difference Result 1707 states and 2289 transitions. [2019-09-10 08:15:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:15:44,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-10 08:15:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:44,434 INFO L225 Difference]: With dead ends: 1707 [2019-09-10 08:15:44,434 INFO L226 Difference]: Without dead ends: 1707 [2019-09-10 08:15:44,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:15:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-09-10 08:15:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 661. [2019-09-10 08:15:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-10 08:15:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 824 transitions. [2019-09-10 08:15:44,443 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 824 transitions. Word has length 107 [2019-09-10 08:15:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:44,443 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 824 transitions. [2019-09-10 08:15:44,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:15:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 824 transitions. [2019-09-10 08:15:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:15:44,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:44,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:44,445 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1429007226, now seen corresponding path program 1 times [2019-09-10 08:15:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:44,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:44,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:44,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:44,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:15:44,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:44,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:15:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:15:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:15:44,853 INFO L87 Difference]: Start difference. First operand 661 states and 824 transitions. Second operand 11 states. [2019-09-10 08:15:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:46,188 INFO L93 Difference]: Finished difference Result 1209 states and 1576 transitions. [2019-09-10 08:15:46,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:46,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 107 [2019-09-10 08:15:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:46,190 INFO L225 Difference]: With dead ends: 1209 [2019-09-10 08:15:46,190 INFO L226 Difference]: Without dead ends: 1209 [2019-09-10 08:15:46,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-09-10 08:15:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 522. [2019-09-10 08:15:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-09-10 08:15:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 654 transitions. [2019-09-10 08:15:46,197 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 654 transitions. Word has length 107 [2019-09-10 08:15:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:46,197 INFO L475 AbstractCegarLoop]: Abstraction has 522 states and 654 transitions. [2019-09-10 08:15:46,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:15:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 654 transitions. [2019-09-10 08:15:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:15:46,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:46,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:46,198 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:46,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:46,198 INFO L82 PathProgramCache]: Analyzing trace with hash 47871049, now seen corresponding path program 1 times [2019-09-10 08:15:46,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:46,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:46,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:46,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:46,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:46,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:46,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:15:46,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:46,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:15:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:15:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:15:46,579 INFO L87 Difference]: Start difference. First operand 522 states and 654 transitions. Second operand 11 states. [2019-09-10 08:15:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:47,718 INFO L93 Difference]: Finished difference Result 964 states and 1243 transitions. [2019-09-10 08:15:47,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:15:47,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2019-09-10 08:15:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:47,720 INFO L225 Difference]: With dead ends: 964 [2019-09-10 08:15:47,720 INFO L226 Difference]: Without dead ends: 964 [2019-09-10 08:15:47,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:15:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-10 08:15:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 505. [2019-09-10 08:15:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:15:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 632 transitions. [2019-09-10 08:15:47,726 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 632 transitions. Word has length 108 [2019-09-10 08:15:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:47,726 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 632 transitions. [2019-09-10 08:15:47,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:15:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 632 transitions. [2019-09-10 08:15:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:15:47,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:47,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:47,728 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2055568258, now seen corresponding path program 1 times [2019-09-10 08:15:47,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:47,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:47,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:47,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:48,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:15:48,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:15:48,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:48,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:15:48,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:15:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:15:48,384 INFO L87 Difference]: Start difference. First operand 505 states and 632 transitions. Second operand 13 states. [2019-09-10 08:15:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:50,574 INFO L93 Difference]: Finished difference Result 2415 states and 3367 transitions. [2019-09-10 08:15:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:15:50,575 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-10 08:15:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:50,578 INFO L225 Difference]: With dead ends: 2415 [2019-09-10 08:15:50,579 INFO L226 Difference]: Without dead ends: 2415 [2019-09-10 08:15:50,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2019-09-10 08:15:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 459. [2019-09-10 08:15:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-09-10 08:15:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 571 transitions. [2019-09-10 08:15:50,590 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 571 transitions. Word has length 108 [2019-09-10 08:15:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:50,590 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 571 transitions. [2019-09-10 08:15:50,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:15:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 571 transitions. [2019-09-10 08:15:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:15:50,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:50,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:50,591 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1742987955, now seen corresponding path program 1 times [2019-09-10 08:15:50,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:50,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:51,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:51,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:15:51,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:51,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:15:51,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:15:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:51,863 INFO L87 Difference]: Start difference. First operand 459 states and 571 transitions. Second operand 21 states. [2019-09-10 08:15:52,983 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 08:15:53,282 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 08:15:53,485 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:15:53,672 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:15:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:54,916 INFO L93 Difference]: Finished difference Result 539 states and 658 transitions. [2019-09-10 08:15:54,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:15:54,916 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-10 08:15:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:54,918 INFO L225 Difference]: With dead ends: 539 [2019-09-10 08:15:54,918 INFO L226 Difference]: Without dead ends: 539 [2019-09-10 08:15:54,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:15:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-10 08:15:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 484. [2019-09-10 08:15:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-10 08:15:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 601 transitions. [2019-09-10 08:15:54,925 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 601 transitions. Word has length 108 [2019-09-10 08:15:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:54,925 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 601 transitions. [2019-09-10 08:15:54,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:15:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 601 transitions. [2019-09-10 08:15:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:15:54,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:54,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:54,927 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1038357806, now seen corresponding path program 1 times [2019-09-10 08:15:54,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:54,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:54,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:54,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:55,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:55,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:15:55,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:55,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:15:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:15:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:15:55,725 INFO L87 Difference]: Start difference. First operand 484 states and 601 transitions. Second operand 16 states. [2019-09-10 08:15:56,476 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:15:56,638 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:15:56,788 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:15:56,974 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:15:57,137 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-10 08:15:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:58,243 INFO L93 Difference]: Finished difference Result 796 states and 997 transitions. [2019-09-10 08:15:58,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:15:58,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:15:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:58,246 INFO L225 Difference]: With dead ends: 796 [2019-09-10 08:15:58,246 INFO L226 Difference]: Without dead ends: 796 [2019-09-10 08:15:58,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:15:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-10 08:15:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 491. [2019-09-10 08:15:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-10 08:15:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2019-09-10 08:15:58,252 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 108 [2019-09-10 08:15:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:58,252 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2019-09-10 08:15:58,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:15:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2019-09-10 08:15:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:15:58,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:58,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:58,253 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash 109917810, now seen corresponding path program 1 times [2019-09-10 08:15:58,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:58,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:58,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:59,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:59,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:15:59,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:59,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:15:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:15:59,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:59,390 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 21 states. [2019-09-10 08:16:00,477 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:16:00,765 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:16:00,944 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:16:01,105 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:16:01,265 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:16:01,671 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:16:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:03,704 INFO L93 Difference]: Finished difference Result 999 states and 1280 transitions. [2019-09-10 08:16:03,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:16:03,704 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-10 08:16:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:03,706 INFO L225 Difference]: With dead ends: 999 [2019-09-10 08:16:03,706 INFO L226 Difference]: Without dead ends: 999 [2019-09-10 08:16:03,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:16:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-10 08:16:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 491. [2019-09-10 08:16:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-10 08:16:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 609 transitions. [2019-09-10 08:16:03,712 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 609 transitions. Word has length 108 [2019-09-10 08:16:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:03,712 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 609 transitions. [2019-09-10 08:16:03,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:16:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 609 transitions. [2019-09-10 08:16:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:16:03,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:03,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:03,713 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1668741492, now seen corresponding path program 1 times [2019-09-10 08:16:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:03,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:03,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:04,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:04,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:16:04,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:04,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:16:04,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:16:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:16:04,178 INFO L87 Difference]: Start difference. First operand 491 states and 609 transitions. Second operand 13 states. [2019-09-10 08:16:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:05,058 INFO L93 Difference]: Finished difference Result 830 states and 1099 transitions. [2019-09-10 08:16:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:05,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-10 08:16:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:05,059 INFO L225 Difference]: With dead ends: 830 [2019-09-10 08:16:05,059 INFO L226 Difference]: Without dead ends: 830 [2019-09-10 08:16:05,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:16:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-09-10 08:16:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 412. [2019-09-10 08:16:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-10 08:16:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 518 transitions. [2019-09-10 08:16:05,064 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 518 transitions. Word has length 108 [2019-09-10 08:16:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:05,064 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 518 transitions. [2019-09-10 08:16:05,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:16:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 518 transitions. [2019-09-10 08:16:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:16:05,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:05,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:05,065 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 881258931, now seen corresponding path program 1 times [2019-09-10 08:16:05,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:05,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:05,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:05,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:05,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:05,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:05,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:05,265 INFO L87 Difference]: Start difference. First operand 412 states and 518 transitions. Second operand 9 states. [2019-09-10 08:16:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:06,259 INFO L93 Difference]: Finished difference Result 914 states and 1241 transitions. [2019-09-10 08:16:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:06,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-09-10 08:16:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:06,260 INFO L225 Difference]: With dead ends: 914 [2019-09-10 08:16:06,261 INFO L226 Difference]: Without dead ends: 914 [2019-09-10 08:16:06,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-10 08:16:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 412. [2019-09-10 08:16:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-10 08:16:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 516 transitions. [2019-09-10 08:16:06,266 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 516 transitions. Word has length 109 [2019-09-10 08:16:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:06,266 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 516 transitions. [2019-09-10 08:16:06,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 516 transitions. [2019-09-10 08:16:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:16:06,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:06,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:06,267 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1509496907, now seen corresponding path program 1 times [2019-09-10 08:16:06,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:06,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:06,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:06,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:06,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:06,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:06,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:06,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:06,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:06,980 INFO L87 Difference]: Start difference. First operand 412 states and 516 transitions. Second operand 16 states. [2019-09-10 08:16:07,733 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:16:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:08,606 INFO L93 Difference]: Finished difference Result 779 states and 1034 transitions. [2019-09-10 08:16:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:16:08,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2019-09-10 08:16:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:08,607 INFO L225 Difference]: With dead ends: 779 [2019-09-10 08:16:08,607 INFO L226 Difference]: Without dead ends: 779 [2019-09-10 08:16:08,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:16:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-10 08:16:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 399. [2019-09-10 08:16:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-10 08:16:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 498 transitions. [2019-09-10 08:16:08,611 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 498 transitions. Word has length 109 [2019-09-10 08:16:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:08,612 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 498 transitions. [2019-09-10 08:16:08,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 498 transitions. [2019-09-10 08:16:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:16:08,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:08,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:08,613 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 586876888, now seen corresponding path program 1 times [2019-09-10 08:16:08,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:08,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:08,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:08,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:09,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:09,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:16:09,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:09,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:16:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:16:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:16:09,010 INFO L87 Difference]: Start difference. First operand 399 states and 498 transitions. Second operand 12 states. [2019-09-10 08:16:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:09,961 INFO L93 Difference]: Finished difference Result 1046 states and 1389 transitions. [2019-09-10 08:16:09,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:16:09,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2019-09-10 08:16:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:09,963 INFO L225 Difference]: With dead ends: 1046 [2019-09-10 08:16:09,963 INFO L226 Difference]: Without dead ends: 1046 [2019-09-10 08:16:09,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:16:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-09-10 08:16:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 336. [2019-09-10 08:16:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 08:16:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 425 transitions. [2019-09-10 08:16:09,969 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 425 transitions. Word has length 109 [2019-09-10 08:16:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:09,969 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 425 transitions. [2019-09-10 08:16:09,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:16:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 425 transitions. [2019-09-10 08:16:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:16:09,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:09,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:09,971 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2070234167, now seen corresponding path program 1 times [2019-09-10 08:16:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:09,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:09,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:10,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:10,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:10,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:10,126 INFO L87 Difference]: Start difference. First operand 336 states and 425 transitions. Second operand 9 states. [2019-09-10 08:16:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:10,784 INFO L93 Difference]: Finished difference Result 524 states and 689 transitions. [2019-09-10 08:16:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:16:10,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-10 08:16:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:10,786 INFO L225 Difference]: With dead ends: 524 [2019-09-10 08:16:10,786 INFO L226 Difference]: Without dead ends: 524 [2019-09-10 08:16:10,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:16:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-10 08:16:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 336. [2019-09-10 08:16:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 08:16:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 424 transitions. [2019-09-10 08:16:10,792 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 424 transitions. Word has length 110 [2019-09-10 08:16:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:10,792 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 424 transitions. [2019-09-10 08:16:10,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 424 transitions. [2019-09-10 08:16:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:16:10,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:10,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:10,793 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1677363192, now seen corresponding path program 1 times [2019-09-10 08:16:10,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:10,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:10,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:12,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:12,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:16:12,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:12,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:16:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:16:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:16:12,889 INFO L87 Difference]: Start difference. First operand 336 states and 424 transitions. Second operand 31 states. [2019-09-10 08:16:13,070 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 08:16:14,540 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-10 08:16:14,788 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:16:15,057 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-09-10 08:16:15,375 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-09-10 08:16:15,756 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2019-09-10 08:16:16,017 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 08:16:16,275 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 08:16:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:21,958 INFO L93 Difference]: Finished difference Result 1227 states and 1688 transitions. [2019-09-10 08:16:21,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:16:21,959 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 111 [2019-09-10 08:16:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:21,961 INFO L225 Difference]: With dead ends: 1227 [2019-09-10 08:16:21,961 INFO L226 Difference]: Without dead ends: 1227 [2019-09-10 08:16:21,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 08:16:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-10 08:16:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 362. [2019-09-10 08:16:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-10 08:16:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 455 transitions. [2019-09-10 08:16:21,968 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 455 transitions. Word has length 111 [2019-09-10 08:16:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:21,968 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 455 transitions. [2019-09-10 08:16:21,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:16:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 455 transitions. [2019-09-10 08:16:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:16:21,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:21,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:21,969 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:21,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1816444114, now seen corresponding path program 1 times [2019-09-10 08:16:21,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:21,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:21,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:21,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:21,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:22,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:22,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:16:22,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:22,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:16:22,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:16:22,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:16:22,748 INFO L87 Difference]: Start difference. First operand 362 states and 455 transitions. Second operand 13 states. [2019-09-10 08:16:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:23,857 INFO L93 Difference]: Finished difference Result 1246 states and 1720 transitions. [2019-09-10 08:16:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:16:23,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-09-10 08:16:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:23,860 INFO L225 Difference]: With dead ends: 1246 [2019-09-10 08:16:23,860 INFO L226 Difference]: Without dead ends: 1246 [2019-09-10 08:16:23,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:16:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-09-10 08:16:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 342. [2019-09-10 08:16:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-10 08:16:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 433 transitions. [2019-09-10 08:16:23,869 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 433 transitions. Word has length 112 [2019-09-10 08:16:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:23,869 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 433 transitions. [2019-09-10 08:16:23,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:16:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 433 transitions. [2019-09-10 08:16:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:16:23,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:23,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:23,870 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash 613951943, now seen corresponding path program 1 times [2019-09-10 08:16:23,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:23,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:23,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:25,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:25,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:16:25,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:25,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:16:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:16:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:16:25,984 INFO L87 Difference]: Start difference. First operand 342 states and 433 transitions. Second operand 26 states. [2019-09-10 08:16:26,180 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-10 08:16:27,583 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-09-10 08:16:27,836 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-09-10 08:16:28,102 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 55 [2019-09-10 08:16:28,455 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 81 [2019-09-10 08:16:28,752 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 08:16:29,023 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 08:16:29,198 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 08:16:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:31,326 INFO L93 Difference]: Finished difference Result 694 states and 934 transitions. [2019-09-10 08:16:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:16:31,326 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2019-09-10 08:16:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:31,328 INFO L225 Difference]: With dead ends: 694 [2019-09-10 08:16:31,328 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 08:16:31,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:16:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 08:16:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 343. [2019-09-10 08:16:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-10 08:16:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 434 transitions. [2019-09-10 08:16:31,334 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 434 transitions. Word has length 112 [2019-09-10 08:16:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:31,334 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 434 transitions. [2019-09-10 08:16:31,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:16:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 434 transitions. [2019-09-10 08:16:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:16:31,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:31,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:31,335 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash 776700875, now seen corresponding path program 1 times [2019-09-10 08:16:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:31,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:31,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:32,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:32,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:16:32,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:32,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:16:32,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:16:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:32,546 INFO L87 Difference]: Start difference. First operand 343 states and 434 transitions. Second operand 21 states. [2019-09-10 08:16:33,676 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:16:33,939 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:16:34,113 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:16:34,285 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:16:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:35,419 INFO L93 Difference]: Finished difference Result 683 states and 922 transitions. [2019-09-10 08:16:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:16:35,421 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2019-09-10 08:16:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:35,422 INFO L225 Difference]: With dead ends: 683 [2019-09-10 08:16:35,422 INFO L226 Difference]: Without dead ends: 683 [2019-09-10 08:16:35,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:16:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-10 08:16:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 344. [2019-09-10 08:16:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-10 08:16:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 435 transitions. [2019-09-10 08:16:35,428 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 435 transitions. Word has length 112 [2019-09-10 08:16:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:35,428 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 435 transitions. [2019-09-10 08:16:35,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:16:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 435 transitions. [2019-09-10 08:16:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:16:35,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:35,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] [2019-09-10 08:16:35,429 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -237845360, now seen corresponding path program 1 times [2019-09-10 08:16:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:35,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:35,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:36,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:36,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:36,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:36,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:36,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:36,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:36,244 INFO L87 Difference]: Start difference. First operand 344 states and 435 transitions. Second operand 16 states. [2019-09-10 08:16:36,982 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:16:37,129 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:16:37,268 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:16:37,445 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:16:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:38,578 INFO L93 Difference]: Finished difference Result 1156 states and 1612 transitions. [2019-09-10 08:16:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:16:38,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2019-09-10 08:16:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:38,580 INFO L225 Difference]: With dead ends: 1156 [2019-09-10 08:16:38,580 INFO L226 Difference]: Without dead ends: 1156 [2019-09-10 08:16:38,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:16:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-09-10 08:16:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 316. [2019-09-10 08:16:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 08:16:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 401 transitions. [2019-09-10 08:16:38,585 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 401 transitions. Word has length 112 [2019-09-10 08:16:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:38,585 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 401 transitions. [2019-09-10 08:16:38,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 401 transitions. [2019-09-10 08:16:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:16:38,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:38,586 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:38,586 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -285569651, now seen corresponding path program 1 times [2019-09-10 08:16:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:38,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:41,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:16:41,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 08:16:41,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:41,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:16:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:16:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:16:41,012 INFO L87 Difference]: Start difference. First operand 316 states and 401 transitions. Second operand 29 states. [2019-09-10 08:16:41,270 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:16:41,883 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 08:16:42,054 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-09-10 08:16:42,285 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:16:42,820 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:16:43,017 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:16:43,264 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:16:43,550 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:16:43,900 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 08:16:44,315 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:16:44,552 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:16:44,789 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 08:16:44,990 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:16:45,341 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:16:45,738 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:16:46,938 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 08:16:47,202 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:16:47,523 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 08:16:48,951 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:16:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:55,716 INFO L93 Difference]: Finished difference Result 2376 states and 3317 transitions. [2019-09-10 08:16:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:16:55,716 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2019-09-10 08:16:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:55,718 INFO L225 Difference]: With dead ends: 2376 [2019-09-10 08:16:55,719 INFO L226 Difference]: Without dead ends: 2376 [2019-09-10 08:16:55,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 08:16:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-09-10 08:16:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 341. [2019-09-10 08:16:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-10 08:16:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 431 transitions. [2019-09-10 08:16:55,727 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 431 transitions. Word has length 112 [2019-09-10 08:16:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:55,728 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 431 transitions. [2019-09-10 08:16:55,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:16:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 431 transitions. [2019-09-10 08:16:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:16:55,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:55,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:55,728 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -310268750, now seen corresponding path program 1 times [2019-09-10 08:16:55,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:55,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:56,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:56,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:16:56,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:56,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:16:56,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:16:56,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:16:56,378 INFO L87 Difference]: Start difference. First operand 341 states and 431 transitions. Second operand 13 states. [2019-09-10 08:16:56,928 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 08:16:57,062 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 08:16:57,475 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-09-10 08:16:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:58,069 INFO L93 Difference]: Finished difference Result 1461 states and 2059 transitions. [2019-09-10 08:16:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:16:58,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2019-09-10 08:16:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:58,072 INFO L225 Difference]: With dead ends: 1461 [2019-09-10 08:16:58,072 INFO L226 Difference]: Without dead ends: 1461 [2019-09-10 08:16:58,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-09-10 08:16:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 310. [2019-09-10 08:16:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-10 08:16:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 395 transitions. [2019-09-10 08:16:58,079 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 395 transitions. Word has length 113 [2019-09-10 08:16:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:58,080 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 395 transitions. [2019-09-10 08:16:58,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:16:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 395 transitions. [2019-09-10 08:16:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:16:58,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:58,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:58,081 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 846487170, now seen corresponding path program 1 times [2019-09-10 08:16:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:58,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:58,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:58,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:58,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:58,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:58,195 INFO L87 Difference]: Start difference. First operand 310 states and 395 transitions. Second operand 3 states. [2019-09-10 08:16:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:58,242 INFO L93 Difference]: Finished difference Result 450 states and 597 transitions. [2019-09-10 08:16:58,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:58,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:16:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:58,243 INFO L225 Difference]: With dead ends: 450 [2019-09-10 08:16:58,244 INFO L226 Difference]: Without dead ends: 450 [2019-09-10 08:16:58,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-10 08:16:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-09-10 08:16:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-10 08:16:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 596 transitions. [2019-09-10 08:16:58,249 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 596 transitions. Word has length 144 [2019-09-10 08:16:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:58,250 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 596 transitions. [2019-09-10 08:16:58,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 596 transitions. [2019-09-10 08:16:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:16:58,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:58,251 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1179395723, now seen corresponding path program 1 times [2019-09-10 08:16:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:58,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:58,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:16:58,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:58,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:16:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:16:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:16:58,394 INFO L87 Difference]: Start difference. First operand 448 states and 596 transitions. Second operand 7 states. [2019-09-10 08:16:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:58,857 INFO L93 Difference]: Finished difference Result 1050 states and 1451 transitions. [2019-09-10 08:16:58,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:16:58,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:16:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:58,859 INFO L225 Difference]: With dead ends: 1050 [2019-09-10 08:16:58,859 INFO L226 Difference]: Without dead ends: 1050 [2019-09-10 08:16:58,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:16:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2019-09-10 08:16:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 508. [2019-09-10 08:16:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-10 08:16:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 678 transitions. [2019-09-10 08:16:58,867 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 678 transitions. Word has length 146 [2019-09-10 08:16:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:58,867 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 678 transitions. [2019-09-10 08:16:58,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:16:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 678 transitions. [2019-09-10 08:16:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:16:58,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:58,868 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1500507275, now seen corresponding path program 1 times [2019-09-10 08:16:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:58,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:59,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:59,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:16:59,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:59,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:16:59,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:16:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:16:59,010 INFO L87 Difference]: Start difference. First operand 508 states and 678 transitions. Second operand 7 states. [2019-09-10 08:16:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:59,514 INFO L93 Difference]: Finished difference Result 1754 states and 2459 transitions. [2019-09-10 08:16:59,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:16:59,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:16:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:59,517 INFO L225 Difference]: With dead ends: 1754 [2019-09-10 08:16:59,517 INFO L226 Difference]: Without dead ends: 1754 [2019-09-10 08:16:59,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:16:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-09-10 08:16:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 892. [2019-09-10 08:16:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-10 08:16:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1236 transitions. [2019-09-10 08:16:59,527 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1236 transitions. Word has length 146 [2019-09-10 08:16:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:59,527 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1236 transitions. [2019-09-10 08:16:59,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:16:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1236 transitions. [2019-09-10 08:16:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:16:59,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:59,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:59,528 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -656987622, now seen corresponding path program 1 times [2019-09-10 08:16:59,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:59,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:59,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:59,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:59,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:59,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:59,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:59,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:59,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:59,639 INFO L87 Difference]: Start difference. First operand 892 states and 1236 transitions. Second operand 3 states. [2019-09-10 08:16:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:59,682 INFO L93 Difference]: Finished difference Result 1274 states and 1779 transitions. [2019-09-10 08:16:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:59,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:16:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:59,684 INFO L225 Difference]: With dead ends: 1274 [2019-09-10 08:16:59,684 INFO L226 Difference]: Without dead ends: 1274 [2019-09-10 08:16:59,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-10 08:16:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-10 08:16:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-10 08:16:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1778 transitions. [2019-09-10 08:16:59,694 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1778 transitions. Word has length 146 [2019-09-10 08:16:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:59,694 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1778 transitions. [2019-09-10 08:16:59,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1778 transitions. [2019-09-10 08:16:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:16:59,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:59,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:59,695 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash -723481134, now seen corresponding path program 1 times [2019-09-10 08:16:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:59,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:59,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:59,824 INFO L87 Difference]: Start difference. First operand 1272 states and 1778 transitions. Second operand 3 states. [2019-09-10 08:16:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:59,855 INFO L93 Difference]: Finished difference Result 2270 states and 3165 transitions. [2019-09-10 08:16:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:59,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:16:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:59,858 INFO L225 Difference]: With dead ends: 2270 [2019-09-10 08:16:59,858 INFO L226 Difference]: Without dead ends: 2270 [2019-09-10 08:16:59,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-10 08:16:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-09-10 08:16:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-09-10 08:16:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3164 transitions. [2019-09-10 08:16:59,873 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3164 transitions. Word has length 146 [2019-09-10 08:16:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:59,873 INFO L475 AbstractCegarLoop]: Abstraction has 2268 states and 3164 transitions. [2019-09-10 08:16:59,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3164 transitions. [2019-09-10 08:16:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:16:59,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:59,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:59,875 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash 803696779, now seen corresponding path program 1 times [2019-09-10 08:16:59,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:59,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:00,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:00,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:00,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:00,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:00,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:00,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:00,009 INFO L87 Difference]: Start difference. First operand 2268 states and 3164 transitions. Second operand 7 states. [2019-09-10 08:17:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:00,517 INFO L93 Difference]: Finished difference Result 8090 states and 11315 transitions. [2019-09-10 08:17:00,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:00,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:17:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:00,526 INFO L225 Difference]: With dead ends: 8090 [2019-09-10 08:17:00,526 INFO L226 Difference]: Without dead ends: 8090 [2019-09-10 08:17:00,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8090 states. [2019-09-10 08:17:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8090 to 4612. [2019-09-10 08:17:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-09-10 08:17:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6488 transitions. [2019-09-10 08:17:00,576 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6488 transitions. Word has length 146 [2019-09-10 08:17:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:00,577 INFO L475 AbstractCegarLoop]: Abstraction has 4612 states and 6488 transitions. [2019-09-10 08:17:00,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6488 transitions. [2019-09-10 08:17:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:17:00,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:00,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:00,578 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1196216693, now seen corresponding path program 1 times [2019-09-10 08:17:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:00,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:00,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:00,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:00,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:00,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:00,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:00,728 INFO L87 Difference]: Start difference. First operand 4612 states and 6488 transitions. Second operand 7 states. [2019-09-10 08:17:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:01,269 INFO L93 Difference]: Finished difference Result 15002 states and 20987 transitions. [2019-09-10 08:17:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:01,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:17:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:01,285 INFO L225 Difference]: With dead ends: 15002 [2019-09-10 08:17:01,285 INFO L226 Difference]: Without dead ends: 15002 [2019-09-10 08:17:01,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15002 states. [2019-09-10 08:17:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15002 to 9540. [2019-09-10 08:17:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9540 states. [2019-09-10 08:17:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9540 states to 9540 states and 13472 transitions. [2019-09-10 08:17:01,407 INFO L78 Accepts]: Start accepts. Automaton has 9540 states and 13472 transitions. Word has length 146 [2019-09-10 08:17:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:01,408 INFO L475 AbstractCegarLoop]: Abstraction has 9540 states and 13472 transitions. [2019-09-10 08:17:01,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9540 states and 13472 transitions. [2019-09-10 08:17:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:17:01,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:01,410 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1315067253, now seen corresponding path program 1 times [2019-09-10 08:17:01,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:01,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:01,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:01,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:01,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:01,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:01,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:01,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:01,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:01,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:01,621 INFO L87 Difference]: Start difference. First operand 9540 states and 13472 transitions. Second operand 7 states. [2019-09-10 08:17:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:02,182 INFO L93 Difference]: Finished difference Result 34154 states and 48035 transitions. [2019-09-10 08:17:02,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:02,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:17:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:02,212 INFO L225 Difference]: With dead ends: 34154 [2019-09-10 08:17:02,212 INFO L226 Difference]: Without dead ends: 34154 [2019-09-10 08:17:02,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34154 states. [2019-09-10 08:17:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34154 to 19876. [2019-09-10 08:17:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19876 states. [2019-09-10 08:17:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19876 states to 19876 states and 28112 transitions. [2019-09-10 08:17:02,445 INFO L78 Accepts]: Start accepts. Automaton has 19876 states and 28112 transitions. Word has length 146 [2019-09-10 08:17:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:02,445 INFO L475 AbstractCegarLoop]: Abstraction has 19876 states and 28112 transitions. [2019-09-10 08:17:02,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19876 states and 28112 transitions. [2019-09-10 08:17:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:17:02,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:02,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:02,448 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1598265205, now seen corresponding path program 1 times [2019-09-10 08:17:02,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:02,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:02,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:02,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:02,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:02,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:02,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:02,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:02,579 INFO L87 Difference]: Start difference. First operand 19876 states and 28112 transitions. Second operand 7 states. [2019-09-10 08:17:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:03,173 INFO L93 Difference]: Finished difference Result 57234 states and 80673 transitions. [2019-09-10 08:17:03,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:03,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:17:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:03,375 INFO L225 Difference]: With dead ends: 57234 [2019-09-10 08:17:03,375 INFO L226 Difference]: Without dead ends: 57234 [2019-09-10 08:17:03,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57234 states. [2019-09-10 08:17:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57234 to 32676. [2019-09-10 08:17:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32676 states. [2019-09-10 08:17:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32676 states to 32676 states and 46240 transitions. [2019-09-10 08:17:03,735 INFO L78 Accepts]: Start accepts. Automaton has 32676 states and 46240 transitions. Word has length 146 [2019-09-10 08:17:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:03,736 INFO L475 AbstractCegarLoop]: Abstraction has 32676 states and 46240 transitions. [2019-09-10 08:17:03,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32676 states and 46240 transitions. [2019-09-10 08:17:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:17:03,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:03,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:03,739 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash 661211626, now seen corresponding path program 1 times [2019-09-10 08:17:03,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:03,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:03,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:03,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:03,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:17:03,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:03,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:17:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:17:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:03,874 INFO L87 Difference]: Start difference. First operand 32676 states and 46240 transitions. Second operand 6 states. [2019-09-10 08:17:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:04,051 INFO L93 Difference]: Finished difference Result 54248 states and 75667 transitions. [2019-09-10 08:17:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:17:04,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-10 08:17:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:04,111 INFO L225 Difference]: With dead ends: 54248 [2019-09-10 08:17:04,111 INFO L226 Difference]: Without dead ends: 54248 [2019-09-10 08:17:04,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54248 states. [2019-09-10 08:17:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54248 to 33060. [2019-09-10 08:17:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33060 states. [2019-09-10 08:17:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33060 states to 33060 states and 46496 transitions. [2019-09-10 08:17:04,525 INFO L78 Accepts]: Start accepts. Automaton has 33060 states and 46496 transitions. Word has length 147 [2019-09-10 08:17:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:04,525 INFO L475 AbstractCegarLoop]: Abstraction has 33060 states and 46496 transitions. [2019-09-10 08:17:04,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:17:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 33060 states and 46496 transitions. [2019-09-10 08:17:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:17:04,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:04,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:04,529 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -935556183, now seen corresponding path program 1 times [2019-09-10 08:17:04,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:04,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:04,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:04,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:04,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:04,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:04,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:04,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:04,654 INFO L87 Difference]: Start difference. First operand 33060 states and 46496 transitions. Second operand 3 states. [2019-09-10 08:17:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:04,773 INFO L93 Difference]: Finished difference Result 54086 states and 76337 transitions. [2019-09-10 08:17:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:04,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 08:17:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:04,827 INFO L225 Difference]: With dead ends: 54086 [2019-09-10 08:17:04,827 INFO L226 Difference]: Without dead ends: 54086 [2019-09-10 08:17:04,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54086 states. [2019-09-10 08:17:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54086 to 39572. [2019-09-10 08:17:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39572 states. [2019-09-10 08:17:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39572 states to 39572 states and 56072 transitions. [2019-09-10 08:17:06,548 INFO L78 Accepts]: Start accepts. Automaton has 39572 states and 56072 transitions. Word has length 147 [2019-09-10 08:17:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:06,549 INFO L475 AbstractCegarLoop]: Abstraction has 39572 states and 56072 transitions. [2019-09-10 08:17:06,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 39572 states and 56072 transitions. [2019-09-10 08:17:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:17:06,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:06,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:06,551 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 992244541, now seen corresponding path program 1 times [2019-09-10 08:17:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:06,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:06,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:06,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:06,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:06,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:06,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:06,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:06,682 INFO L87 Difference]: Start difference. First operand 39572 states and 56072 transitions. Second operand 3 states. [2019-09-10 08:17:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:06,795 INFO L93 Difference]: Finished difference Result 49622 states and 69569 transitions. [2019-09-10 08:17:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:06,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 08:17:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:06,845 INFO L225 Difference]: With dead ends: 49622 [2019-09-10 08:17:06,846 INFO L226 Difference]: Without dead ends: 49622 [2019-09-10 08:17:06,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49622 states. [2019-09-10 08:17:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49622 to 36932. [2019-09-10 08:17:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36932 states. [2019-09-10 08:17:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36932 states to 36932 states and 51824 transitions. [2019-09-10 08:17:07,214 INFO L78 Accepts]: Start accepts. Automaton has 36932 states and 51824 transitions. Word has length 148 [2019-09-10 08:17:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:07,214 INFO L475 AbstractCegarLoop]: Abstraction has 36932 states and 51824 transitions. [2019-09-10 08:17:07,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36932 states and 51824 transitions. [2019-09-10 08:17:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:17:07,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:07,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:07,216 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 992110333, now seen corresponding path program 1 times [2019-09-10 08:17:07,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:07,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:07,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:07,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:07,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:07,328 INFO L87 Difference]: Start difference. First operand 36932 states and 51824 transitions. Second operand 3 states. [2019-09-10 08:17:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:07,413 INFO L93 Difference]: Finished difference Result 35710 states and 49785 transitions. [2019-09-10 08:17:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:07,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 08:17:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:07,443 INFO L225 Difference]: With dead ends: 35710 [2019-09-10 08:17:07,444 INFO L226 Difference]: Without dead ends: 35710 [2019-09-10 08:17:07,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35710 states. [2019-09-10 08:17:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35710 to 35708. [2019-09-10 08:17:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35708 states. [2019-09-10 08:17:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35708 states to 35708 states and 49784 transitions. [2019-09-10 08:17:07,724 INFO L78 Accepts]: Start accepts. Automaton has 35708 states and 49784 transitions. Word has length 149 [2019-09-10 08:17:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:07,724 INFO L475 AbstractCegarLoop]: Abstraction has 35708 states and 49784 transitions. [2019-09-10 08:17:07,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 35708 states and 49784 transitions. [2019-09-10 08:17:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:17:07,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:07,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:07,725 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1655838189, now seen corresponding path program 1 times [2019-09-10 08:17:07,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:07,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:07,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:07,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:07,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:07,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:07,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:07,820 INFO L87 Difference]: Start difference. First operand 35708 states and 49784 transitions. Second operand 3 states. [2019-09-10 08:17:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:07,909 INFO L93 Difference]: Finished difference Result 39262 states and 54649 transitions. [2019-09-10 08:17:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:07,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 08:17:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:07,945 INFO L225 Difference]: With dead ends: 39262 [2019-09-10 08:17:07,945 INFO L226 Difference]: Without dead ends: 39262 [2019-09-10 08:17:07,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39262 states. [2019-09-10 08:17:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39262 to 39260. [2019-09-10 08:17:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39260 states. [2019-09-10 08:17:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39260 states to 39260 states and 54648 transitions. [2019-09-10 08:17:08,496 INFO L78 Accepts]: Start accepts. Automaton has 39260 states and 54648 transitions. Word has length 150 [2019-09-10 08:17:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:08,496 INFO L475 AbstractCegarLoop]: Abstraction has 39260 states and 54648 transitions. [2019-09-10 08:17:08,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 39260 states and 54648 transitions. [2019-09-10 08:17:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:17:08,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:08,502 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:08,503 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1016895815, now seen corresponding path program 1 times [2019-09-10 08:17:08,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:08,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:08,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:08,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:08,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:17:08,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:08,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:17:08,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:08,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:17:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:17:08,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:17:08,746 INFO L87 Difference]: Start difference. First operand 39260 states and 54648 transitions. Second operand 8 states. [2019-09-10 08:17:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:09,333 INFO L93 Difference]: Finished difference Result 234272 states and 325758 transitions. [2019-09-10 08:17:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:17:09,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-09-10 08:17:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:09,591 INFO L225 Difference]: With dead ends: 234272 [2019-09-10 08:17:09,591 INFO L226 Difference]: Without dead ends: 234272 [2019-09-10 08:17:09,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:17:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234272 states. [2019-09-10 08:17:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234272 to 63884. [2019-09-10 08:17:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63884 states. [2019-09-10 08:17:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63884 states to 63884 states and 88632 transitions. [2019-09-10 08:17:13,319 INFO L78 Accepts]: Start accepts. Automaton has 63884 states and 88632 transitions. Word has length 185 [2019-09-10 08:17:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:13,319 INFO L475 AbstractCegarLoop]: Abstraction has 63884 states and 88632 transitions. [2019-09-10 08:17:13,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:17:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63884 states and 88632 transitions. [2019-09-10 08:17:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:17:13,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:13,326 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:13,326 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:13,327 INFO L82 PathProgramCache]: Analyzing trace with hash 641196871, now seen corresponding path program 1 times [2019-09-10 08:17:13,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:13,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:13,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:13,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:13,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:13,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:13,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:13,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:13,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:13,442 INFO L87 Difference]: Start difference. First operand 63884 states and 88632 transitions. Second operand 3 states. [2019-09-10 08:17:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:13,582 INFO L93 Difference]: Finished difference Result 78982 states and 108305 transitions. [2019-09-10 08:17:13,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:13,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:17:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:13,654 INFO L225 Difference]: With dead ends: 78982 [2019-09-10 08:17:13,654 INFO L226 Difference]: Without dead ends: 78982 [2019-09-10 08:17:13,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78982 states. [2019-09-10 08:17:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78982 to 58700. [2019-09-10 08:17:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58700 states. [2019-09-10 08:17:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58700 states to 58700 states and 80568 transitions. [2019-09-10 08:17:14,228 INFO L78 Accepts]: Start accepts. Automaton has 58700 states and 80568 transitions. Word has length 185 [2019-09-10 08:17:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:14,228 INFO L475 AbstractCegarLoop]: Abstraction has 58700 states and 80568 transitions. [2019-09-10 08:17:14,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 58700 states and 80568 transitions. [2019-09-10 08:17:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:17:14,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:14,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:14,235 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2041792443, now seen corresponding path program 1 times [2019-09-10 08:17:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:14,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:14,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:14,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2019-09-10 08:17:14,604 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9310], [9315], [9318], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:17:14,658 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:14,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:15,340 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:17,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:17:17,436 INFO L272 AbstractInterpreter]: Visited 168 different actions 829 times. Merged at 57 different actions 595 times. Widened at 24 different actions 102 times. Performed 3849 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3849 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 51 fixpoints after 13 different actions. Largest state had 791 variables. [2019-09-10 08:17:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:17,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:17:17,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:17,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:17:17,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:17,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:17:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:18,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:17:18,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:17:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:17:18,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:17:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:17:18,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:17:18,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:17:18,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:18,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:17:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:17:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:18,718 INFO L87 Difference]: Start difference. First operand 58700 states and 80568 transitions. Second operand 8 states. [2019-09-10 08:17:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:19,244 INFO L93 Difference]: Finished difference Result 236418 states and 324861 transitions. [2019-09-10 08:17:19,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:17:19,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2019-09-10 08:17:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:19,840 INFO L225 Difference]: With dead ends: 236418 [2019-09-10 08:17:19,841 INFO L226 Difference]: Without dead ends: 236418 [2019-09-10 08:17:19,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236418 states. [2019-09-10 08:17:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236418 to 92624. [2019-09-10 08:17:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92624 states. [2019-09-10 08:17:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92624 states to 92624 states and 126768 transitions. [2019-09-10 08:17:23,133 INFO L78 Accepts]: Start accepts. Automaton has 92624 states and 126768 transitions. Word has length 186 [2019-09-10 08:17:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:23,133 INFO L475 AbstractCegarLoop]: Abstraction has 92624 states and 126768 transitions. [2019-09-10 08:17:23,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:17:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 92624 states and 126768 transitions. [2019-09-10 08:17:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:17:23,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:23,141 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:23,142 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash 41878971, now seen corresponding path program 1 times [2019-09-10 08:17:23,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:23,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:23,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:17:23,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:23,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:17:23,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:23,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:17:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:17:23,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:23,499 INFO L87 Difference]: Start difference. First operand 92624 states and 126768 transitions. Second operand 6 states. [2019-09-10 08:17:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:23,995 INFO L93 Difference]: Finished difference Result 124046 states and 169475 transitions. [2019-09-10 08:17:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:17:23,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 08:17:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:24,187 INFO L225 Difference]: With dead ends: 124046 [2019-09-10 08:17:24,188 INFO L226 Difference]: Without dead ends: 124046 [2019-09-10 08:17:24,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124046 states. [2019-09-10 08:17:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124046 to 115304. [2019-09-10 08:17:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115304 states. [2019-09-10 08:17:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115304 states to 115304 states and 157728 transitions. [2019-09-10 08:17:28,852 INFO L78 Accepts]: Start accepts. Automaton has 115304 states and 157728 transitions. Word has length 186 [2019-09-10 08:17:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:28,852 INFO L475 AbstractCegarLoop]: Abstraction has 115304 states and 157728 transitions. [2019-09-10 08:17:28,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:17:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 115304 states and 157728 transitions. [2019-09-10 08:17:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:17:28,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:28,862 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:28,862 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:28,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:28,863 INFO L82 PathProgramCache]: Analyzing trace with hash -360169541, now seen corresponding path program 1 times [2019-09-10 08:17:28,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:28,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:28,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:17:29,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:29,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:17:29,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:29,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:17:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:17:29,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:29,157 INFO L87 Difference]: Start difference. First operand 115304 states and 157728 transitions. Second operand 6 states. [2019-09-10 08:17:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:29,973 INFO L93 Difference]: Finished difference Result 207344 states and 283839 transitions. [2019-09-10 08:17:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:29,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 08:17:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:30,290 INFO L225 Difference]: With dead ends: 207344 [2019-09-10 08:17:30,291 INFO L226 Difference]: Without dead ends: 207344 [2019-09-10 08:17:30,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207344 states. [2019-09-10 08:17:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207344 to 203576. [2019-09-10 08:17:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203576 states. [2019-09-10 08:17:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203576 states to 203576 states and 278784 transitions. [2019-09-10 08:17:32,699 INFO L78 Accepts]: Start accepts. Automaton has 203576 states and 278784 transitions. Word has length 186 [2019-09-10 08:17:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:32,699 INFO L475 AbstractCegarLoop]: Abstraction has 203576 states and 278784 transitions. [2019-09-10 08:17:32,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:17:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 203576 states and 278784 transitions. [2019-09-10 08:17:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:17:32,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:32,707 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:32,707 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1052865823, now seen corresponding path program 1 times [2019-09-10 08:17:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:32,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:33,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:33,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:33,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-09-10 08:17:33,138 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9244], [9249], [9252], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:17:33,156 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:33,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:33,672 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:35,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:17:35,202 INFO L272 AbstractInterpreter]: Visited 173 different actions 952 times. Merged at 62 different actions 678 times. Widened at 26 different actions 114 times. Performed 4219 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 90 fixpoints after 21 different actions. Largest state had 792 variables. [2019-09-10 08:17:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:35,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:17:35,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:35,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:17:35,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:35,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:17:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:35,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 4188 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:17:35,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:17:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:17:36,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:17:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:17:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:17:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:17:36,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:36,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:17:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:17:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:36,803 INFO L87 Difference]: Start difference. First operand 203576 states and 278784 transitions. Second operand 8 states. [2019-09-10 08:17:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:38,071 INFO L93 Difference]: Finished difference Result 477452 states and 654614 transitions. [2019-09-10 08:17:38,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:17:38,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 187 [2019-09-10 08:17:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:38,806 INFO L225 Difference]: With dead ends: 477452 [2019-09-10 08:17:38,806 INFO L226 Difference]: Without dead ends: 477452 [2019-09-10 08:17:38,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477452 states. [2019-09-10 08:17:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477452 to 226256. [2019-09-10 08:17:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226256 states. [2019-09-10 08:17:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226256 states to 226256 states and 309744 transitions. [2019-09-10 08:17:47,692 INFO L78 Accepts]: Start accepts. Automaton has 226256 states and 309744 transitions. Word has length 187 [2019-09-10 08:17:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:47,692 INFO L475 AbstractCegarLoop]: Abstraction has 226256 states and 309744 transitions. [2019-09-10 08:17:47,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:17:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 226256 states and 309744 transitions. [2019-09-10 08:17:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:17:47,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:47,700 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:47,700 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:47,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:47,701 INFO L82 PathProgramCache]: Analyzing trace with hash 201313651, now seen corresponding path program 1 times [2019-09-10 08:17:47,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:47,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:47,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:48,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:48,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:48,518 INFO L87 Difference]: Start difference. First operand 226256 states and 309744 transitions. Second operand 3 states. [2019-09-10 08:17:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:48,949 INFO L93 Difference]: Finished difference Result 210418 states and 283345 transitions. [2019-09-10 08:17:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:48,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:17:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:49,218 INFO L225 Difference]: With dead ends: 210418 [2019-09-10 08:17:49,218 INFO L226 Difference]: Without dead ends: 210418 [2019-09-10 08:17:49,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210418 states. [2019-09-10 08:17:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210418 to 205088. [2019-09-10 08:17:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205088 states. [2019-09-10 08:17:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205088 states to 205088 states and 276684 transitions. [2019-09-10 08:17:51,894 INFO L78 Accepts]: Start accepts. Automaton has 205088 states and 276684 transitions. Word has length 187 [2019-09-10 08:17:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:51,895 INFO L475 AbstractCegarLoop]: Abstraction has 205088 states and 276684 transitions. [2019-09-10 08:17:51,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 205088 states and 276684 transitions. [2019-09-10 08:17:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:17:51,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:51,904 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:51,904 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 866535055, now seen corresponding path program 1 times [2019-09-10 08:17:51,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:51,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:51,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:52,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:52,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:52,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2019-09-10 08:17:52,371 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9266], [9271], [9274], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9376], [9379], [9382], [9390], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:17:52,379 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:52,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:52,666 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:55,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:17:55,601 INFO L272 AbstractInterpreter]: Visited 176 different actions 1167 times. Merged at 65 different actions 870 times. Widened at 30 different actions 166 times. Performed 4959 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 110 fixpoints after 21 different actions. Largest state had 793 variables. [2019-09-10 08:17:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:55,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:17:55,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:55,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:17:55,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:55,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:17:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:56,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 4190 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:17:56,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:17:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:17:56,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:17:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:17:56,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:17:56,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:17:56,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:56,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:17:56,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:17:56,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:56,614 INFO L87 Difference]: Start difference. First operand 205088 states and 276684 transitions. Second operand 8 states. [2019-09-10 08:17:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:58,842 INFO L93 Difference]: Finished difference Result 451904 states and 610586 transitions. [2019-09-10 08:17:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:17:58,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 188 [2019-09-10 08:17:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:59,405 INFO L225 Difference]: With dead ends: 451904 [2019-09-10 08:17:59,405 INFO L226 Difference]: Without dead ends: 451904 [2019-09-10 08:17:59,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451904 states. [2019-09-10 08:18:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451904 to 225608. [2019-09-10 08:18:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225608 states. [2019-09-10 08:18:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225608 states to 225608 states and 304284 transitions. [2019-09-10 08:18:08,043 INFO L78 Accepts]: Start accepts. Automaton has 225608 states and 304284 transitions. Word has length 188 [2019-09-10 08:18:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:08,043 INFO L475 AbstractCegarLoop]: Abstraction has 225608 states and 304284 transitions. [2019-09-10 08:18:08,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:18:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 225608 states and 304284 transitions. [2019-09-10 08:18:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:18:08,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:08,052 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:08,053 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash -544074859, now seen corresponding path program 1 times [2019-09-10 08:18:08,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:08,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:18:08,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:18:08,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:08,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:18:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:18:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:18:08,198 INFO L87 Difference]: Start difference. First operand 225608 states and 304284 transitions. Second operand 3 states. [2019-09-10 08:18:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:09,333 INFO L93 Difference]: Finished difference Result 278246 states and 369921 transitions. [2019-09-10 08:18:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:18:09,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 08:18:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:09,628 INFO L225 Difference]: With dead ends: 278246 [2019-09-10 08:18:09,628 INFO L226 Difference]: Without dead ends: 278246 [2019-09-10 08:18:09,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:18:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278246 states. [2019-09-10 08:18:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278246 to 267524. [2019-09-10 08:18:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267524 states. [2019-09-10 08:18:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267524 states to 267524 states and 357056 transitions. [2019-09-10 08:18:16,283 INFO L78 Accepts]: Start accepts. Automaton has 267524 states and 357056 transitions. Word has length 188 [2019-09-10 08:18:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:16,283 INFO L475 AbstractCegarLoop]: Abstraction has 267524 states and 357056 transitions. [2019-09-10 08:18:16,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:18:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 267524 states and 357056 transitions. [2019-09-10 08:18:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:18:16,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:16,296 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:16,296 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash 886141477, now seen corresponding path program 1 times [2019-09-10 08:18:16,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:16,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:16,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:16,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:18:16,603 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-09-10 08:18:16,603 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7183], [7185], [7188], [7192], [7194], [7199], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9376], [9379], [9382], [9390], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:18:16,607 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:18:16,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:18:16,922 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:18:19,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:18:19,984 INFO L272 AbstractInterpreter]: Visited 176 different actions 1493 times. Merged at 65 different actions 1142 times. Widened at 31 different actions 191 times. Performed 5972 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5972 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 176 fixpoints after 32 different actions. Largest state had 793 variables. [2019-09-10 08:18:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:19,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:18:19,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:19,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:18:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:19,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:18:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:20,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 4189 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:18:20,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:18:20,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:20,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:24,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:18:24,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:24,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:24,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:24,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:24,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:27,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:18:27,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-10 08:18:27,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:18:27,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:18:27,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:18:27,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:18:27,390 INFO L87 Difference]: Start difference. First operand 267524 states and 357056 transitions. Second operand 20 states. [2019-09-10 08:18:43,016 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-09-10 08:18:45,498 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-09-10 08:18:56,967 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-10 08:19:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:24,639 INFO L93 Difference]: Finished difference Result 3645862 states and 4763013 transitions. [2019-09-10 08:19:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2019-09-10 08:19:24,640 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2019-09-10 08:19:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:31,777 INFO L225 Difference]: With dead ends: 3645862 [2019-09-10 08:19:31,777 INFO L226 Difference]: Without dead ends: 3645862 [2019-09-10 08:19:31,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 304 SyntacticMatches, 57 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41457 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=11716, Invalid=85316, Unknown=0, NotChecked=0, Total=97032 [2019-09-10 08:19:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645862 states. [2019-09-10 08:20:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645862 to 953564. [2019-09-10 08:20:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953564 states. [2019-09-10 08:20:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953564 states to 953564 states and 1260848 transitions. [2019-09-10 08:20:49,083 INFO L78 Accepts]: Start accepts. Automaton has 953564 states and 1260848 transitions. Word has length 189 [2019-09-10 08:20:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:49,083 INFO L475 AbstractCegarLoop]: Abstraction has 953564 states and 1260848 transitions. [2019-09-10 08:20:49,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:20:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 953564 states and 1260848 transitions. [2019-09-10 08:20:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:20:49,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:49,115 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:49,115 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:49,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1137326936, now seen corresponding path program 1 times [2019-09-10 08:20:49,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:49,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:49,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:49,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:49,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:49,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:49,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2019-09-10 08:20:49,525 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9200], [9205], [9208], [9214], [9216], [9219], [9222], [9227], [9230], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9376], [9379], [9382], [9390], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:20:49,528 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:49,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:49,778 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:52,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:52,640 INFO L272 AbstractInterpreter]: Visited 178 different actions 1037 times. Merged at 67 different actions 758 times. Widened at 27 different actions 139 times. Performed 4560 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4560 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 92 fixpoints after 20 different actions. Largest state had 793 variables. [2019-09-10 08:20:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:52,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:52,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:52,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:20:52,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:52,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:20:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:53,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 4194 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:20:53,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:53,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:54,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:20:54,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:20:54,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 08:20:54,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:20:54,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:20:54,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:20:54,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:20:54,246 INFO L87 Difference]: Start difference. First operand 953564 states and 1260848 transitions. Second operand 20 states. [2019-09-10 08:20:56,994 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:20:57,281 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:20:57,541 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:20:58,017 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:20:58,525 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:20:58,726 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:20:59,137 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:20:59,454 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:20:59,602 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:20:59,755 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:21:00,046 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:00,415 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:00,608 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:21:00,768 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:00,918 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:21:02,925 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:03,100 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:04,272 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:21:04,441 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:04,637 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:21:04,824 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:21:04,984 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:21:05,135 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:21:05,359 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:05,621 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:05,884 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:21:06,376 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:21:06,570 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:06,720 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:06,914 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:21:07,077 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:07,237 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:21:07,754 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:21:07,906 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:08,208 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:08,406 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:08,601 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:08,805 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:08,998 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:09,172 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:21:09,351 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:21:09,559 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:09,765 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:09,946 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:21:10,274 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:10,630 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:10,832 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:11,046 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:11,308 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:11,500 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:21:11,709 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:21:11,886 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:21:12,051 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:21:12,200 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:21:12,388 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:21:12,543 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:21:12,824 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:13,696 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:13,850 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:14,029 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:14,215 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:14,380 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:14,551 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:14,737 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:21:14,888 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:21:15,038 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:21:15,231 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:15,412 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:15,611 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:16,033 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:21:16,204 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:16,840 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:17,084 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:21:17,448 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:17,669 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:21:18,230 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:18,428 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:18,637 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:18,811 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:21:19,247 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:21:20,030 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:21:20,252 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:21:20,478 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:21:20,698 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:21:20,885 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:21,066 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:21,225 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:21:21,447 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:21:21,608 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:21,792 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:21:21,961 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:21:22,136 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:22,338 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:22,506 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:22,671 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:22,825 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:22,983 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:21:23,260 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:21:23,608 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:21:23,799 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:21:24,019 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:24,165 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:24,345 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:24,533 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:24,757 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:21:25,082 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:21:25,232 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:21:25,460 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:26,077 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:26,266 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:26,423 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:21:26,749 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:21:26,910 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:27,079 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:27,288 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:27,468 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:21:27,636 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:27,971 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:28,127 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:21:28,408 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:28,585 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:28,794 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:29,103 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:21:29,277 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:29,481 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:29,819 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:29,994 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:21:30,148 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:30,447 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:31,781 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:32,114 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:32,325 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:21:32,536 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:32,712 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:21:32,971 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:21:33,233 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:21:38,282 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:38,731 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:38,955 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:39,115 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:21:40,925 WARN L188 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:21:41,299 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:21:41,490 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:41,666 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:41,889 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:42,063 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:42,232 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:21:42,685 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:21:42,846 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:43,027 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:21:43,175 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:43,357 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:21:44,535 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:21:44,699 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:44,938 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:21:45,187 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:45,508 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:45,664 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:21:45,960 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:46,104 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:21:48,147 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:48,331 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:48,559 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:21:48,707 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:49,051 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:49,583 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:49,847 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:21:50,064 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:21:50,479 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57