java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:21:58,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:21:58,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:21:58,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:21:58,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:21:58,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:21:58,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:21:58,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:21:58,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:21:58,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:21:58,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:21:58,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:21:58,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:21:58,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:21:58,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:21:58,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:21:58,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:21:58,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:21:58,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:21:58,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:21:58,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:21:58,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:21:58,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:21:58,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:21:58,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:21:58,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:21:58,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:21:58,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:21:58,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:21:58,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:21:58,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:21:58,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:21:58,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:21:58,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:21:58,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:21:58,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:21:58,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:21:58,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:21:58,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:21:58,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:21:58,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:21:58,966 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:21:58,990 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:21:58,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:21:58,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:21:58,992 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:21:58,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:21:58,993 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:21:58,993 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:21:58,993 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:21:58,993 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:21:58,994 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:21:58,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:21:58,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:21:58,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:21:58,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:21:58,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:21:58,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:21:58,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:21:58,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:21:58,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:21:58,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:21:58,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:21:58,998 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:21:58,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:21:58,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:21:58,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:21:58,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:21:58,999 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:21:59,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:21:59,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:21:59,000 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:21:59,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:21:59,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:21:59,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:21:59,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:21:59,054 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:21:59,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:21:59,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a38ba1c/88e46aa894174c9caceace9a785cc96c/FLAG1d2522859 [2019-09-10 08:21:59,965 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:21:59,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:22:00,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a38ba1c/88e46aa894174c9caceace9a785cc96c/FLAG1d2522859 [2019-09-10 08:22:00,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a38ba1c/88e46aa894174c9caceace9a785cc96c [2019-09-10 08:22:00,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:22:00,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:22:00,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:22:00,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:22:00,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:22:00,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:22:00" (1/1) ... [2019-09-10 08:22:00,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebae9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:00, skipping insertion in model container [2019-09-10 08:22:00,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:22:00" (1/1) ... [2019-09-10 08:22:00,486 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:22:00,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:22:02,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:22:02,566 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:22:03,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:22:03,656 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:22:03,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03 WrapperNode [2019-09-10 08:22:03,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:22:03,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:22:03,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:22:03,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:22:03,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (1/1) ... [2019-09-10 08:22:03,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:22:03,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:22:03,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:22:03,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:22:03,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (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:22:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:22:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:22:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:22:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:22:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:22:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:22:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:22:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:22:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:22:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:22:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:22:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:22:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:22:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:22:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:22:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:22:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:22:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:22:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:22:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:22:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:22:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:22:09,746 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:22:09,746 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:22:09,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:22:09 BoogieIcfgContainer [2019-09-10 08:22:09,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:22:09,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:22:09,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:22:09,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:22:09,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:22:00" (1/3) ... [2019-09-10 08:22:09,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c3f46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:22:09, skipping insertion in model container [2019-09-10 08:22:09,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:03" (2/3) ... [2019-09-10 08:22:09,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c3f46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:22:09, skipping insertion in model container [2019-09-10 08:22:09,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:22:09" (3/3) ... [2019-09-10 08:22:09,759 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:22:09,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:22:09,784 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:22:09,806 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:22:09,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:22:09,845 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:22:09,846 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:22:09,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:22:09,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:22:09,846 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:22:09,847 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:22:09,847 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:22:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states. [2019-09-10 08:22:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:22:09,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:09,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:09,960 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1894963753, now seen corresponding path program 1 times [2019-09-10 08:22:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:10,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:10,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:10,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:10,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:10,909 INFO L87 Difference]: Start difference. First operand 2353 states. Second operand 5 states. [2019-09-10 08:22:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:13,164 INFO L93 Difference]: Finished difference Result 1759 states and 3081 transitions. [2019-09-10 08:22:13,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:13,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:22:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:13,206 INFO L225 Difference]: With dead ends: 1759 [2019-09-10 08:22:13,207 INFO L226 Difference]: Without dead ends: 1747 [2019-09-10 08:22:13,211 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:22:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-09-10 08:22:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2019-09-10 08:22:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-09-10 08:22:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2288 transitions. [2019-09-10 08:22:13,357 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2288 transitions. Word has length 90 [2019-09-10 08:22:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:13,358 INFO L475 AbstractCegarLoop]: Abstraction has 1747 states and 2288 transitions. [2019-09-10 08:22:13,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2288 transitions. [2019-09-10 08:22:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:22:13,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:13,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:13,370 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1518436791, now seen corresponding path program 1 times [2019-09-10 08:22:13,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:13,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:13,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:13,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:13,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:13,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:13,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:13,663 INFO L87 Difference]: Start difference. First operand 1747 states and 2288 transitions. Second operand 5 states. [2019-09-10 08:22:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:15,309 INFO L93 Difference]: Finished difference Result 1199 states and 1579 transitions. [2019-09-10 08:22:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:15,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:22:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:15,316 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 08:22:15,316 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 08:22:15,317 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:22:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 08:22:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-09-10 08:22:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-09-10 08:22:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1579 transitions. [2019-09-10 08:22:15,344 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1579 transitions. Word has length 90 [2019-09-10 08:22:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:15,345 INFO L475 AbstractCegarLoop]: Abstraction has 1199 states and 1579 transitions. [2019-09-10 08:22:15,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1579 transitions. [2019-09-10 08:22:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:22:15,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:15,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:15,350 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash 487198845, now seen corresponding path program 1 times [2019-09-10 08:22:15,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:15,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:15,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:15,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:22:15,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:15,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:15,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:15,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:15,523 INFO L87 Difference]: Start difference. First operand 1199 states and 1579 transitions. Second operand 5 states. [2019-09-10 08:22:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:16,656 INFO L93 Difference]: Finished difference Result 1073 states and 1432 transitions. [2019-09-10 08:22:16,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:16,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:22:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:16,665 INFO L225 Difference]: With dead ends: 1073 [2019-09-10 08:22:16,665 INFO L226 Difference]: Without dead ends: 1073 [2019-09-10 08:22:16,665 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:22:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-09-10 08:22:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2019-09-10 08:22:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-09-10 08:22:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1432 transitions. [2019-09-10 08:22:16,692 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1432 transitions. Word has length 90 [2019-09-10 08:22:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:16,693 INFO L475 AbstractCegarLoop]: Abstraction has 1073 states and 1432 transitions. [2019-09-10 08:22:16,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1432 transitions. [2019-09-10 08:22:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:22:16,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:16,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:16,698 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -611229365, now seen corresponding path program 1 times [2019-09-10 08:22:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:16,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:16,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:16,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:16,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:16,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:16,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:16,922 INFO L87 Difference]: Start difference. First operand 1073 states and 1432 transitions. Second operand 5 states. [2019-09-10 08:22:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:17,781 INFO L93 Difference]: Finished difference Result 731 states and 971 transitions. [2019-09-10 08:22:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:17,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:22:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:17,787 INFO L225 Difference]: With dead ends: 731 [2019-09-10 08:22:17,787 INFO L226 Difference]: Without dead ends: 731 [2019-09-10 08:22:17,788 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:22:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-10 08:22:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-09-10 08:22:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-10 08:22:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 971 transitions. [2019-09-10 08:22:17,805 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 971 transitions. Word has length 91 [2019-09-10 08:22:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:17,806 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 971 transitions. [2019-09-10 08:22:17,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 971 transitions. [2019-09-10 08:22:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:22:17,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:17,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:17,809 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1651376349, now seen corresponding path program 1 times [2019-09-10 08:22:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:17,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:17,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:17,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:17,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:17,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:17,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:17,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:17,954 INFO L87 Difference]: Start difference. First operand 731 states and 971 transitions. Second operand 5 states. [2019-09-10 08:22:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:18,501 INFO L93 Difference]: Finished difference Result 650 states and 866 transitions. [2019-09-10 08:22:18,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:18,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 08:22:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:18,506 INFO L225 Difference]: With dead ends: 650 [2019-09-10 08:22:18,506 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 08:22:18,506 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:22:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 08:22:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 08:22:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 08:22:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2019-09-10 08:22:18,519 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 92 [2019-09-10 08:22:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:18,520 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2019-09-10 08:22:18,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2019-09-10 08:22:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:22:18,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:18,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:18,523 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash 620980430, now seen corresponding path program 1 times [2019-09-10 08:22:18,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:18,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:18,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:18,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:18,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:18,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:18,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:18,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:18,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:18,643 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand 5 states. [2019-09-10 08:22:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:19,374 INFO L93 Difference]: Finished difference Result 642 states and 856 transitions. [2019-09-10 08:22:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:19,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:22:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:19,383 INFO L225 Difference]: With dead ends: 642 [2019-09-10 08:22:19,383 INFO L226 Difference]: Without dead ends: 642 [2019-09-10 08:22:19,383 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:22:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-10 08:22:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-10 08:22:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 856 transitions. [2019-09-10 08:22:19,396 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 856 transitions. Word has length 93 [2019-09-10 08:22:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:19,396 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 856 transitions. [2019-09-10 08:22:19,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 856 transitions. [2019-09-10 08:22:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:22:19,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:19,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] [2019-09-10 08:22:19,399 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 574019279, now seen corresponding path program 1 times [2019-09-10 08:22:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:19,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:19,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:19,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:19,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:19,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:19,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:19,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:19,681 INFO L87 Difference]: Start difference. First operand 642 states and 856 transitions. Second operand 9 states. [2019-09-10 08:22:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:21,859 INFO L93 Difference]: Finished difference Result 1136 states and 1542 transitions. [2019-09-10 08:22:21,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:21,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 08:22:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:21,865 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:22:21,866 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:22:21,866 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:22:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:22:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-10 08:22:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 855 transitions. [2019-09-10 08:22:21,892 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 855 transitions. Word has length 94 [2019-09-10 08:22:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:21,893 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 855 transitions. [2019-09-10 08:22:21,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 855 transitions. [2019-09-10 08:22:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:22:21,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:21,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:21,896 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2033100651, now seen corresponding path program 1 times [2019-09-10 08:22:21,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:21,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:21,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:21,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:22,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:22:22,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:22,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:22,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:22,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:22,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:22,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:22,173 INFO L87 Difference]: Start difference. First operand 642 states and 855 transitions. Second operand 9 states. [2019-09-10 08:22:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:24,379 INFO L93 Difference]: Finished difference Result 1141 states and 1545 transitions. [2019-09-10 08:22:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:24,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 08:22:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:24,384 INFO L225 Difference]: With dead ends: 1141 [2019-09-10 08:22:24,384 INFO L226 Difference]: Without dead ends: 1141 [2019-09-10 08:22:24,384 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:22:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-09-10 08:22:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 642. [2019-09-10 08:22:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 854 transitions. [2019-09-10 08:22:24,399 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 854 transitions. Word has length 94 [2019-09-10 08:22:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:24,400 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 854 transitions. [2019-09-10 08:22:24,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 854 transitions. [2019-09-10 08:22:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:22:24,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:24,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:24,402 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -518152584, now seen corresponding path program 1 times [2019-09-10 08:22:24,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:24,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:24,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:22:24,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:22:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:22:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:22:24,594 INFO L87 Difference]: Start difference. First operand 642 states and 854 transitions. Second operand 8 states. [2019-09-10 08:22:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:26,033 INFO L93 Difference]: Finished difference Result 859 states and 1097 transitions. [2019-09-10 08:22:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:22:26,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-10 08:22:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:26,040 INFO L225 Difference]: With dead ends: 859 [2019-09-10 08:22:26,040 INFO L226 Difference]: Without dead ends: 859 [2019-09-10 08:22:26,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:22:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-10 08:22:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 642. [2019-09-10 08:22:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 853 transitions. [2019-09-10 08:22:26,055 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 853 transitions. Word has length 94 [2019-09-10 08:22:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:26,056 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 853 transitions. [2019-09-10 08:22:26,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:22:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 853 transitions. [2019-09-10 08:22:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:26,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:26,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:26,059 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 103072893, now seen corresponding path program 1 times [2019-09-10 08:22:26,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:26,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:22:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:26,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:26,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:26,268 INFO L87 Difference]: Start difference. First operand 642 states and 853 transitions. Second operand 9 states. [2019-09-10 08:22:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:28,518 INFO L93 Difference]: Finished difference Result 1129 states and 1522 transitions. [2019-09-10 08:22:28,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:28,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:28,525 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:22:28,525 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:22:28,526 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:22:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:22:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:22:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 852 transitions. [2019-09-10 08:22:28,539 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 852 transitions. Word has length 96 [2019-09-10 08:22:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:28,540 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 852 transitions. [2019-09-10 08:22:28,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 852 transitions. [2019-09-10 08:22:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:28,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:28,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:28,543 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1545982347, now seen corresponding path program 1 times [2019-09-10 08:22:28,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:28,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:28,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:28,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:28,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:28,828 INFO L87 Difference]: Start difference. First operand 642 states and 852 transitions. Second operand 9 states. [2019-09-10 08:22:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:30,818 INFO L93 Difference]: Finished difference Result 1136 states and 1538 transitions. [2019-09-10 08:22:30,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:30,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:30,826 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:22:30,826 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:22:30,827 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:22:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:22:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-10 08:22:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 851 transitions. [2019-09-10 08:22:30,841 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 851 transitions. Word has length 96 [2019-09-10 08:22:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:30,841 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 851 transitions. [2019-09-10 08:22:30,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 851 transitions. [2019-09-10 08:22:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:30,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:30,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:30,844 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1428928273, now seen corresponding path program 1 times [2019-09-10 08:22:30,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:31,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:31,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:31,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:31,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:31,080 INFO L87 Difference]: Start difference. First operand 642 states and 851 transitions. Second operand 9 states. [2019-09-10 08:22:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:33,500 INFO L93 Difference]: Finished difference Result 1141 states and 1538 transitions. [2019-09-10 08:22:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:33,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:33,504 INFO L225 Difference]: With dead ends: 1141 [2019-09-10 08:22:33,505 INFO L226 Difference]: Without dead ends: 1141 [2019-09-10 08:22:33,505 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:22:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-09-10 08:22:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 642. [2019-09-10 08:22:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 850 transitions. [2019-09-10 08:22:33,519 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 850 transitions. Word has length 96 [2019-09-10 08:22:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:33,520 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 850 transitions. [2019-09-10 08:22:33,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 850 transitions. [2019-09-10 08:22:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:33,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:33,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:33,522 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2085599014, now seen corresponding path program 1 times [2019-09-10 08:22:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:33,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:33,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:33,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:33,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:33,705 INFO L87 Difference]: Start difference. First operand 642 states and 850 transitions. Second operand 9 states. [2019-09-10 08:22:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:36,051 INFO L93 Difference]: Finished difference Result 1129 states and 1519 transitions. [2019-09-10 08:22:36,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:36,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:36,057 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:22:36,057 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:22:36,058 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:22:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:22:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:22:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 849 transitions. [2019-09-10 08:22:36,069 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 849 transitions. Word has length 96 [2019-09-10 08:22:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:36,069 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 849 transitions. [2019-09-10 08:22:36,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 849 transitions. [2019-09-10 08:22:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:36,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:36,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:36,072 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:36,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:36,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1937383278, now seen corresponding path program 1 times [2019-09-10 08:22:36,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:36,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:36,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:36,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:36,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:36,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:36,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:36,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:36,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:36,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:36,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:36,245 INFO L87 Difference]: Start difference. First operand 642 states and 849 transitions. Second operand 9 states. [2019-09-10 08:22:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:38,735 INFO L93 Difference]: Finished difference Result 1136 states and 1533 transitions. [2019-09-10 08:22:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:38,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:38,741 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:22:38,741 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:22:38,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:22:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-10 08:22:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 848 transitions. [2019-09-10 08:22:38,756 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 848 transitions. Word has length 96 [2019-09-10 08:22:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:38,757 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 848 transitions. [2019-09-10 08:22:38,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 848 transitions. [2019-09-10 08:22:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:38,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:38,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:38,760 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash -320032428, now seen corresponding path program 1 times [2019-09-10 08:22:38,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:38,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:38,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:38,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:38,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:38,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:38,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:38,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:38,943 INFO L87 Difference]: Start difference. First operand 642 states and 848 transitions. Second operand 9 states. [2019-09-10 08:22:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:41,484 INFO L93 Difference]: Finished difference Result 1129 states and 1516 transitions. [2019-09-10 08:22:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:41,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:41,490 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:22:41,490 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:22:41,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:22:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:22:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 847 transitions. [2019-09-10 08:22:41,504 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 847 transitions. Word has length 96 [2019-09-10 08:22:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:41,504 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 847 transitions. [2019-09-10 08:22:41,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 847 transitions. [2019-09-10 08:22:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:41,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:41,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:41,507 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash -891007590, now seen corresponding path program 1 times [2019-09-10 08:22:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:41,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:41,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:41,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:41,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:41,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:41,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:41,679 INFO L87 Difference]: Start difference. First operand 642 states and 847 transitions. Second operand 9 states. [2019-09-10 08:22:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:44,004 INFO L93 Difference]: Finished difference Result 1129 states and 1515 transitions. [2019-09-10 08:22:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:44,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:22:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:44,011 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:22:44,011 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:22:44,012 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:22:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:22:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:22:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 846 transitions. [2019-09-10 08:22:44,024 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 846 transitions. Word has length 96 [2019-09-10 08:22:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:44,025 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 846 transitions. [2019-09-10 08:22:44,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 846 transitions. [2019-09-10 08:22:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:44,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:44,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:44,027 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:44,028 INFO L82 PathProgramCache]: Analyzing trace with hash -354416756, now seen corresponding path program 1 times [2019-09-10 08:22:44,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:44,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:44,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:44,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:44,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:44,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:44,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:44,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:44,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:44,217 INFO L87 Difference]: Start difference. First operand 642 states and 846 transitions. Second operand 9 states. [2019-09-10 08:22:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:46,500 INFO L93 Difference]: Finished difference Result 1129 states and 1514 transitions. [2019-09-10 08:22:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:46,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:22:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:46,506 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:22:46,507 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:22:46,507 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:22:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:22:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:22:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 845 transitions. [2019-09-10 08:22:46,517 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 845 transitions. Word has length 98 [2019-09-10 08:22:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:46,518 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 845 transitions. [2019-09-10 08:22:46,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 845 transitions. [2019-09-10 08:22:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:46,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:46,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:46,521 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:46,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:46,521 INFO L82 PathProgramCache]: Analyzing trace with hash 350263078, now seen corresponding path program 1 times [2019-09-10 08:22:46,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:46,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:46,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:46,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:46,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:46,701 INFO L87 Difference]: Start difference. First operand 642 states and 845 transitions. Second operand 9 states. [2019-09-10 08:22:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:49,011 INFO L93 Difference]: Finished difference Result 1113 states and 1486 transitions. [2019-09-10 08:22:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:49,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:22:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:49,017 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:22:49,018 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:22:49,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:22:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:22:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 844 transitions. [2019-09-10 08:22:49,027 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 844 transitions. Word has length 98 [2019-09-10 08:22:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:49,028 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 844 transitions. [2019-09-10 08:22:49,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 844 transitions. [2019-09-10 08:22:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:49,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:49,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:49,030 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1857278271, now seen corresponding path program 1 times [2019-09-10 08:22:49,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:49,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:49,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:49,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:49,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:49,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:49,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:49,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:49,252 INFO L87 Difference]: Start difference. First operand 642 states and 844 transitions. Second operand 9 states. [2019-09-10 08:22:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:51,742 INFO L93 Difference]: Finished difference Result 1136 states and 1525 transitions. [2019-09-10 08:22:51,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:51,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:22:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:51,747 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:22:51,748 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:22:51,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:22:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-10 08:22:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 843 transitions. [2019-09-10 08:22:51,760 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 843 transitions. Word has length 98 [2019-09-10 08:22:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:51,760 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 843 transitions. [2019-09-10 08:22:51,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 843 transitions. [2019-09-10 08:22:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:51,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:51,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:51,763 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 647290032, now seen corresponding path program 1 times [2019-09-10 08:22:51,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:51,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:51,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:51,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:51,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:51,972 INFO L87 Difference]: Start difference. First operand 642 states and 843 transitions. Second operand 9 states. [2019-09-10 08:22:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:54,264 INFO L93 Difference]: Finished difference Result 1113 states and 1484 transitions. [2019-09-10 08:22:54,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:54,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:22:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:54,270 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:22:54,270 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:22:54,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:22:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:22:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 842 transitions. [2019-09-10 08:22:54,281 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 842 transitions. Word has length 98 [2019-09-10 08:22:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:54,281 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 842 transitions. [2019-09-10 08:22:54,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 842 transitions. [2019-09-10 08:22:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:54,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:54,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:54,283 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -427429475, now seen corresponding path program 1 times [2019-09-10 08:22:54,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:54,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:54,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:54,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:54,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:54,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:54,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:54,479 INFO L87 Difference]: Start difference. First operand 642 states and 842 transitions. Second operand 9 states. [2019-09-10 08:22:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:56,982 INFO L93 Difference]: Finished difference Result 1129 states and 1508 transitions. [2019-09-10 08:22:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:56,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:22:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:56,989 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:22:56,989 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:22:56,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:22:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:22:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 841 transitions. [2019-09-10 08:22:57,001 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 841 transitions. Word has length 98 [2019-09-10 08:22:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:57,001 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 841 transitions. [2019-09-10 08:22:57,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 841 transitions. [2019-09-10 08:22:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:57,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:57,003 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:57,004 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1254444936, now seen corresponding path program 1 times [2019-09-10 08:22:57,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:57,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:57,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:57,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:57,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:57,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:57,200 INFO L87 Difference]: Start difference. First operand 642 states and 841 transitions. Second operand 9 states. [2019-09-10 08:22:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:59,596 INFO L93 Difference]: Finished difference Result 1113 states and 1481 transitions. [2019-09-10 08:22:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:59,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:22:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:59,604 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:22:59,605 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:22:59,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:22:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:22:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:22:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 840 transitions. [2019-09-10 08:22:59,615 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 840 transitions. Word has length 98 [2019-09-10 08:22:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:59,616 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 840 transitions. [2019-09-10 08:22:59,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 840 transitions. [2019-09-10 08:22:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:22:59,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:59,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:59,618 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash 398268857, now seen corresponding path program 1 times [2019-09-10 08:22:59,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:59,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:59,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:59,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:59,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:59,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:59,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:59,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:59,811 INFO L87 Difference]: Start difference. First operand 642 states and 840 transitions. Second operand 9 states. [2019-09-10 08:23:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:02,157 INFO L93 Difference]: Finished difference Result 1113 states and 1480 transitions. [2019-09-10 08:23:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:02,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:02,163 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:02,163 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:02,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 839 transitions. [2019-09-10 08:23:02,172 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 839 transitions. Word has length 98 [2019-09-10 08:23:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:02,173 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 839 transitions. [2019-09-10 08:23:02,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 839 transitions. [2019-09-10 08:23:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:02,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:02,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:02,175 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:02,176 INFO L82 PathProgramCache]: Analyzing trace with hash -285032083, now seen corresponding path program 1 times [2019-09-10 08:23:02,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:02,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:02,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:02,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:02,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:02,370 INFO L87 Difference]: Start difference. First operand 642 states and 839 transitions. Second operand 9 states. [2019-09-10 08:23:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:04,598 INFO L93 Difference]: Finished difference Result 1113 states and 1479 transitions. [2019-09-10 08:23:04,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:04,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:04,605 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:04,605 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:04,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 838 transitions. [2019-09-10 08:23:04,617 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 838 transitions. Word has length 98 [2019-09-10 08:23:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:04,617 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 838 transitions. [2019-09-10 08:23:04,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 838 transitions. [2019-09-10 08:23:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:04,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:04,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:04,620 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:04,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1992031926, now seen corresponding path program 1 times [2019-09-10 08:23:04,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:04,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:04,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:04,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:04,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:04,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:04,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:04,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:04,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:04,794 INFO L87 Difference]: Start difference. First operand 642 states and 838 transitions. Second operand 9 states. [2019-09-10 08:23:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:07,272 INFO L93 Difference]: Finished difference Result 1129 states and 1502 transitions. [2019-09-10 08:23:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:07,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:07,278 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:23:07,279 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:23:07,279 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:23:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:23:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:23:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 837 transitions. [2019-09-10 08:23:07,290 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 837 transitions. Word has length 98 [2019-09-10 08:23:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:07,290 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 837 transitions. [2019-09-10 08:23:07,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 837 transitions. [2019-09-10 08:23:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:07,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:07,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:07,292 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash 310929269, now seen corresponding path program 1 times [2019-09-10 08:23:07,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:07,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:07,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:07,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:07,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:07,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:07,451 INFO L87 Difference]: Start difference. First operand 642 states and 837 transitions. Second operand 9 states. [2019-09-10 08:23:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:09,883 INFO L93 Difference]: Finished difference Result 1113 states and 1476 transitions. [2019-09-10 08:23:09,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:09,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:09,888 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:09,888 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:09,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 836 transitions. [2019-09-10 08:23:09,899 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 836 transitions. Word has length 98 [2019-09-10 08:23:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:09,900 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 836 transitions. [2019-09-10 08:23:09,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 836 transitions. [2019-09-10 08:23:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:09,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:09,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] [2019-09-10 08:23:09,902 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1777266353, now seen corresponding path program 1 times [2019-09-10 08:23:09,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:09,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:09,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:10,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:23:10,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:10,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:10,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:10,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:10,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:10,164 INFO L87 Difference]: Start difference. First operand 642 states and 836 transitions. Second operand 9 states. [2019-09-10 08:23:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:12,592 INFO L93 Difference]: Finished difference Result 1113 states and 1475 transitions. [2019-09-10 08:23:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:12,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:12,596 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:12,596 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:12,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 835 transitions. [2019-09-10 08:23:12,610 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 835 transitions. Word has length 98 [2019-09-10 08:23:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:12,610 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 835 transitions. [2019-09-10 08:23:12,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 835 transitions. [2019-09-10 08:23:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:12,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:12,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] [2019-09-10 08:23:12,613 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2141043087, now seen corresponding path program 1 times [2019-09-10 08:23:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:12,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:12,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:12,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:12,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:12,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:12,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:12,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:12,790 INFO L87 Difference]: Start difference. First operand 642 states and 835 transitions. Second operand 9 states. [2019-09-10 08:23:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:14,903 INFO L93 Difference]: Finished difference Result 1113 states and 1473 transitions. [2019-09-10 08:23:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:14,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:14,906 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:14,906 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:14,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 834 transitions. [2019-09-10 08:23:14,915 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 834 transitions. Word has length 98 [2019-09-10 08:23:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:14,916 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 834 transitions. [2019-09-10 08:23:14,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 834 transitions. [2019-09-10 08:23:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:14,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:14,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:14,918 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash 600616519, now seen corresponding path program 1 times [2019-09-10 08:23:14,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:14,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:14,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:14,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:14,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:15,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:15,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:15,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:15,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:15,215 INFO L87 Difference]: Start difference. First operand 642 states and 834 transitions. Second operand 9 states. [2019-09-10 08:23:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:17,783 INFO L93 Difference]: Finished difference Result 1113 states and 1472 transitions. [2019-09-10 08:23:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:17,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:17,787 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:17,787 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:17,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2019-09-10 08:23:17,797 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 98 [2019-09-10 08:23:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:17,798 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2019-09-10 08:23:17,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2019-09-10 08:23:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:23:17,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:17,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:17,799 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash 513414431, now seen corresponding path program 1 times [2019-09-10 08:23:17,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:17,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:17,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:17,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:17,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:17,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:17,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:17,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:17,965 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand 9 states. [2019-09-10 08:23:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:20,457 INFO L93 Difference]: Finished difference Result 1113 states and 1470 transitions. [2019-09-10 08:23:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:20,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:23:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:20,461 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:20,461 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:20,462 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:23:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2019-09-10 08:23:20,470 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 98 [2019-09-10 08:23:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:20,470 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2019-09-10 08:23:20,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2019-09-10 08:23:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:23:20,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:20,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:20,472 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash 309455156, now seen corresponding path program 1 times [2019-09-10 08:23:20,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:20,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:20,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:20,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:20,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:20,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:20,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:20,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:20,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:20,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:20,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:20,622 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand 9 states. [2019-09-10 08:23:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:22,688 INFO L93 Difference]: Finished difference Result 1113 states and 1469 transitions. [2019-09-10 08:23:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:22,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:23:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:22,691 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:22,692 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:22,692 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:23:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 831 transitions. [2019-09-10 08:23:22,702 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 831 transitions. Word has length 99 [2019-09-10 08:23:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:22,703 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 831 transitions. [2019-09-10 08:23:22,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 831 transitions. [2019-09-10 08:23:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:22,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:22,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:22,705 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 291193798, now seen corresponding path program 1 times [2019-09-10 08:23:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:22,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:22,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:22,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:22,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:22,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:22,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:22,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:22,881 INFO L87 Difference]: Start difference. First operand 642 states and 831 transitions. Second operand 9 states. [2019-09-10 08:23:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:25,274 INFO L93 Difference]: Finished difference Result 1129 states and 1492 transitions. [2019-09-10 08:23:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:25,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:25,277 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 08:23:25,277 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 08:23:25,278 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:23:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 08:23:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-10 08:23:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 830 transitions. [2019-09-10 08:23:25,289 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 830 transitions. Word has length 100 [2019-09-10 08:23:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:25,289 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 830 transitions. [2019-09-10 08:23:25,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 830 transitions. [2019-09-10 08:23:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:25,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:25,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] [2019-09-10 08:23:25,291 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1700395306, now seen corresponding path program 1 times [2019-09-10 08:23:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:25,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:25,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:25,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:25,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:25,510 INFO L87 Difference]: Start difference. First operand 642 states and 830 transitions. Second operand 9 states. [2019-09-10 08:23:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:27,863 INFO L93 Difference]: Finished difference Result 1081 states and 1415 transitions. [2019-09-10 08:23:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:27,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:27,867 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:27,867 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:27,868 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:23:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 829 transitions. [2019-09-10 08:23:27,880 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 829 transitions. Word has length 100 [2019-09-10 08:23:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:27,881 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 829 transitions. [2019-09-10 08:23:27,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 829 transitions. [2019-09-10 08:23:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:27,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:27,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:27,883 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -10584466, now seen corresponding path program 1 times [2019-09-10 08:23:27,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:27,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:28,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:28,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:28,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:28,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:28,048 INFO L87 Difference]: Start difference. First operand 642 states and 829 transitions. Second operand 9 states. [2019-09-10 08:23:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:30,722 INFO L93 Difference]: Finished difference Result 1113 states and 1466 transitions. [2019-09-10 08:23:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:30,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:30,727 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:30,727 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:30,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 828 transitions. [2019-09-10 08:23:30,739 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 828 transitions. Word has length 100 [2019-09-10 08:23:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:30,739 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 828 transitions. [2019-09-10 08:23:30,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 828 transitions. [2019-09-10 08:23:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:30,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:30,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:30,742 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -906258735, now seen corresponding path program 1 times [2019-09-10 08:23:30,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:30,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:30,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:30,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:30,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:30,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:30,911 INFO L87 Difference]: Start difference. First operand 642 states and 828 transitions. Second operand 9 states. [2019-09-10 08:23:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:33,085 INFO L93 Difference]: Finished difference Result 1113 states and 1464 transitions. [2019-09-10 08:23:33,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:33,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:33,088 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:33,088 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:33,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 827 transitions. [2019-09-10 08:23:33,100 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 827 transitions. Word has length 100 [2019-09-10 08:23:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:33,101 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 827 transitions. [2019-09-10 08:23:33,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 827 transitions. [2019-09-10 08:23:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:33,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:33,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:33,103 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1698897721, now seen corresponding path program 1 times [2019-09-10 08:23:33,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:33,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:33,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:33,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:23:33,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:33,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:33,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:33,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:33,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:33,261 INFO L87 Difference]: Start difference. First operand 642 states and 827 transitions. Second operand 9 states. [2019-09-10 08:23:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:35,731 INFO L93 Difference]: Finished difference Result 1081 states and 1412 transitions. [2019-09-10 08:23:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:35,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:35,735 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:35,736 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:35,736 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:23:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 826 transitions. [2019-09-10 08:23:35,745 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 826 transitions. Word has length 100 [2019-09-10 08:23:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:35,745 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 826 transitions. [2019-09-10 08:23:35,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 826 transitions. [2019-09-10 08:23:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:35,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:35,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:35,748 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -483952406, now seen corresponding path program 1 times [2019-09-10 08:23:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:35,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:35,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:35,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:35,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:35,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:35,905 INFO L87 Difference]: Start difference. First operand 642 states and 826 transitions. Second operand 9 states. [2019-09-10 08:23:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:38,406 INFO L93 Difference]: Finished difference Result 1081 states and 1411 transitions. [2019-09-10 08:23:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:38,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:38,409 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:38,409 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:38,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 825 transitions. [2019-09-10 08:23:38,418 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 825 transitions. Word has length 100 [2019-09-10 08:23:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:38,419 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 825 transitions. [2019-09-10 08:23:38,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 825 transitions. [2019-09-10 08:23:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:38,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:38,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:38,421 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash -18890581, now seen corresponding path program 1 times [2019-09-10 08:23:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:38,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:38,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:23:38,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:38,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:38,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:38,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:38,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:38,574 INFO L87 Difference]: Start difference. First operand 642 states and 825 transitions. Second operand 9 states. [2019-09-10 08:23:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:41,064 INFO L93 Difference]: Finished difference Result 1081 states and 1409 transitions. [2019-09-10 08:23:41,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:41,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:41,066 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:41,066 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:41,067 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:23:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 824 transitions. [2019-09-10 08:23:41,075 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 824 transitions. Word has length 100 [2019-09-10 08:23:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:41,075 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 824 transitions. [2019-09-10 08:23:41,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 824 transitions. [2019-09-10 08:23:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:41,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:41,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:41,077 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 827980610, now seen corresponding path program 1 times [2019-09-10 08:23:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:41,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:41,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:41,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:41,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:41,232 INFO L87 Difference]: Start difference. First operand 642 states and 824 transitions. Second operand 9 states. [2019-09-10 08:23:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:43,641 INFO L93 Difference]: Finished difference Result 1081 states and 1408 transitions. [2019-09-10 08:23:43,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:43,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:43,643 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:43,643 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:43,644 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:23:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 823 transitions. [2019-09-10 08:23:43,650 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 823 transitions. Word has length 100 [2019-09-10 08:23:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:43,651 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 823 transitions. [2019-09-10 08:23:43,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 823 transitions. [2019-09-10 08:23:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:43,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:43,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:43,653 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash -142106022, now seen corresponding path program 1 times [2019-09-10 08:23:43,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:43,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:43,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:43,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:43,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:43,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:43,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:43,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:43,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:43,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:43,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:43,835 INFO L87 Difference]: Start difference. First operand 642 states and 823 transitions. Second operand 9 states. [2019-09-10 08:23:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:46,227 INFO L93 Difference]: Finished difference Result 1113 states and 1456 transitions. [2019-09-10 08:23:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:46,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:46,229 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:23:46,229 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:23:46,229 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:23:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:23:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:23:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2019-09-10 08:23:46,239 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 100 [2019-09-10 08:23:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:46,240 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2019-09-10 08:23:46,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2019-09-10 08:23:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:46,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:46,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:46,242 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2085388437, now seen corresponding path program 1 times [2019-09-10 08:23:46,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:46,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:46,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:46,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:46,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:46,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:46,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:46,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:46,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:46,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:46,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:46,401 INFO L87 Difference]: Start difference. First operand 642 states and 822 transitions. Second operand 9 states. [2019-09-10 08:23:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:48,870 INFO L93 Difference]: Finished difference Result 1081 states and 1405 transitions. [2019-09-10 08:23:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:48,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:48,872 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:48,872 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:48,873 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:23:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 821 transitions. [2019-09-10 08:23:48,881 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 821 transitions. Word has length 100 [2019-09-10 08:23:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:48,881 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 821 transitions. [2019-09-10 08:23:48,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 821 transitions. [2019-09-10 08:23:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:48,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:48,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:48,883 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -209751473, now seen corresponding path program 1 times [2019-09-10 08:23:48,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:48,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:49,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:49,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:49,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:49,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:49,047 INFO L87 Difference]: Start difference. First operand 642 states and 821 transitions. Second operand 9 states. [2019-09-10 08:23:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:51,342 INFO L93 Difference]: Finished difference Result 1081 states and 1404 transitions. [2019-09-10 08:23:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:51,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:51,346 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:51,346 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:51,346 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:23:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 820 transitions. [2019-09-10 08:23:51,354 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 820 transitions. Word has length 100 [2019-09-10 08:23:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:51,355 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 820 transitions. [2019-09-10 08:23:51,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 820 transitions. [2019-09-10 08:23:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:51,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:51,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:51,356 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -120851267, now seen corresponding path program 1 times [2019-09-10 08:23:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:51,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:51,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:51,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:51,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:51,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:51,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:51,516 INFO L87 Difference]: Start difference. First operand 642 states and 820 transitions. Second operand 9 states. [2019-09-10 08:23:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:54,003 INFO L93 Difference]: Finished difference Result 1081 states and 1402 transitions. [2019-09-10 08:23:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:54,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:54,006 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:54,006 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:54,006 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:23:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 819 transitions. [2019-09-10 08:23:54,013 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 819 transitions. Word has length 100 [2019-09-10 08:23:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:54,014 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 819 transitions. [2019-09-10 08:23:54,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 819 transitions. [2019-09-10 08:23:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:54,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:54,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:54,015 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1880101188, now seen corresponding path program 1 times [2019-09-10 08:23:54,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:54,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:54,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:54,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:54,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:54,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:54,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:54,207 INFO L87 Difference]: Start difference. First operand 642 states and 819 transitions. Second operand 9 states. [2019-09-10 08:23:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:56,636 INFO L93 Difference]: Finished difference Result 1081 states and 1401 transitions. [2019-09-10 08:23:56,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:56,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:56,638 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:56,638 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:56,639 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:23:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 818 transitions. [2019-09-10 08:23:56,647 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 818 transitions. Word has length 100 [2019-09-10 08:23:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:56,647 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 818 transitions. [2019-09-10 08:23:56,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 818 transitions. [2019-09-10 08:23:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:56,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:56,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:56,649 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1432903500, now seen corresponding path program 1 times [2019-09-10 08:23:56,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:56,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:56,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:56,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:56,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:56,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:56,798 INFO L87 Difference]: Start difference. First operand 642 states and 818 transitions. Second operand 9 states. [2019-09-10 08:23:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:59,245 INFO L93 Difference]: Finished difference Result 1081 states and 1399 transitions. [2019-09-10 08:23:59,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:59,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:23:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:59,247 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:23:59,248 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:23:59,248 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:23:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:23:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:23:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:23:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 817 transitions. [2019-09-10 08:23:59,255 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 817 transitions. Word has length 100 [2019-09-10 08:23:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:59,255 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 817 transitions. [2019-09-10 08:23:59,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 817 transitions. [2019-09-10 08:23:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:23:59,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:59,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:59,257 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash 53028367, now seen corresponding path program 1 times [2019-09-10 08:23:59,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:59,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:59,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:59,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:59,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:59,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:59,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:59,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:59,408 INFO L87 Difference]: Start difference. First operand 642 states and 817 transitions. Second operand 9 states. [2019-09-10 08:24:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:01,765 INFO L93 Difference]: Finished difference Result 1081 states and 1398 transitions. [2019-09-10 08:24:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:01,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:01,768 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:01,768 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:01,769 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:24:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 816 transitions. [2019-09-10 08:24:01,776 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 816 transitions. Word has length 100 [2019-09-10 08:24:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:01,777 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 816 transitions. [2019-09-10 08:24:01,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 816 transitions. [2019-09-10 08:24:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:01,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:01,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] [2019-09-10 08:24:01,778 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1991382183, now seen corresponding path program 1 times [2019-09-10 08:24:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:01,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:01,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:01,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:01,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:01,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:01,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:01,923 INFO L87 Difference]: Start difference. First operand 642 states and 816 transitions. Second operand 9 states. [2019-09-10 08:24:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:04,318 INFO L93 Difference]: Finished difference Result 1113 states and 1445 transitions. [2019-09-10 08:24:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:04,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:04,321 INFO L225 Difference]: With dead ends: 1113 [2019-09-10 08:24:04,321 INFO L226 Difference]: Without dead ends: 1113 [2019-09-10 08:24:04,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-10 08:24:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-10 08:24:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 815 transitions. [2019-09-10 08:24:04,328 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 815 transitions. Word has length 100 [2019-09-10 08:24:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:04,328 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 815 transitions. [2019-09-10 08:24:04,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 815 transitions. [2019-09-10 08:24:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:04,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:04,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:04,330 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:04,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1942716530, now seen corresponding path program 1 times [2019-09-10 08:24:04,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:04,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:04,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:04,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:04,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:04,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:04,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:04,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:04,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:04,489 INFO L87 Difference]: Start difference. First operand 642 states and 815 transitions. Second operand 9 states. [2019-09-10 08:24:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:07,167 INFO L93 Difference]: Finished difference Result 1081 states and 1395 transitions. [2019-09-10 08:24:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:07,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:07,169 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:07,169 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:07,170 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:24:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 814 transitions. [2019-09-10 08:24:07,177 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 814 transitions. Word has length 100 [2019-09-10 08:24:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:07,177 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 814 transitions. [2019-09-10 08:24:07,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 814 transitions. [2019-09-10 08:24:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:07,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:07,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] [2019-09-10 08:24:07,179 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash -899406943, now seen corresponding path program 1 times [2019-09-10 08:24:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:07,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:07,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:07,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:07,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:07,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:07,312 INFO L87 Difference]: Start difference. First operand 642 states and 814 transitions. Second operand 9 states. [2019-09-10 08:24:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:09,620 INFO L93 Difference]: Finished difference Result 1081 states and 1394 transitions. [2019-09-10 08:24:09,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:09,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:09,622 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:09,622 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:09,623 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:24:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 813 transitions. [2019-09-10 08:24:09,631 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 813 transitions. Word has length 100 [2019-09-10 08:24:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:09,631 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 813 transitions. [2019-09-10 08:24:09,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 813 transitions. [2019-09-10 08:24:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:09,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:09,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:09,633 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash 410796862, now seen corresponding path program 1 times [2019-09-10 08:24:09,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:09,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:09,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:09,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:09,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:09,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:09,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:09,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:09,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:09,775 INFO L87 Difference]: Start difference. First operand 642 states and 813 transitions. Second operand 9 states. [2019-09-10 08:24:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:12,065 INFO L93 Difference]: Finished difference Result 1081 states and 1393 transitions. [2019-09-10 08:24:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:12,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:12,068 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:12,068 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:12,069 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:24:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 812 transitions. [2019-09-10 08:24:12,077 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 812 transitions. Word has length 100 [2019-09-10 08:24:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:12,077 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 812 transitions. [2019-09-10 08:24:12,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 812 transitions. [2019-09-10 08:24:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:12,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:12,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:12,079 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash -279511526, now seen corresponding path program 1 times [2019-09-10 08:24:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:12,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:12,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:12,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:12,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:12,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:12,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:12,225 INFO L87 Difference]: Start difference. First operand 642 states and 812 transitions. Second operand 9 states. [2019-09-10 08:24:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:14,724 INFO L93 Difference]: Finished difference Result 1081 states and 1391 transitions. [2019-09-10 08:24:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:14,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:14,726 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:14,726 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:14,727 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:24:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 811 transitions. [2019-09-10 08:24:14,735 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 811 transitions. Word has length 100 [2019-09-10 08:24:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:14,736 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 811 transitions. [2019-09-10 08:24:14,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 811 transitions. [2019-09-10 08:24:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:14,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:14,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] [2019-09-10 08:24:14,738 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash -188121012, now seen corresponding path program 1 times [2019-09-10 08:24:14,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:14,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:14,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:14,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:14,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:14,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:14,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:14,913 INFO L87 Difference]: Start difference. First operand 642 states and 811 transitions. Second operand 9 states. [2019-09-10 08:24:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:17,051 INFO L93 Difference]: Finished difference Result 1081 states and 1389 transitions. [2019-09-10 08:24:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:17,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:17,053 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:17,053 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:17,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 810 transitions. [2019-09-10 08:24:17,061 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 810 transitions. Word has length 100 [2019-09-10 08:24:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:17,061 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 810 transitions. [2019-09-10 08:24:17,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 810 transitions. [2019-09-10 08:24:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:17,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:17,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:17,062 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:17,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1783081460, now seen corresponding path program 1 times [2019-09-10 08:24:17,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:17,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:17,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:17,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:17,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:17,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:17,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:17,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:17,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:17,221 INFO L87 Difference]: Start difference. First operand 642 states and 810 transitions. Second operand 9 states. [2019-09-10 08:24:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:19,534 INFO L93 Difference]: Finished difference Result 1081 states and 1387 transitions. [2019-09-10 08:24:19,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:19,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:19,536 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:19,536 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:19,536 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:24:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 809 transitions. [2019-09-10 08:24:19,543 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 809 transitions. Word has length 100 [2019-09-10 08:24:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:19,543 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 809 transitions. [2019-09-10 08:24:19,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 809 transitions. [2019-09-10 08:24:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:19,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:19,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:19,545 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash -902270955, now seen corresponding path program 1 times [2019-09-10 08:24:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:19,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:19,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:19,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:19,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:19,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:19,682 INFO L87 Difference]: Start difference. First operand 642 states and 809 transitions. Second operand 9 states. [2019-09-10 08:24:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:21,807 INFO L93 Difference]: Finished difference Result 1081 states and 1386 transitions. [2019-09-10 08:24:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:21,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:21,809 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:21,810 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:21,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 808 transitions. [2019-09-10 08:24:21,816 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 808 transitions. Word has length 100 [2019-09-10 08:24:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:21,817 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 808 transitions. [2019-09-10 08:24:21,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 808 transitions. [2019-09-10 08:24:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:21,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:21,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:21,818 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:21,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash 535576962, now seen corresponding path program 1 times [2019-09-10 08:24:21,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:21,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:21,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:21,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:21,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:21,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:21,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:21,943 INFO L87 Difference]: Start difference. First operand 642 states and 808 transitions. Second operand 9 states. [2019-09-10 08:24:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:24,167 INFO L93 Difference]: Finished difference Result 1081 states and 1384 transitions. [2019-09-10 08:24:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:24,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:24,170 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:24,170 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:24,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 807 transitions. [2019-09-10 08:24:24,180 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 807 transitions. Word has length 100 [2019-09-10 08:24:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:24,180 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 807 transitions. [2019-09-10 08:24:24,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 807 transitions. [2019-09-10 08:24:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:24:24,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:24,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] [2019-09-10 08:24:24,182 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1553613818, now seen corresponding path program 1 times [2019-09-10 08:24:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:24,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:24,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:24,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:24,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:24,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:24,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:24,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:24,336 INFO L87 Difference]: Start difference. First operand 642 states and 807 transitions. Second operand 9 states. [2019-09-10 08:24:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:26,466 INFO L93 Difference]: Finished difference Result 1081 states and 1382 transitions. [2019-09-10 08:24:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:26,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:24:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:26,468 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:24:26,468 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:24:26,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:24:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-10 08:24:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-10 08:24:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 806 transitions. [2019-09-10 08:24:26,476 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 806 transitions. Word has length 100 [2019-09-10 08:24:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:26,476 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 806 transitions. [2019-09-10 08:24:26,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 806 transitions. [2019-09-10 08:24:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:24:26,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:26,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:26,478 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1511064327, now seen corresponding path program 1 times [2019-09-10 08:24:26,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:26,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:26,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:26,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:26,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:26,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:26,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:26,609 INFO L87 Difference]: Start difference. First operand 642 states and 806 transitions. Second operand 9 states. [2019-09-10 08:24:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:28,784 INFO L93 Difference]: Finished difference Result 1080 states and 1380 transitions. [2019-09-10 08:24:28,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:28,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:24:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:28,786 INFO L225 Difference]: With dead ends: 1080 [2019-09-10 08:24:28,786 INFO L226 Difference]: Without dead ends: 1080 [2019-09-10 08:24:28,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2019-09-10 08:24:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 641. [2019-09-10 08:24:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 08:24:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 804 transitions. [2019-09-10 08:24:28,793 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 804 transitions. Word has length 101 [2019-09-10 08:24:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:28,793 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 804 transitions. [2019-09-10 08:24:28,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 804 transitions. [2019-09-10 08:24:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:24:28,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:28,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:28,795 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2123623915, now seen corresponding path program 1 times [2019-09-10 08:24:28,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:28,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:28,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:28,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:28,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:28,920 INFO L87 Difference]: Start difference. First operand 641 states and 804 transitions. Second operand 9 states. [2019-09-10 08:24:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:31,118 INFO L93 Difference]: Finished difference Result 1080 states and 1379 transitions. [2019-09-10 08:24:31,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:31,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:24:31,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:31,120 INFO L225 Difference]: With dead ends: 1080 [2019-09-10 08:24:31,120 INFO L226 Difference]: Without dead ends: 1080 [2019-09-10 08:24:31,120 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:24:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2019-09-10 08:24:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 641. [2019-09-10 08:24:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 08:24:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 803 transitions. [2019-09-10 08:24:31,129 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 803 transitions. Word has length 101 [2019-09-10 08:24:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:31,129 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 803 transitions. [2019-09-10 08:24:31,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 803 transitions. [2019-09-10 08:24:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:24:31,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:31,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:31,131 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash -686829505, now seen corresponding path program 1 times [2019-09-10 08:24:31,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:31,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:31,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:31,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:31,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:31,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:31,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:31,255 INFO L87 Difference]: Start difference. First operand 641 states and 803 transitions. Second operand 9 states. [2019-09-10 08:24:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:33,526 INFO L93 Difference]: Finished difference Result 1079 states and 1377 transitions. [2019-09-10 08:24:33,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:33,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:24:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:33,528 INFO L225 Difference]: With dead ends: 1079 [2019-09-10 08:24:33,528 INFO L226 Difference]: Without dead ends: 1079 [2019-09-10 08:24:33,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-10 08:24:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 640. [2019-09-10 08:24:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-10 08:24:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 801 transitions. [2019-09-10 08:24:33,535 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 801 transitions. Word has length 101 [2019-09-10 08:24:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:33,536 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 801 transitions. [2019-09-10 08:24:33,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 801 transitions. [2019-09-10 08:24:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:24:33,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:33,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:33,537 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:33,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1381337777, now seen corresponding path program 1 times [2019-09-10 08:24:33,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:33,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:33,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:33,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:33,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:33,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:33,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:33,695 INFO L87 Difference]: Start difference. First operand 640 states and 801 transitions. Second operand 9 states. [2019-09-10 08:24:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:35,973 INFO L93 Difference]: Finished difference Result 1077 states and 1373 transitions. [2019-09-10 08:24:35,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:35,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:24:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:35,975 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:24:35,975 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:24:35,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:24:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:24:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:24:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 799 transitions. [2019-09-10 08:24:35,984 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 799 transitions. Word has length 101 [2019-09-10 08:24:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:35,984 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 799 transitions. [2019-09-10 08:24:35,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 799 transitions. [2019-09-10 08:24:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:24:35,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:35,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:35,986 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash -312727000, now seen corresponding path program 1 times [2019-09-10 08:24:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:35,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:35,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:36,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:36,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:36,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:36,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:36,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:36,105 INFO L87 Difference]: Start difference. First operand 639 states and 799 transitions. Second operand 9 states. [2019-09-10 08:24:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:38,264 INFO L93 Difference]: Finished difference Result 1077 states and 1372 transitions. [2019-09-10 08:24:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:38,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:24:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:38,266 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 08:24:38,266 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 08:24:38,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 08:24:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-10 08:24:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 08:24:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 798 transitions. [2019-09-10 08:24:38,272 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 798 transitions. Word has length 101 [2019-09-10 08:24:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:38,273 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 798 transitions. [2019-09-10 08:24:38,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 798 transitions. [2019-09-10 08:24:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:24:38,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:38,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:38,274 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash -69019033, now seen corresponding path program 1 times [2019-09-10 08:24:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:38,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:38,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:38,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:38,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:38,395 INFO L87 Difference]: Start difference. First operand 639 states and 798 transitions. Second operand 9 states. [2019-09-10 08:24:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:40,380 INFO L93 Difference]: Finished difference Result 1076 states and 1370 transitions. [2019-09-10 08:24:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:40,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:24:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:40,383 INFO L225 Difference]: With dead ends: 1076 [2019-09-10 08:24:40,383 INFO L226 Difference]: Without dead ends: 1076 [2019-09-10 08:24:40,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-10 08:24:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 638. [2019-09-10 08:24:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-10 08:24:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 796 transitions. [2019-09-10 08:24:40,389 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 796 transitions. Word has length 101 [2019-09-10 08:24:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:40,389 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 796 transitions. [2019-09-10 08:24:40,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 796 transitions. [2019-09-10 08:24:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:24:40,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:40,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:40,391 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1147136159, now seen corresponding path program 1 times [2019-09-10 08:24:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:40,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:40,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:40,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:41,598 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:24:41,751 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:24:41,908 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:24:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:43,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:43,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:24:43,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:43,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:24:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:24:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:24:43,355 INFO L87 Difference]: Start difference. First operand 638 states and 796 transitions. Second operand 31 states. [2019-09-10 08:24:43,569 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:24:44,655 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:24:44,822 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:24:45,253 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:24:45,565 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:24:45,923 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:24:46,348 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-09-10 08:24:46,889 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2019-09-10 08:24:47,173 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:24:47,443 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:24:47,761 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:24:59,037 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:25:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:00,663 INFO L93 Difference]: Finished difference Result 1243 states and 1554 transitions. [2019-09-10 08:25:00,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:25:00,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-10 08:25:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:00,665 INFO L225 Difference]: With dead ends: 1243 [2019-09-10 08:25:00,665 INFO L226 Difference]: Without dead ends: 1243 [2019-09-10 08:25:00,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:25:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-10 08:25:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 663. [2019-09-10 08:25:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-10 08:25:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 829 transitions. [2019-09-10 08:25:00,677 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 829 transitions. Word has length 102 [2019-09-10 08:25:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:00,678 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 829 transitions. [2019-09-10 08:25:00,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:25:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 829 transitions. [2019-09-10 08:25:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:00,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:00,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:00,680 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash -80543799, now seen corresponding path program 1 times [2019-09-10 08:25:00,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:00,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:00,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:01,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:01,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:25:01,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:01,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:25:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:25:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:01,411 INFO L87 Difference]: Start difference. First operand 663 states and 829 transitions. Second operand 17 states. [2019-09-10 08:25:02,002 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:25:02,731 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 08:25:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:05,229 INFO L93 Difference]: Finished difference Result 1233 states and 1575 transitions. [2019-09-10 08:25:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:25:05,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:25:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:05,231 INFO L225 Difference]: With dead ends: 1233 [2019-09-10 08:25:05,232 INFO L226 Difference]: Without dead ends: 1233 [2019-09-10 08:25:05,232 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:25:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-09-10 08:25:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 652. [2019-09-10 08:25:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-10 08:25:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 814 transitions. [2019-09-10 08:25:05,243 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 814 transitions. Word has length 102 [2019-09-10 08:25:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:05,243 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 814 transitions. [2019-09-10 08:25:05,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:25:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 814 transitions. [2019-09-10 08:25:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:05,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:05,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:05,245 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1830092596, now seen corresponding path program 1 times [2019-09-10 08:25:05,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:05,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:05,935 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:25:06,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:25:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:06,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:25:06,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:06,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:25:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:25:06,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:25:06,579 INFO L87 Difference]: Start difference. First operand 652 states and 814 transitions. Second operand 22 states. [2019-09-10 08:25:07,579 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:25:07,840 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 08:25:08,152 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 08:25:08,321 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:25:08,695 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 08:25:09,184 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 08:25:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:12,943 INFO L93 Difference]: Finished difference Result 1245 states and 1573 transitions. [2019-09-10 08:25:12,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:25:12,944 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-10 08:25:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:12,946 INFO L225 Difference]: With dead ends: 1245 [2019-09-10 08:25:12,946 INFO L226 Difference]: Without dead ends: 1245 [2019-09-10 08:25:12,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:25:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-10 08:25:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 658. [2019-09-10 08:25:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-10 08:25:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 820 transitions. [2019-09-10 08:25:12,956 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 820 transitions. Word has length 102 [2019-09-10 08:25:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:12,957 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 820 transitions. [2019-09-10 08:25:12,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:25:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 820 transitions. [2019-09-10 08:25:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:12,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:12,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, 1, 1, 1] [2019-09-10 08:25:12,959 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash 562528111, now seen corresponding path program 1 times [2019-09-10 08:25:12,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:12,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:16,202 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:25:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:16,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:16,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:25:16,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:16,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:25:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:25:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:25:16,983 INFO L87 Difference]: Start difference. First operand 658 states and 820 transitions. Second operand 26 states. [2019-09-10 08:25:17,130 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:25:18,159 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:25:18,468 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:25:18,907 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 08:25:19,647 WARN L188 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 120 [2019-09-10 08:25:19,870 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:25:20,090 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:25:20,397 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:25:23,677 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:25:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:32,164 INFO L93 Difference]: Finished difference Result 1771 states and 2219 transitions. [2019-09-10 08:25:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:25:32,165 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-09-10 08:25:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:32,166 INFO L225 Difference]: With dead ends: 1771 [2019-09-10 08:25:32,167 INFO L226 Difference]: Without dead ends: 1771 [2019-09-10 08:25:32,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=418, Invalid=1934, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:25:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2019-09-10 08:25:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 671. [2019-09-10 08:25:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-10 08:25:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 838 transitions. [2019-09-10 08:25:32,177 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 838 transitions. Word has length 102 [2019-09-10 08:25:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:32,177 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 838 transitions. [2019-09-10 08:25:32,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:25:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 838 transitions. [2019-09-10 08:25:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:32,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:32,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, 1] [2019-09-10 08:25:32,179 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1027137318, now seen corresponding path program 1 times [2019-09-10 08:25:32,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:32,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:32,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:25:32,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:32,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:25:32,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:25:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:32,895 INFO L87 Difference]: Start difference. First operand 671 states and 838 transitions. Second operand 17 states. [2019-09-10 08:25:33,501 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:25:33,643 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:25:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:36,548 INFO L93 Difference]: Finished difference Result 1221 states and 1558 transitions. [2019-09-10 08:25:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:25:36,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:25:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:36,551 INFO L225 Difference]: With dead ends: 1221 [2019-09-10 08:25:36,551 INFO L226 Difference]: Without dead ends: 1221 [2019-09-10 08:25:36,551 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:25:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-10 08:25:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 651. [2019-09-10 08:25:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 08:25:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 809 transitions. [2019-09-10 08:25:36,564 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 809 transitions. Word has length 102 [2019-09-10 08:25:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:36,565 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 809 transitions. [2019-09-10 08:25:36,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:25:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 809 transitions. [2019-09-10 08:25:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:36,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:36,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:36,567 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash 372185749, now seen corresponding path program 1 times [2019-09-10 08:25:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:36,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:37,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:37,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:25:37,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:37,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:25:37,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:25:37,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:25:37,306 INFO L87 Difference]: Start difference. First operand 651 states and 809 transitions. Second operand 16 states. [2019-09-10 08:25:38,008 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:25:38,149 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:25:38,285 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:25:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:41,953 INFO L93 Difference]: Finished difference Result 1127 states and 1368 transitions. [2019-09-10 08:25:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:25:41,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2019-09-10 08:25:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:41,955 INFO L225 Difference]: With dead ends: 1127 [2019-09-10 08:25:41,956 INFO L226 Difference]: Without dead ends: 1127 [2019-09-10 08:25:41,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:25:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-09-10 08:25:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 674. [2019-09-10 08:25:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-10 08:25:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 841 transitions. [2019-09-10 08:25:41,965 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 841 transitions. Word has length 102 [2019-09-10 08:25:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:41,965 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 841 transitions. [2019-09-10 08:25:41,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:25:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 841 transitions. [2019-09-10 08:25:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:41,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:41,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:41,967 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:41,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:41,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1173487299, now seen corresponding path program 1 times [2019-09-10 08:25:41,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:41,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:41,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:43,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:43,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:25:43,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:43,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:25:43,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:25:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:25:43,335 INFO L87 Difference]: Start difference. First operand 674 states and 841 transitions. Second operand 22 states. [2019-09-10 08:25:44,384 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 08:25:44,661 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 08:25:45,030 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 08:25:45,209 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:25:45,454 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:25:45,716 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:25:45,865 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:25:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:48,995 INFO L93 Difference]: Finished difference Result 1281 states and 1612 transitions. [2019-09-10 08:25:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:25:48,996 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-10 08:25:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:48,997 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 08:25:48,998 INFO L226 Difference]: Without dead ends: 1281 [2019-09-10 08:25:48,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:25:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-10 08:25:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 686. [2019-09-10 08:25:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-09-10 08:25:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 853 transitions. [2019-09-10 08:25:49,006 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 853 transitions. Word has length 102 [2019-09-10 08:25:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:49,006 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 853 transitions. [2019-09-10 08:25:49,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:25:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 853 transitions. [2019-09-10 08:25:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:25:49,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:49,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:49,007 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1827059128, now seen corresponding path program 1 times [2019-09-10 08:25:49,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:49,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:49,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:50,082 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:25:50,226 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:25:50,371 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:25:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:51,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:51,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:25:51,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:51,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:25:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:25:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:25:51,651 INFO L87 Difference]: Start difference. First operand 686 states and 853 transitions. Second operand 31 states. [2019-09-10 08:25:51,858 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 08:25:52,897 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-10 08:25:53,071 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 08:25:53,247 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 08:25:53,570 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 08:25:54,048 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:25:54,412 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:25:54,840 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:25:55,842 WARN L188 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-09-10 08:25:56,169 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:25:56,472 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:25:56,833 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:25:57,193 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-10 08:25:57,858 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 08:25:58,317 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 08:25:58,735 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 08:25:59,137 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 08:25:59,962 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:26:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:12,007 INFO L93 Difference]: Finished difference Result 1423 states and 1746 transitions. [2019-09-10 08:26:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:26:12,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-10 08:26:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:12,009 INFO L225 Difference]: With dead ends: 1423 [2019-09-10 08:26:12,009 INFO L226 Difference]: Without dead ends: 1423 [2019-09-10 08:26:12,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 08:26:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-10 08:26:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 700. [2019-09-10 08:26:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-10 08:26:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 869 transitions. [2019-09-10 08:26:12,018 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 869 transitions. Word has length 102 [2019-09-10 08:26:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:12,018 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 869 transitions. [2019-09-10 08:26:12,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:26:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 869 transitions. [2019-09-10 08:26:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:26:12,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:12,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:12,020 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -337214839, now seen corresponding path program 1 times [2019-09-10 08:26:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:12,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:12,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:12,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:26:12,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:12,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:26:12,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:26:12,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:26:12,763 INFO L87 Difference]: Start difference. First operand 700 states and 869 transitions. Second operand 17 states. [2019-09-10 08:26:13,429 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:26:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:15,646 INFO L93 Difference]: Finished difference Result 1246 states and 1587 transitions. [2019-09-10 08:26:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:26:15,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:26:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:15,648 INFO L225 Difference]: With dead ends: 1246 [2019-09-10 08:26:15,648 INFO L226 Difference]: Without dead ends: 1246 [2019-09-10 08:26:15,649 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:26:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-09-10 08:26:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 668. [2019-09-10 08:26:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 08:26:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 827 transitions. [2019-09-10 08:26:15,656 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 827 transitions. Word has length 102 [2019-09-10 08:26:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:15,656 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 827 transitions. [2019-09-10 08:26:15,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:26:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 827 transitions. [2019-09-10 08:26:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:26:15,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:15,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:15,657 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1275780606, now seen corresponding path program 1 times [2019-09-10 08:26:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:15,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:16,521 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:26:16,675 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:26:16,834 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:26:17,020 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:26:18,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:26:18,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:18,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:26:18,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:18,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:26:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:26:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:26:18,115 INFO L87 Difference]: Start difference. First operand 668 states and 827 transitions. Second operand 30 states. [2019-09-10 08:26:18,326 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-10 08:26:19,317 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 08:26:19,501 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 08:26:19,796 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-09-10 08:26:20,294 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-09-10 08:26:20,714 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2019-09-10 08:26:21,193 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 95 [2019-09-10 08:26:21,844 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 105 [2019-09-10 08:26:22,169 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:26:22,469 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:26:22,762 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:26:23,028 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 08:26:23,274 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 08:26:23,674 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-10 08:26:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:36,485 INFO L93 Difference]: Finished difference Result 1466 states and 1814 transitions. [2019-09-10 08:26:36,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:26:36,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 102 [2019-09-10 08:26:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:36,488 INFO L225 Difference]: With dead ends: 1466 [2019-09-10 08:26:36,488 INFO L226 Difference]: Without dead ends: 1466 [2019-09-10 08:26:36,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:26:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-09-10 08:26:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 684. [2019-09-10 08:26:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-10 08:26:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 845 transitions. [2019-09-10 08:26:36,497 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 845 transitions. Word has length 102 [2019-09-10 08:26:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:36,497 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 845 transitions. [2019-09-10 08:26:36,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:26:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 845 transitions. [2019-09-10 08:26:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:26:36,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:36,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:36,499 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash 818309933, now seen corresponding path program 1 times [2019-09-10 08:26:36,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:36,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:36,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:36,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:37,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:37,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:26:37,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:37,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:26:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:26:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:26:37,572 INFO L87 Difference]: Start difference. First operand 684 states and 845 transitions. Second operand 20 states. [2019-09-10 08:26:38,547 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 08:26:38,782 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:26:38,997 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:26:39,178 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:26:39,355 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:26:39,501 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:26:39,661 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:26:39,900 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:26:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:43,734 INFO L93 Difference]: Finished difference Result 1301 states and 1606 transitions. [2019-09-10 08:26:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:26:43,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 102 [2019-09-10 08:26:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:43,737 INFO L225 Difference]: With dead ends: 1301 [2019-09-10 08:26:43,737 INFO L226 Difference]: Without dead ends: 1301 [2019-09-10 08:26:43,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:26:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-09-10 08:26:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 674. [2019-09-10 08:26:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-10 08:26:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 833 transitions. [2019-09-10 08:26:43,747 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 833 transitions. Word has length 102 [2019-09-10 08:26:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:43,747 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 833 transitions. [2019-09-10 08:26:43,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:26:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 833 transitions. [2019-09-10 08:26:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:26:43,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:43,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:43,749 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2057276911, now seen corresponding path program 1 times [2019-09-10 08:26:43,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:43,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:43,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:44,903 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:26:45,060 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:26:45,218 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:26:45,366 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:26:45,519 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:26:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:46,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-10 08:26:46,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:46,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 08:26:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 08:26:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:26:46,745 INFO L87 Difference]: Start difference. First operand 674 states and 833 transitions. Second operand 32 states. [2019-09-10 08:26:46,956 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-10 08:26:47,995 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 08:26:48,178 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:26:48,427 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 08:26:49,131 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 97 [2019-09-10 08:26:49,579 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2019-09-10 08:26:50,094 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 99 [2019-09-10 08:26:50,696 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 111 [2019-09-10 08:26:51,396 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-09-10 08:26:51,712 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-10 08:26:52,062 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-09-10 08:26:52,427 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-09-10 08:26:52,751 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-10 08:26:53,106 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-10 08:26:53,580 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-10 08:27:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:04,639 INFO L93 Difference]: Finished difference Result 1170 states and 1446 transitions. [2019-09-10 08:27:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:27:04,639 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-09-10 08:27:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:04,641 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:27:04,641 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:27:04,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=572, Invalid=2184, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:27:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:27:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 690. [2019-09-10 08:27:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-10 08:27:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 851 transitions. [2019-09-10 08:27:04,649 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 851 transitions. Word has length 102 [2019-09-10 08:27:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:04,649 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 851 transitions. [2019-09-10 08:27:04,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 08:27:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 851 transitions. [2019-09-10 08:27:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:27:04,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:04,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:04,651 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1985149574, now seen corresponding path program 1 times [2019-09-10 08:27:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:04,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:04,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:05,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:27:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:27:05,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:05,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:27:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:27:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:05,620 INFO L87 Difference]: Start difference. First operand 690 states and 851 transitions. Second operand 17 states. [2019-09-10 08:27:06,297 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:27:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:10,558 INFO L93 Difference]: Finished difference Result 1192 states and 1507 transitions. [2019-09-10 08:27:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:27:10,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:27:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:10,561 INFO L225 Difference]: With dead ends: 1192 [2019-09-10 08:27:10,561 INFO L226 Difference]: Without dead ends: 1192 [2019-09-10 08:27:10,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:27:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-09-10 08:27:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 690. [2019-09-10 08:27:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-10 08:27:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 849 transitions. [2019-09-10 08:27:10,567 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 849 transitions. Word has length 102 [2019-09-10 08:27:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:10,568 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 849 transitions. [2019-09-10 08:27:10,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:27:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 849 transitions. [2019-09-10 08:27:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:27:10,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:10,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:10,569 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash 578828359, now seen corresponding path program 1 times [2019-09-10 08:27:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:10,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:11,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:27:11,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:11,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:27:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:27:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:11,359 INFO L87 Difference]: Start difference. First operand 690 states and 849 transitions. Second operand 17 states. [2019-09-10 08:27:11,950 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:27:12,093 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:27:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:13,881 INFO L93 Difference]: Finished difference Result 1131 states and 1427 transitions. [2019-09-10 08:27:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:27:13,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:27:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:13,884 INFO L225 Difference]: With dead ends: 1131 [2019-09-10 08:27:13,884 INFO L226 Difference]: Without dead ends: 1131 [2019-09-10 08:27:13,884 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:27:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2019-09-10 08:27:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 634. [2019-09-10 08:27:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-10 08:27:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 775 transitions. [2019-09-10 08:27:13,891 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 775 transitions. Word has length 102 [2019-09-10 08:27:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:13,891 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 775 transitions. [2019-09-10 08:27:13,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:27:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 775 transitions. [2019-09-10 08:27:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:13,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:13,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:13,893 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2017856453, now seen corresponding path program 1 times [2019-09-10 08:27:13,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:13,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:13,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:13,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:14,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:14,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:14,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:14,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:14,077 INFO L87 Difference]: Start difference. First operand 634 states and 775 transitions. Second operand 9 states. [2019-09-10 08:27:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:15,860 INFO L93 Difference]: Finished difference Result 1053 states and 1331 transitions. [2019-09-10 08:27:15,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:15,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:27:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:15,863 INFO L225 Difference]: With dead ends: 1053 [2019-09-10 08:27:15,863 INFO L226 Difference]: Without dead ends: 1053 [2019-09-10 08:27:15,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-10 08:27:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 634. [2019-09-10 08:27:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-10 08:27:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 773 transitions. [2019-09-10 08:27:15,872 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 773 transitions. Word has length 103 [2019-09-10 08:27:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:15,872 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 773 transitions. [2019-09-10 08:27:15,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 773 transitions. [2019-09-10 08:27:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:15,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:15,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] [2019-09-10 08:27:15,874 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1724675309, now seen corresponding path program 1 times [2019-09-10 08:27:15,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:15,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:15,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:15,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:15,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:16,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:16,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:16,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:16,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:16,026 INFO L87 Difference]: Start difference. First operand 634 states and 773 transitions. Second operand 9 states. [2019-09-10 08:27:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:18,044 INFO L93 Difference]: Finished difference Result 1022 states and 1287 transitions. [2019-09-10 08:27:18,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:18,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:27:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:18,046 INFO L225 Difference]: With dead ends: 1022 [2019-09-10 08:27:18,046 INFO L226 Difference]: Without dead ends: 1022 [2019-09-10 08:27:18,047 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:27:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-09-10 08:27:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 634. [2019-09-10 08:27:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-10 08:27:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 771 transitions. [2019-09-10 08:27:18,053 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 771 transitions. Word has length 103 [2019-09-10 08:27:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:18,053 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 771 transitions. [2019-09-10 08:27:18,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 771 transitions. [2019-09-10 08:27:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:18,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:18,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:18,054 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash -193101075, now seen corresponding path program 1 times [2019-09-10 08:27:18,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:18,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:18,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:27:18,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:18,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:27:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:27:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:27:18,549 INFO L87 Difference]: Start difference. First operand 634 states and 771 transitions. Second operand 12 states. [2019-09-10 08:27:19,022 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:27:19,173 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:27:19,452 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-10 08:27:19,668 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-09-10 08:27:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:20,078 INFO L93 Difference]: Finished difference Result 1223 states and 1575 transitions. [2019-09-10 08:27:20,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:27:20,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-09-10 08:27:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:20,081 INFO L225 Difference]: With dead ends: 1223 [2019-09-10 08:27:20,081 INFO L226 Difference]: Without dead ends: 1223 [2019-09-10 08:27:20,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:27:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-10 08:27:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 612. [2019-09-10 08:27:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-10 08:27:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 746 transitions. [2019-09-10 08:27:20,088 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 746 transitions. Word has length 103 [2019-09-10 08:27:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:20,089 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 746 transitions. [2019-09-10 08:27:20,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:27:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 746 transitions. [2019-09-10 08:27:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:20,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:20,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:20,090 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1298823277, now seen corresponding path program 1 times [2019-09-10 08:27:20,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:20,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:20,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:20,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:27:20,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:20,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:27:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:27:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:27:20,895 INFO L87 Difference]: Start difference. First operand 612 states and 746 transitions. Second operand 16 states. [2019-09-10 08:27:21,584 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 08:27:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:24,365 INFO L93 Difference]: Finished difference Result 1239 states and 1595 transitions. [2019-09-10 08:27:24,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:27:24,365 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:27:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:24,367 INFO L225 Difference]: With dead ends: 1239 [2019-09-10 08:27:24,367 INFO L226 Difference]: Without dead ends: 1239 [2019-09-10 08:27:24,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:27:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-09-10 08:27:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 618. [2019-09-10 08:27:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-10 08:27:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 753 transitions. [2019-09-10 08:27:24,375 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 753 transitions. Word has length 103 [2019-09-10 08:27:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:24,375 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 753 transitions. [2019-09-10 08:27:24,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:27:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 753 transitions. [2019-09-10 08:27:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:24,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:24,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:24,376 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1405459957, now seen corresponding path program 1 times [2019-09-10 08:27:24,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:24,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:24,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:24,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:24,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:25,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:25,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:27:25,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:25,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:27:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:27:25,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:25,152 INFO L87 Difference]: Start difference. First operand 618 states and 753 transitions. Second operand 17 states. [2019-09-10 08:27:25,774 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:27:25,929 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:27:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:27,753 INFO L93 Difference]: Finished difference Result 1030 states and 1306 transitions. [2019-09-10 08:27:27,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:27:27,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:27:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:27,756 INFO L225 Difference]: With dead ends: 1030 [2019-09-10 08:27:27,756 INFO L226 Difference]: Without dead ends: 1030 [2019-09-10 08:27:27,756 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:27:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-10 08:27:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 595. [2019-09-10 08:27:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-10 08:27:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 726 transitions. [2019-09-10 08:27:27,762 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 726 transitions. Word has length 103 [2019-09-10 08:27:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:27,763 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 726 transitions. [2019-09-10 08:27:27,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:27:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 726 transitions. [2019-09-10 08:27:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:27,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:27,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:27,764 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2048395954, now seen corresponding path program 1 times [2019-09-10 08:27:27,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:27,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:29,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:27:29,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:29,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:27:29,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:29,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:27:29,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:27:29,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:29,093 INFO L87 Difference]: Start difference. First operand 595 states and 726 transitions. Second operand 21 states. [2019-09-10 08:27:30,236 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-09-10 08:27:30,501 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-10 08:27:30,711 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:27:30,905 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:27:35,534 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:27:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:36,324 INFO L93 Difference]: Finished difference Result 1013 states and 1224 transitions. [2019-09-10 08:27:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:27:36,325 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-10 08:27:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:36,326 INFO L225 Difference]: With dead ends: 1013 [2019-09-10 08:27:36,326 INFO L226 Difference]: Without dead ends: 1013 [2019-09-10 08:27:36,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:27:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-10 08:27:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 612. [2019-09-10 08:27:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-10 08:27:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 748 transitions. [2019-09-10 08:27:36,333 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 748 transitions. Word has length 103 [2019-09-10 08:27:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:36,334 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 748 transitions. [2019-09-10 08:27:36,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:27:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 748 transitions. [2019-09-10 08:27:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:36,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:36,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] [2019-09-10 08:27:36,335 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1914956223, now seen corresponding path program 1 times [2019-09-10 08:27:36,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:36,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:36,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:36,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:36,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:27:36,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:36,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:27:36,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:27:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:27:36,709 INFO L87 Difference]: Start difference. First operand 612 states and 748 transitions. Second operand 11 states. [2019-09-10 08:27:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:38,113 INFO L93 Difference]: Finished difference Result 1370 states and 1819 transitions. [2019-09-10 08:27:38,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:38,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-10 08:27:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:38,117 INFO L225 Difference]: With dead ends: 1370 [2019-09-10 08:27:38,117 INFO L226 Difference]: Without dead ends: 1370 [2019-09-10 08:27:38,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:27:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-10 08:27:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 601. [2019-09-10 08:27:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 08:27:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 733 transitions. [2019-09-10 08:27:38,125 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 733 transitions. Word has length 103 [2019-09-10 08:27:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:38,126 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 733 transitions. [2019-09-10 08:27:38,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:27:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 733 transitions. [2019-09-10 08:27:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:38,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:38,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:38,127 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:38,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1559299579, now seen corresponding path program 1 times [2019-09-10 08:27:38,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:38,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:38,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:39,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:39,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:27:39,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:39,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:27:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:27:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:39,316 INFO L87 Difference]: Start difference. First operand 601 states and 733 transitions. Second operand 21 states. [2019-09-10 08:27:40,446 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:27:40,715 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:27:40,888 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:27:41,067 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:27:41,276 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:27:44,592 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:27:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:45,918 INFO L93 Difference]: Finished difference Result 979 states and 1186 transitions. [2019-09-10 08:27:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:27:45,919 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-10 08:27:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:45,920 INFO L225 Difference]: With dead ends: 979 [2019-09-10 08:27:45,921 INFO L226 Difference]: Without dead ends: 979 [2019-09-10 08:27:45,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:27:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-10 08:27:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 601. [2019-09-10 08:27:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 08:27:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 733 transitions. [2019-09-10 08:27:45,929 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 733 transitions. Word has length 103 [2019-09-10 08:27:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:45,929 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 733 transitions. [2019-09-10 08:27:45,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:27:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 733 transitions. [2019-09-10 08:27:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:45,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:45,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:45,931 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1049847790, now seen corresponding path program 1 times [2019-09-10 08:27:45,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:45,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:45,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:46,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:27:46,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:46,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:27:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:27:46,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:27:46,688 INFO L87 Difference]: Start difference. First operand 601 states and 733 transitions. Second operand 17 states. [2019-09-10 08:27:47,321 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:27:47,470 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:27:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:49,153 INFO L93 Difference]: Finished difference Result 979 states and 1241 transitions. [2019-09-10 08:27:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:27:49,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:27:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:49,155 INFO L225 Difference]: With dead ends: 979 [2019-09-10 08:27:49,155 INFO L226 Difference]: Without dead ends: 979 [2019-09-10 08:27:49,156 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:27:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-10 08:27:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 559. [2019-09-10 08:27:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-10 08:27:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 682 transitions. [2019-09-10 08:27:49,163 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 682 transitions. Word has length 103 [2019-09-10 08:27:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:49,163 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 682 transitions. [2019-09-10 08:27:49,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:27:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 682 transitions. [2019-09-10 08:27:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:49,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:49,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:49,166 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 407007842, now seen corresponding path program 1 times [2019-09-10 08:27:49,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:49,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:49,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:50,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:50,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:27:50,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:50,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:27:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:27:50,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:50,302 INFO L87 Difference]: Start difference. First operand 559 states and 682 transitions. Second operand 21 states. [2019-09-10 08:27:51,383 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:27:51,717 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:27:51,907 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:27:52,071 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:27:52,240 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:27:53,015 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:27:53,759 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:27:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:57,245 INFO L93 Difference]: Finished difference Result 1061 states and 1287 transitions. [2019-09-10 08:27:57,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:27:57,246 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-10 08:27:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:57,247 INFO L225 Difference]: With dead ends: 1061 [2019-09-10 08:27:57,248 INFO L226 Difference]: Without dead ends: 1061 [2019-09-10 08:27:57,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:27:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-09-10 08:27:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 563. [2019-09-10 08:27:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-10 08:27:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 686 transitions. [2019-09-10 08:27:57,256 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 686 transitions. Word has length 103 [2019-09-10 08:27:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:57,256 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 686 transitions. [2019-09-10 08:27:57,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:27:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 686 transitions. [2019-09-10 08:27:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:57,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:57,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:57,258 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1890101845, now seen corresponding path program 1 times [2019-09-10 08:27:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:57,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:57,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:57,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:27:57,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:57,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:27:57,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:27:57,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:27:57,777 INFO L87 Difference]: Start difference. First operand 563 states and 686 transitions. Second operand 13 states. [2019-09-10 08:27:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:59,463 INFO L93 Difference]: Finished difference Result 1549 states and 2047 transitions. [2019-09-10 08:27:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:27:59,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-09-10 08:27:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:59,465 INFO L225 Difference]: With dead ends: 1549 [2019-09-10 08:27:59,466 INFO L226 Difference]: Without dead ends: 1549 [2019-09-10 08:27:59,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:27:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2019-09-10 08:27:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 539. [2019-09-10 08:27:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-10 08:27:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 655 transitions. [2019-09-10 08:27:59,472 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 655 transitions. Word has length 103 [2019-09-10 08:27:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:59,472 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 655 transitions. [2019-09-10 08:27:59,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:27:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 655 transitions. [2019-09-10 08:27:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:27:59,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:59,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:59,474 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash -333776786, now seen corresponding path program 1 times [2019-09-10 08:27:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:59,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:00,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:00,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:28:00,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:00,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:28:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:28:00,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:28:00,148 INFO L87 Difference]: Start difference. First operand 539 states and 655 transitions. Second operand 16 states. [2019-09-10 08:28:00,830 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:28:00,960 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:28:01,088 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:28:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:03,316 INFO L93 Difference]: Finished difference Result 841 states and 1018 transitions. [2019-09-10 08:28:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:28:03,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:28:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:03,318 INFO L225 Difference]: With dead ends: 841 [2019-09-10 08:28:03,318 INFO L226 Difference]: Without dead ends: 841 [2019-09-10 08:28:03,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:28:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-10 08:28:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 545. [2019-09-10 08:28:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-10 08:28:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 663 transitions. [2019-09-10 08:28:03,324 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 663 transitions. Word has length 103 [2019-09-10 08:28:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:03,325 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 663 transitions. [2019-09-10 08:28:03,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:28:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 663 transitions. [2019-09-10 08:28:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:28:03,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:03,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:03,326 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash 791064172, now seen corresponding path program 1 times [2019-09-10 08:28:03,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:03,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:03,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:03,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:28:03,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:03,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:28:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:28:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:28:03,752 INFO L87 Difference]: Start difference. First operand 545 states and 663 transitions. Second operand 12 states. [2019-09-10 08:28:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:05,482 INFO L93 Difference]: Finished difference Result 1090 states and 1413 transitions. [2019-09-10 08:28:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:28:05,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-09-10 08:28:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:05,485 INFO L225 Difference]: With dead ends: 1090 [2019-09-10 08:28:05,485 INFO L226 Difference]: Without dead ends: 1090 [2019-09-10 08:28:05,485 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:28:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-10 08:28:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 502. [2019-09-10 08:28:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 08:28:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 611 transitions. [2019-09-10 08:28:05,490 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 611 transitions. Word has length 103 [2019-09-10 08:28:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:05,490 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 611 transitions. [2019-09-10 08:28:05,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:28:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 611 transitions. [2019-09-10 08:28:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:28:05,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:05,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:05,492 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:05,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1989632252, now seen corresponding path program 1 times [2019-09-10 08:28:05,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:05,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:05,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:05,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:06,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:06,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:28:06,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:06,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:28:06,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:28:06,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:28:06,052 INFO L87 Difference]: Start difference. First operand 502 states and 611 transitions. Second operand 15 states. [2019-09-10 08:28:06,616 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:28:07,005 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:28:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:08,193 INFO L93 Difference]: Finished difference Result 956 states and 1235 transitions. [2019-09-10 08:28:08,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:28:08,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2019-09-10 08:28:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:08,195 INFO L225 Difference]: With dead ends: 956 [2019-09-10 08:28:08,195 INFO L226 Difference]: Without dead ends: 956 [2019-09-10 08:28:08,196 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:28:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-10 08:28:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 442. [2019-09-10 08:28:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 08:28:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 538 transitions. [2019-09-10 08:28:08,202 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 538 transitions. Word has length 103 [2019-09-10 08:28:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:08,202 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 538 transitions. [2019-09-10 08:28:08,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:28:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 538 transitions. [2019-09-10 08:28:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:28:08,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:08,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:08,204 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash -57079179, now seen corresponding path program 1 times [2019-09-10 08:28:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:08,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:08,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:08,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:28:08,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:08,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:28:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:28:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:28:08,553 INFO L87 Difference]: Start difference. First operand 442 states and 538 transitions. Second operand 10 states. [2019-09-10 08:28:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:09,308 INFO L93 Difference]: Finished difference Result 672 states and 847 transitions. [2019-09-10 08:28:09,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:28:09,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 08:28:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:09,310 INFO L225 Difference]: With dead ends: 672 [2019-09-10 08:28:09,311 INFO L226 Difference]: Without dead ends: 672 [2019-09-10 08:28:09,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:28:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-10 08:28:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 319. [2019-09-10 08:28:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-10 08:28:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2019-09-10 08:28:09,316 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 103 [2019-09-10 08:28:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:09,316 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2019-09-10 08:28:09,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:28:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2019-09-10 08:28:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:28:09,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:09,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:09,317 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash -444576202, now seen corresponding path program 1 times [2019-09-10 08:28:09,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:09,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:09,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:09,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:09,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:09,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:09,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:09,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:09,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:09,464 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand 9 states. [2019-09-10 08:28:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:10,556 INFO L93 Difference]: Finished difference Result 612 states and 790 transitions. [2019-09-10 08:28:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:10,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:28:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:10,557 INFO L225 Difference]: With dead ends: 612 [2019-09-10 08:28:10,557 INFO L226 Difference]: Without dead ends: 612 [2019-09-10 08:28:10,557 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:28:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-10 08:28:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 319. [2019-09-10 08:28:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-10 08:28:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 382 transitions. [2019-09-10 08:28:10,561 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 382 transitions. Word has length 104 [2019-09-10 08:28:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:10,561 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 382 transitions. [2019-09-10 08:28:10,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 382 transitions. [2019-09-10 08:28:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:28:10,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:10,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:10,562 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1911918420, now seen corresponding path program 1 times [2019-09-10 08:28:10,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:10,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:10,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:10,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:10,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:10,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:10,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:10,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:10,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:10,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:10,722 INFO L87 Difference]: Start difference. First operand 319 states and 382 transitions. Second operand 9 states. [2019-09-10 08:28:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:11,650 INFO L93 Difference]: Finished difference Result 462 states and 564 transitions. [2019-09-10 08:28:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:28:11,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:28:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:11,651 INFO L225 Difference]: With dead ends: 462 [2019-09-10 08:28:11,651 INFO L226 Difference]: Without dead ends: 462 [2019-09-10 08:28:11,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:28:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-10 08:28:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 319. [2019-09-10 08:28:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-10 08:28:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 380 transitions. [2019-09-10 08:28:11,655 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 380 transitions. Word has length 104 [2019-09-10 08:28:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:11,656 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 380 transitions. [2019-09-10 08:28:11,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 380 transitions. [2019-09-10 08:28:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:28:11,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:11,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:11,657 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1218168555, now seen corresponding path program 1 times [2019-09-10 08:28:11,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:11,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:11,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:11,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:11,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:12,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:12,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:28:12,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:12,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:28:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:28:12,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:28:12,215 INFO L87 Difference]: Start difference. First operand 319 states and 380 transitions. Second operand 13 states. [2019-09-10 08:28:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:13,165 INFO L93 Difference]: Finished difference Result 639 states and 817 transitions. [2019-09-10 08:28:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:13,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-10 08:28:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:13,166 INFO L225 Difference]: With dead ends: 639 [2019-09-10 08:28:13,166 INFO L226 Difference]: Without dead ends: 639 [2019-09-10 08:28:13,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-10 08:28:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 247. [2019-09-10 08:28:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-10 08:28:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2019-09-10 08:28:13,170 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 104 [2019-09-10 08:28:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:13,171 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2019-09-10 08:28:13,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:28:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2019-09-10 08:28:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:28:13,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:13,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:13,172 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1690908129, now seen corresponding path program 1 times [2019-09-10 08:28:13,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:13,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:13,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:13,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:13,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:28:13,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:13,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:28:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:28:13,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:28:13,492 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand 11 states. [2019-09-10 08:28:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:14,012 INFO L93 Difference]: Finished difference Result 524 states and 690 transitions. [2019-09-10 08:28:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:28:14,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:28:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:14,014 INFO L225 Difference]: With dead ends: 524 [2019-09-10 08:28:14,014 INFO L226 Difference]: Without dead ends: 524 [2019-09-10 08:28:14,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:28:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-10 08:28:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 192. [2019-09-10 08:28:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-10 08:28:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 235 transitions. [2019-09-10 08:28:14,018 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 235 transitions. Word has length 104 [2019-09-10 08:28:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:14,019 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 235 transitions. [2019-09-10 08:28:14,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:28:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 235 transitions. [2019-09-10 08:28:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:28:14,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:14,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, 1, 1] [2019-09-10 08:28:14,020 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash -450268320, now seen corresponding path program 1 times [2019-09-10 08:28:14,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:15,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:15,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:28:15,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:15,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:28:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:28:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:15,084 INFO L87 Difference]: Start difference. First operand 192 states and 235 transitions. Second operand 21 states. [2019-09-10 08:28:16,069 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:28:16,282 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:28:16,458 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:28:16,623 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:28:17,438 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:28:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:19,306 INFO L93 Difference]: Finished difference Result 837 states and 1147 transitions. [2019-09-10 08:28:19,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:28:19,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-10 08:28:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:19,308 INFO L225 Difference]: With dead ends: 837 [2019-09-10 08:28:19,308 INFO L226 Difference]: Without dead ends: 837 [2019-09-10 08:28:19,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:28:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-09-10 08:28:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 221. [2019-09-10 08:28:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 08:28:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-09-10 08:28:19,313 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 105 [2019-09-10 08:28:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:19,314 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-09-10 08:28:19,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:28:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-09-10 08:28:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:28:19,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:19,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:19,315 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1866671309, now seen corresponding path program 1 times [2019-09-10 08:28:19,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:19,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:19,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:20,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:20,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:28:20,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:20,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:28:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:28:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:28:20,035 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 16 states. [2019-09-10 08:28:20,716 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:28:20,858 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:28:20,992 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:28:21,117 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:28:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:22,136 INFO L93 Difference]: Finished difference Result 673 states and 913 transitions. [2019-09-10 08:28:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:28:22,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-10 08:28:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:22,137 INFO L225 Difference]: With dead ends: 673 [2019-09-10 08:28:22,137 INFO L226 Difference]: Without dead ends: 673 [2019-09-10 08:28:22,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:28:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-10 08:28:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 222. [2019-09-10 08:28:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-10 08:28:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2019-09-10 08:28:22,141 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 106 [2019-09-10 08:28:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:22,141 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2019-09-10 08:28:22,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:28:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2019-09-10 08:28:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:28:22,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:22,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, 1, 1, 1] [2019-09-10 08:28:22,142 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1064534923, now seen corresponding path program 1 times [2019-09-10 08:28:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:22,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:22,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:22,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:22,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:23,366 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:28:25,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:28:25,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:25,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:28:25,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:25,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:28:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:28:25,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:28:25,361 INFO L87 Difference]: Start difference. First operand 222 states and 271 transitions. Second operand 33 states. [2019-09-10 08:28:25,695 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-10 08:28:26,466 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-10 08:28:26,662 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:28:26,910 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:28:27,213 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 08:28:27,544 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:28:27,882 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 08:28:28,482 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-09-10 08:28:28,815 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2019-09-10 08:28:29,166 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-09-10 08:28:29,573 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-09-10 08:28:30,030 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2019-09-10 08:28:30,592 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2019-09-10 08:28:30,960 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-10 08:28:31,300 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-10 08:28:31,644 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-10 08:28:32,009 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-10 08:28:32,286 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-10 08:28:32,626 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-09-10 08:28:32,972 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:28:33,224 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:28:33,556 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:28:33,913 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:28:34,447 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:28:35,261 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 08:28:35,789 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:28:37,124 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 08:28:37,807 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:28:38,145 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:28:38,510 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 08:28:38,871 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 08:28:39,285 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-10 08:28:40,961 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-10 08:28:43,472 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-10 08:28:45,067 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-09-10 08:28:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:59,905 INFO L93 Difference]: Finished difference Result 2507 states and 3552 transitions. [2019-09-10 08:28:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 08:28:59,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-10 08:28:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:59,909 INFO L225 Difference]: With dead ends: 2507 [2019-09-10 08:28:59,909 INFO L226 Difference]: Without dead ends: 2507 [2019-09-10 08:28:59,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1017, Invalid=5303, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 08:28:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-09-10 08:28:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 237. [2019-09-10 08:28:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-10 08:28:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2019-09-10 08:28:59,917 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 106 [2019-09-10 08:28:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:59,917 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2019-09-10 08:28:59,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:28:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2019-09-10 08:28:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:28:59,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:59,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:59,918 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 311395281, now seen corresponding path program 1 times [2019-09-10 08:28:59,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:59,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:59,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:59,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:59,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:00,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:00,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:29:00,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:00,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:29:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:29:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:29:00,690 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand 17 states. [2019-09-10 08:29:01,051 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-10 08:29:01,186 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-09-10 08:29:01,553 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 08:29:01,719 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:29:01,879 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:29:02,082 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:29:02,376 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:29:02,597 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-10 08:29:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:03,746 INFO L93 Difference]: Finished difference Result 750 states and 1028 transitions. [2019-09-10 08:29:03,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:29:03,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-10 08:29:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:03,748 INFO L225 Difference]: With dead ends: 750 [2019-09-10 08:29:03,748 INFO L226 Difference]: Without dead ends: 750 [2019-09-10 08:29:03,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:29:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-10 08:29:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 231. [2019-09-10 08:29:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-10 08:29:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 282 transitions. [2019-09-10 08:29:03,753 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 282 transitions. Word has length 107 [2019-09-10 08:29:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:03,754 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 282 transitions. [2019-09-10 08:29:03,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:29:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 282 transitions. [2019-09-10 08:29:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:29:03,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:03,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:03,755 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:03,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:03,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1144717407, now seen corresponding path program 1 times [2019-09-10 08:29:03,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:03,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:03,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:29:04,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:04,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:29:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:29:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:29:04,230 INFO L87 Difference]: Start difference. First operand 231 states and 282 transitions. Second operand 13 states. [2019-09-10 08:29:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:05,677 INFO L93 Difference]: Finished difference Result 628 states and 861 transitions. [2019-09-10 08:29:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:29:05,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-09-10 08:29:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:05,679 INFO L225 Difference]: With dead ends: 628 [2019-09-10 08:29:05,679 INFO L226 Difference]: Without dead ends: 628 [2019-09-10 08:29:05,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:29:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-10 08:29:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 186. [2019-09-10 08:29:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 08:29:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2019-09-10 08:29:05,684 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 107 [2019-09-10 08:29:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:05,684 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2019-09-10 08:29:05,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:29:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2019-09-10 08:29:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:29:05,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:05,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:05,685 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1232495127, now seen corresponding path program 1 times [2019-09-10 08:29:05,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:05,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:05,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:05,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:05,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:05,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:05,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:05,783 INFO L87 Difference]: Start difference. First operand 186 states and 229 transitions. Second operand 3 states. [2019-09-10 08:29:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:05,819 INFO L93 Difference]: Finished difference Result 256 states and 330 transitions. [2019-09-10 08:29:05,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:05,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:29:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:05,820 INFO L225 Difference]: With dead ends: 256 [2019-09-10 08:29:05,820 INFO L226 Difference]: Without dead ends: 256 [2019-09-10 08:29:05,821 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:29:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-10 08:29:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-09-10 08:29:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-10 08:29:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 329 transitions. [2019-09-10 08:29:05,824 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 329 transitions. Word has length 136 [2019-09-10 08:29:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:05,825 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 329 transitions. [2019-09-10 08:29:05,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 329 transitions. [2019-09-10 08:29:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:05,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:05,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:05,826 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1599493294, now seen corresponding path program 1 times [2019-09-10 08:29:05,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:05,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:05,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:05,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:05,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:05,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:05,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:05,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:05,942 INFO L87 Difference]: Start difference. First operand 254 states and 329 transitions. Second operand 7 states. [2019-09-10 08:29:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:06,454 INFO L93 Difference]: Finished difference Result 692 states and 963 transitions. [2019-09-10 08:29:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:06,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:29:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:06,455 INFO L225 Difference]: With dead ends: 692 [2019-09-10 08:29:06,455 INFO L226 Difference]: Without dead ends: 692 [2019-09-10 08:29:06,456 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:29:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-10 08:29:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 414. [2019-09-10 08:29:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-10 08:29:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 566 transitions. [2019-09-10 08:29:06,461 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 566 transitions. Word has length 138 [2019-09-10 08:29:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:06,462 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 566 transitions. [2019-09-10 08:29:06,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 566 transitions. [2019-09-10 08:29:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:06,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:06,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:06,463 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash 948532047, now seen corresponding path program 1 times [2019-09-10 08:29:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:06,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:06,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:06,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:06,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:06,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:06,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:06,550 INFO L87 Difference]: Start difference. First operand 414 states and 566 transitions. Second operand 3 states. [2019-09-10 08:29:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:06,592 INFO L93 Difference]: Finished difference Result 570 states and 793 transitions. [2019-09-10 08:29:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:06,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:29:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:06,594 INFO L225 Difference]: With dead ends: 570 [2019-09-10 08:29:06,594 INFO L226 Difference]: Without dead ends: 570 [2019-09-10 08:29:06,595 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:29:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-10 08:29:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-09-10 08:29:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 08:29:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 792 transitions. [2019-09-10 08:29:06,600 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 792 transitions. Word has length 138 [2019-09-10 08:29:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:06,600 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 792 transitions. [2019-09-10 08:29:06,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 792 transitions. [2019-09-10 08:29:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:06,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:06,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:06,601 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 882038535, now seen corresponding path program 1 times [2019-09-10 08:29:06,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:06,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:06,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:06,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:06,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:06,669 INFO L87 Difference]: Start difference. First operand 568 states and 792 transitions. Second operand 3 states. [2019-09-10 08:29:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:06,705 INFO L93 Difference]: Finished difference Result 990 states and 1395 transitions. [2019-09-10 08:29:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:06,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:29:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:06,708 INFO L225 Difference]: With dead ends: 990 [2019-09-10 08:29:06,708 INFO L226 Difference]: Without dead ends: 990 [2019-09-10 08:29:06,708 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:29:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-09-10 08:29:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 982. [2019-09-10 08:29:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-09-10 08:29:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1388 transitions. [2019-09-10 08:29:06,720 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1388 transitions. Word has length 138 [2019-09-10 08:29:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:06,720 INFO L475 AbstractCegarLoop]: Abstraction has 982 states and 1388 transitions. [2019-09-10 08:29:06,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1388 transitions. [2019-09-10 08:29:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:06,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:06,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:06,722 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -820324690, now seen corresponding path program 1 times [2019-09-10 08:29:06,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:06,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:06,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:06,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:06,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:06,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:06,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:06,835 INFO L87 Difference]: Start difference. First operand 982 states and 1388 transitions. Second operand 7 states. [2019-09-10 08:29:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:07,397 INFO L93 Difference]: Finished difference Result 3060 states and 4359 transitions. [2019-09-10 08:29:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:07,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:29:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:07,401 INFO L225 Difference]: With dead ends: 3060 [2019-09-10 08:29:07,401 INFO L226 Difference]: Without dead ends: 3060 [2019-09-10 08:29:07,401 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:29:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2019-09-10 08:29:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 1970. [2019-09-10 08:29:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-09-10 08:29:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2824 transitions. [2019-09-10 08:29:07,426 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2824 transitions. Word has length 138 [2019-09-10 08:29:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:07,427 INFO L475 AbstractCegarLoop]: Abstraction has 1970 states and 2824 transitions. [2019-09-10 08:29:07,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2824 transitions. [2019-09-10 08:29:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:07,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:07,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:07,428 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:07,429 INFO L82 PathProgramCache]: Analyzing trace with hash -456238930, now seen corresponding path program 1 times [2019-09-10 08:29:07,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:07,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:07,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:07,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:07,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:07,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:07,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:07,538 INFO L87 Difference]: Start difference. First operand 1970 states and 2824 transitions. Second operand 7 states. [2019-09-10 08:29:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:08,086 INFO L93 Difference]: Finished difference Result 6720 states and 9627 transitions. [2019-09-10 08:29:08,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:08,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:29:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:08,096 INFO L225 Difference]: With dead ends: 6720 [2019-09-10 08:29:08,096 INFO L226 Difference]: Without dead ends: 6720 [2019-09-10 08:29:08,096 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:29:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2019-09-10 08:29:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 4066. [2019-09-10 08:29:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2019-09-10 08:29:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 5864 transitions. [2019-09-10 08:29:08,150 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 5864 transitions. Word has length 138 [2019-09-10 08:29:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:08,150 INFO L475 AbstractCegarLoop]: Abstraction has 4066 states and 5864 transitions. [2019-09-10 08:29:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 5864 transitions. [2019-09-10 08:29:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:08,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:08,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:08,151 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash 284220078, now seen corresponding path program 1 times [2019-09-10 08:29:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:08,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:08,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:08,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:08,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:08,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:08,274 INFO L87 Difference]: Start difference. First operand 4066 states and 5864 transitions. Second operand 7 states. [2019-09-10 08:29:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:08,846 INFO L93 Difference]: Finished difference Result 14760 states and 21195 transitions. [2019-09-10 08:29:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:08,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:29:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:08,864 INFO L225 Difference]: With dead ends: 14760 [2019-09-10 08:29:08,865 INFO L226 Difference]: Without dead ends: 14760 [2019-09-10 08:29:08,865 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:29:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14760 states. [2019-09-10 08:29:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14760 to 8498. [2019-09-10 08:29:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8498 states. [2019-09-10 08:29:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8498 states to 8498 states and 12280 transitions. [2019-09-10 08:29:08,979 INFO L78 Accepts]: Start accepts. Automaton has 8498 states and 12280 transitions. Word has length 138 [2019-09-10 08:29:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:08,980 INFO L475 AbstractCegarLoop]: Abstraction has 8498 states and 12280 transitions. [2019-09-10 08:29:08,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 8498 states and 12280 transitions. [2019-09-10 08:29:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:29:08,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:08,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:08,982 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2080219986, now seen corresponding path program 1 times [2019-09-10 08:29:08,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:08,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:09,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:09,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:09,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:09,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:09,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:09,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:09,131 INFO L87 Difference]: Start difference. First operand 8498 states and 12280 transitions. Second operand 7 states. [2019-09-10 08:29:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:09,819 INFO L93 Difference]: Finished difference Result 24622 states and 35416 transitions. [2019-09-10 08:29:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:09,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:29:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:09,845 INFO L225 Difference]: With dead ends: 24622 [2019-09-10 08:29:09,845 INFO L226 Difference]: Without dead ends: 24622 [2019-09-10 08:29:09,845 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:29:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24622 states. [2019-09-10 08:29:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24622 to 13826. [2019-09-10 08:29:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13826 states. [2019-09-10 08:29:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13826 states to 13826 states and 19992 transitions. [2019-09-10 08:29:10,027 INFO L78 Accepts]: Start accepts. Automaton has 13826 states and 19992 transitions. Word has length 138 [2019-09-10 08:29:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:10,027 INFO L475 AbstractCegarLoop]: Abstraction has 13826 states and 19992 transitions. [2019-09-10 08:29:10,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 13826 states and 19992 transitions. [2019-09-10 08:29:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:29:10,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:10,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:10,029 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1106690548, now seen corresponding path program 1 times [2019-09-10 08:29:10,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:10,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:10,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:10,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:10,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:29:10,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:10,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:29:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:29:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:29:10,135 INFO L87 Difference]: Start difference. First operand 13826 states and 19992 transitions. Second operand 6 states. [2019-09-10 08:29:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:10,255 INFO L93 Difference]: Finished difference Result 24797 states and 35373 transitions. [2019-09-10 08:29:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:10,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-10 08:29:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:10,280 INFO L225 Difference]: With dead ends: 24797 [2019-09-10 08:29:10,280 INFO L226 Difference]: Without dead ends: 24797 [2019-09-10 08:29:10,281 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:29:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2019-09-10 08:29:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 14018. [2019-09-10 08:29:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14018 states. [2019-09-10 08:29:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 20152 transitions. [2019-09-10 08:29:10,446 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 20152 transitions. Word has length 139 [2019-09-10 08:29:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:10,446 INFO L475 AbstractCegarLoop]: Abstraction has 14018 states and 20152 transitions. [2019-09-10 08:29:10,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:29:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 20152 transitions. [2019-09-10 08:29:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:29:10,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:10,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] [2019-09-10 08:29:10,449 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash -475105807, now seen corresponding path program 1 times [2019-09-10 08:29:10,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:10,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:10,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:10,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:11,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:11,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:29:11,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:11,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:29:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:29:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:29:11,059 INFO L87 Difference]: Start difference. First operand 14018 states and 20152 transitions. Second operand 7 states. [2019-09-10 08:29:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:11,554 INFO L93 Difference]: Finished difference Result 29528 states and 41947 transitions. [2019-09-10 08:29:11,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:29:11,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:29:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:11,585 INFO L225 Difference]: With dead ends: 29528 [2019-09-10 08:29:11,585 INFO L226 Difference]: Without dead ends: 29528 [2019-09-10 08:29:11,586 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:29:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29528 states. [2019-09-10 08:29:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29528 to 16402. [2019-09-10 08:29:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16402 states. [2019-09-10 08:29:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16402 states to 16402 states and 23288 transitions. [2019-09-10 08:29:11,789 INFO L78 Accepts]: Start accepts. Automaton has 16402 states and 23288 transitions. Word has length 139 [2019-09-10 08:29:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:11,790 INFO L475 AbstractCegarLoop]: Abstraction has 16402 states and 23288 transitions. [2019-09-10 08:29:11,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:29:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16402 states and 23288 transitions. [2019-09-10 08:29:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:29:11,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:11,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:11,792 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1327747304, now seen corresponding path program 1 times [2019-09-10 08:29:11,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:11,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:11,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:11,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:11,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:11,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:11,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:11,870 INFO L87 Difference]: Start difference. First operand 16402 states and 23288 transitions. Second operand 3 states. [2019-09-10 08:29:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:11,931 INFO L93 Difference]: Finished difference Result 15540 states and 21849 transitions. [2019-09-10 08:29:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:11,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 08:29:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:11,946 INFO L225 Difference]: With dead ends: 15540 [2019-09-10 08:29:11,946 INFO L226 Difference]: Without dead ends: 15540 [2019-09-10 08:29:11,946 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:29:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15540 states. [2019-09-10 08:29:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15540 to 11790. [2019-09-10 08:29:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11790 states. [2019-09-10 08:29:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11790 states to 11790 states and 16560 transitions. [2019-09-10 08:29:12,047 INFO L78 Accepts]: Start accepts. Automaton has 11790 states and 16560 transitions. Word has length 140 [2019-09-10 08:29:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:12,047 INFO L475 AbstractCegarLoop]: Abstraction has 11790 states and 16560 transitions. [2019-09-10 08:29:12,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11790 states and 16560 transitions. [2019-09-10 08:29:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:29:12,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:12,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:12,049 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash -896093248, now seen corresponding path program 1 times [2019-09-10 08:29:12,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:12,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:12,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:12,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:12,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:12,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:12,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:12,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:12,115 INFO L87 Difference]: Start difference. First operand 11790 states and 16560 transitions. Second operand 3 states. [2019-09-10 08:29:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:12,152 INFO L93 Difference]: Finished difference Result 11168 states and 15529 transitions. [2019-09-10 08:29:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:12,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:29:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:12,164 INFO L225 Difference]: With dead ends: 11168 [2019-09-10 08:29:12,164 INFO L226 Difference]: Without dead ends: 11168 [2019-09-10 08:29:12,165 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:29:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11168 states. [2019-09-10 08:29:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11168 to 10578. [2019-09-10 08:29:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-09-10 08:29:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 14808 transitions. [2019-09-10 08:29:12,336 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 14808 transitions. Word has length 141 [2019-09-10 08:29:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:12,336 INFO L475 AbstractCegarLoop]: Abstraction has 10578 states and 14808 transitions. [2019-09-10 08:29:12,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 14808 transitions. [2019-09-10 08:29:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:29:12,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:12,339 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, 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] [2019-09-10 08:29:12,340 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1324236212, now seen corresponding path program 1 times [2019-09-10 08:29:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:12,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:12,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:12,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:12,428 INFO L87 Difference]: Start difference. First operand 10578 states and 14808 transitions. Second operand 3 states. [2019-09-10 08:29:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:12,484 INFO L93 Difference]: Finished difference Result 9932 states and 13729 transitions. [2019-09-10 08:29:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:12,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:29:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:12,499 INFO L225 Difference]: With dead ends: 9932 [2019-09-10 08:29:12,499 INFO L226 Difference]: Without dead ends: 9932 [2019-09-10 08:29:12,499 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:29:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2019-09-10 08:29:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 7557. [2019-09-10 08:29:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7557 states. [2019-09-10 08:29:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7557 states to 7557 states and 10434 transitions. [2019-09-10 08:29:12,612 INFO L78 Accepts]: Start accepts. Automaton has 7557 states and 10434 transitions. Word has length 173 [2019-09-10 08:29:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:12,612 INFO L475 AbstractCegarLoop]: Abstraction has 7557 states and 10434 transitions. [2019-09-10 08:29:12,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7557 states and 10434 transitions. [2019-09-10 08:29:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:29:12,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:12,616 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, 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] [2019-09-10 08:29:12,616 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash -527870386, now seen corresponding path program 1 times [2019-09-10 08:29:12,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 08:29:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:12,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:12,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:12,726 INFO L87 Difference]: Start difference. First operand 7557 states and 10434 transitions. Second operand 3 states. [2019-09-10 08:29:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:12,761 INFO L93 Difference]: Finished difference Result 9383 states and 12850 transitions. [2019-09-10 08:29:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:12,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 08:29:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:12,770 INFO L225 Difference]: With dead ends: 9383 [2019-09-10 08:29:12,771 INFO L226 Difference]: Without dead ends: 9383 [2019-09-10 08:29:12,771 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:29:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9383 states. [2019-09-10 08:29:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9383 to 9093. [2019-09-10 08:29:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9093 states. [2019-09-10 08:29:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 12504 transitions. [2019-09-10 08:29:12,843 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 12504 transitions. Word has length 174 [2019-09-10 08:29:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:12,843 INFO L475 AbstractCegarLoop]: Abstraction has 9093 states and 12504 transitions. [2019-09-10 08:29:12,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 12504 transitions. [2019-09-10 08:29:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:29:12,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:12,846 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:29:12,846 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1451413664, now seen corresponding path program 1 times [2019-09-10 08:29:12,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:12,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:12,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:12,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:12,924 INFO L87 Difference]: Start difference. First operand 9093 states and 12504 transitions. Second operand 3 states. [2019-09-10 08:29:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:12,969 INFO L93 Difference]: Finished difference Result 15434 states and 21001 transitions. [2019-09-10 08:29:12,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:12,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 08:29:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:12,985 INFO L225 Difference]: With dead ends: 15434 [2019-09-10 08:29:12,985 INFO L226 Difference]: Without dead ends: 15434 [2019-09-10 08:29:12,985 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:29:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15434 states. [2019-09-10 08:29:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15434 to 14568. [2019-09-10 08:29:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14568 states. [2019-09-10 08:29:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14568 states to 14568 states and 19956 transitions. [2019-09-10 08:29:13,114 INFO L78 Accepts]: Start accepts. Automaton has 14568 states and 19956 transitions. Word has length 175 [2019-09-10 08:29:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:13,115 INFO L475 AbstractCegarLoop]: Abstraction has 14568 states and 19956 transitions. [2019-09-10 08:29:13,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14568 states and 19956 transitions. [2019-09-10 08:29:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:29:13,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:13,117 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] [2019-09-10 08:29:13,118 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:13,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash 663466126, now seen corresponding path program 1 times [2019-09-10 08:29:13,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:13,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:13,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:13,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:13,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:29:13,539 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2019-09-10 08:29:13,541 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7024], [7027], [7031], [7044], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9110], [9112], [9114], [9117], [9120], [9125], [9128], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:29:13,597 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:29:13,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:29:13,868 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:29:15,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:29:15,069 INFO L272 AbstractInterpreter]: Visited 159 different actions 761 times. Merged at 55 different actions 539 times. Widened at 22 different actions 89 times. Performed 2898 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 47 fixpoints after 13 different actions. Largest state had 388 variables. [2019-09-10 08:29:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:15,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:29:15,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:15,077 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) [2019-09-10 08:29:15,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:15,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:29:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:15,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 2153 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:29:15,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:29:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:29:15,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:29:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:29:16,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:29:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:29:16,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:16,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:29:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:29:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:29:16,046 INFO L87 Difference]: Start difference. First operand 14568 states and 19956 transitions. Second operand 8 states. [2019-09-10 08:29:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:16,466 INFO L93 Difference]: Finished difference Result 82582 states and 113153 transitions. [2019-09-10 08:29:16,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:29:16,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-09-10 08:29:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:16,677 INFO L225 Difference]: With dead ends: 82582 [2019-09-10 08:29:16,677 INFO L226 Difference]: Without dead ends: 82582 [2019-09-10 08:29:16,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 341 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:29:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82582 states. [2019-09-10 08:29:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82582 to 24612. [2019-09-10 08:29:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24612 states. [2019-09-10 08:29:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24612 states to 24612 states and 33660 transitions. [2019-09-10 08:29:17,631 INFO L78 Accepts]: Start accepts. Automaton has 24612 states and 33660 transitions. Word has length 176 [2019-09-10 08:29:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:17,632 INFO L475 AbstractCegarLoop]: Abstraction has 24612 states and 33660 transitions. [2019-09-10 08:29:17,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:29:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 24612 states and 33660 transitions. [2019-09-10 08:29:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:29:17,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:17,638 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] [2019-09-10 08:29:17,638 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1392266098, now seen corresponding path program 1 times [2019-09-10 08:29:17,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:17,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:17,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:17,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:17,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:17,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:17,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:17,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:17,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:17,874 INFO L87 Difference]: Start difference. First operand 24612 states and 33660 transitions. Second operand 3 states. [2019-09-10 08:29:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:17,951 INFO L93 Difference]: Finished difference Result 22902 states and 30879 transitions. [2019-09-10 08:29:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:17,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:29:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:17,983 INFO L225 Difference]: With dead ends: 22902 [2019-09-10 08:29:17,983 INFO L226 Difference]: Without dead ends: 22902 [2019-09-10 08:29:17,983 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:29:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22902 states. [2019-09-10 08:29:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22902 to 22900. [2019-09-10 08:29:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22900 states. [2019-09-10 08:29:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22900 states to 22900 states and 30878 transitions. [2019-09-10 08:29:18,268 INFO L78 Accepts]: Start accepts. Automaton has 22900 states and 30878 transitions. Word has length 176 [2019-09-10 08:29:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:18,268 INFO L475 AbstractCegarLoop]: Abstraction has 22900 states and 30878 transitions. [2019-09-10 08:29:18,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22900 states and 30878 transitions. [2019-09-10 08:29:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:29:18,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:18,271 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] [2019-09-10 08:29:18,272 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash 572823057, now seen corresponding path program 1 times [2019-09-10 08:29:18,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:29:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:29:18,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:18,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:29:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:29:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:29:18,550 INFO L87 Difference]: Start difference. First operand 22900 states and 30878 transitions. Second operand 8 states. [2019-09-10 08:29:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:19,754 INFO L93 Difference]: Finished difference Result 89357 states and 120610 transitions. [2019-09-10 08:29:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:29:19,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2019-09-10 08:29:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:19,904 INFO L225 Difference]: With dead ends: 89357 [2019-09-10 08:29:19,905 INFO L226 Difference]: Without dead ends: 89357 [2019-09-10 08:29:19,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:29:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89357 states. [2019-09-10 08:29:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89357 to 37198. [2019-09-10 08:29:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37198 states. [2019-09-10 08:29:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37198 states to 37198 states and 50090 transitions. [2019-09-10 08:29:20,881 INFO L78 Accepts]: Start accepts. Automaton has 37198 states and 50090 transitions. Word has length 177 [2019-09-10 08:29:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:20,882 INFO L475 AbstractCegarLoop]: Abstraction has 37198 states and 50090 transitions. [2019-09-10 08:29:20,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:29:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 37198 states and 50090 transitions. [2019-09-10 08:29:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:29:20,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:20,885 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] [2019-09-10 08:29:20,886 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash -663744495, now seen corresponding path program 1 times [2019-09-10 08:29:20,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:20,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:20,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:21,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:21,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:29:21,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:21,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:29:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:29:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:29:21,014 INFO L87 Difference]: Start difference. First operand 37198 states and 50090 transitions. Second operand 3 states. [2019-09-10 08:29:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:21,153 INFO L93 Difference]: Finished difference Result 45586 states and 60447 transitions. [2019-09-10 08:29:21,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:29:21,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 08:29:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:21,224 INFO L225 Difference]: With dead ends: 45586 [2019-09-10 08:29:21,224 INFO L226 Difference]: Without dead ends: 45586 [2019-09-10 08:29:21,225 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:29:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45586 states. [2019-09-10 08:29:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45586 to 43728. [2019-09-10 08:29:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43728 states. [2019-09-10 08:29:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43728 states to 43728 states and 58218 transitions. [2019-09-10 08:29:22,292 INFO L78 Accepts]: Start accepts. Automaton has 43728 states and 58218 transitions. Word has length 177 [2019-09-10 08:29:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:22,292 INFO L475 AbstractCegarLoop]: Abstraction has 43728 states and 58218 transitions. [2019-09-10 08:29:22,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:29:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 43728 states and 58218 transitions. [2019-09-10 08:29:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:29:22,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:22,296 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:22,297 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1194682881, now seen corresponding path program 1 times [2019-09-10 08:29:22,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:22,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:22,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:22,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:22,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:29:22,726 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2019-09-10 08:29:22,729 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7024], [7027], [7031], [7044], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9000], [9005], [9007], [9022], [9024], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9098], [9103], [9106], [9112], [9114], [9117], [9132], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9169], [9172], [9175], [9183], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:29:22,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:29:22,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:29:22,863 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:29:24,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:29:24,105 INFO L272 AbstractInterpreter]: Visited 168 different actions 1109 times. Merged at 64 different actions 819 times. Widened at 29 different actions 160 times. Performed 4209 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4209 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 98 fixpoints after 21 different actions. Largest state had 389 variables. [2019-09-10 08:29:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:24,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:29:24,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:24,106 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) [2019-09-10 08:29:24,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:24,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:29:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:24,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:29:24,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:29:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:29:25,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:29:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:29:25,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:29:25,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:29:25,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:25,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:29:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:29:25,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:29:25,209 INFO L87 Difference]: Start difference. First operand 43728 states and 58218 transitions. Second operand 8 states. [2019-09-10 08:29:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:25,527 INFO L93 Difference]: Finished difference Result 116660 states and 155624 transitions. [2019-09-10 08:29:25,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:29:25,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-10 08:29:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:25,655 INFO L225 Difference]: With dead ends: 116660 [2019-09-10 08:29:25,655 INFO L226 Difference]: Without dead ends: 116660 [2019-09-10 08:29:25,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:29:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116660 states. [2019-09-10 08:29:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116660 to 55056. [2019-09-10 08:29:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55056 states. [2019-09-10 08:29:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55056 states to 55056 states and 73290 transitions. [2019-09-10 08:29:28,078 INFO L78 Accepts]: Start accepts. Automaton has 55056 states and 73290 transitions. Word has length 178 [2019-09-10 08:29:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:28,078 INFO L475 AbstractCegarLoop]: Abstraction has 55056 states and 73290 transitions. [2019-09-10 08:29:28,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:29:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 55056 states and 73290 transitions. [2019-09-10 08:29:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:29:28,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:28,082 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:28,082 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash -830597121, now seen corresponding path program 1 times [2019-09-10 08:29:28,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:28,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:29:28,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:28,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:28,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:28,214 INFO L87 Difference]: Start difference. First operand 55056 states and 73290 transitions. Second operand 5 states. [2019-09-10 08:29:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:28,416 INFO L93 Difference]: Finished difference Result 67264 states and 89516 transitions. [2019-09-10 08:29:28,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:28,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-10 08:29:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:28,496 INFO L225 Difference]: With dead ends: 67264 [2019-09-10 08:29:28,497 INFO L226 Difference]: Without dead ends: 67264 [2019-09-10 08:29:28,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:29:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67264 states. [2019-09-10 08:29:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67264 to 60880. [2019-09-10 08:29:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60880 states. [2019-09-10 08:29:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60880 states to 60880 states and 81082 transitions. [2019-09-10 08:29:29,068 INFO L78 Accepts]: Start accepts. Automaton has 60880 states and 81082 transitions. Word has length 178 [2019-09-10 08:29:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:29,068 INFO L475 AbstractCegarLoop]: Abstraction has 60880 states and 81082 transitions. [2019-09-10 08:29:29,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 60880 states and 81082 transitions. [2019-09-10 08:29:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:29:29,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:29,071 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:29,071 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash -90138113, now seen corresponding path program 1 times [2019-09-10 08:29:29,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:29,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:29,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:29,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:29,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:29:29,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:29,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:29:29,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:29,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:29:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:29:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:29:29,662 INFO L87 Difference]: Start difference. First operand 60880 states and 81082 transitions. Second operand 8 states. [2019-09-10 08:29:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:30,078 INFO L93 Difference]: Finished difference Result 146648 states and 195728 transitions. [2019-09-10 08:29:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:29:30,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-10 08:29:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:30,223 INFO L225 Difference]: With dead ends: 146648 [2019-09-10 08:29:30,224 INFO L226 Difference]: Without dead ends: 146648 [2019-09-10 08:29:30,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:29:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146648 states. [2019-09-10 08:29:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146648 to 72208. [2019-09-10 08:29:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72208 states. [2019-09-10 08:29:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72208 states to 72208 states and 96154 transitions. [2019-09-10 08:29:31,815 INFO L78 Accepts]: Start accepts. Automaton has 72208 states and 96154 transitions. Word has length 178 [2019-09-10 08:29:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:31,815 INFO L475 AbstractCegarLoop]: Abstraction has 72208 states and 96154 transitions. [2019-09-10 08:29:31,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:29:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72208 states and 96154 transitions. [2019-09-10 08:29:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:29:31,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:31,819 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:31,819 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:31,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1840389119, now seen corresponding path program 1 times [2019-09-10 08:29:31,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:31,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:31,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:29:31,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:31,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:29:31,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:31,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:29:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:29:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:29:31,939 INFO L87 Difference]: Start difference. First operand 72208 states and 96154 transitions. Second operand 5 states. [2019-09-10 08:29:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:32,206 INFO L93 Difference]: Finished difference Result 105376 states and 140447 transitions. [2019-09-10 08:29:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:29:32,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-10 08:29:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:32,306 INFO L225 Difference]: With dead ends: 105376 [2019-09-10 08:29:32,306 INFO L226 Difference]: Without dead ends: 105376 [2019-09-10 08:29:32,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:29:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105376 states. [2019-09-10 08:29:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105376 to 104814. [2019-09-10 08:29:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104814 states. [2019-09-10 08:29:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104814 states to 104814 states and 139692 transitions. [2019-09-10 08:29:35,517 INFO L78 Accepts]: Start accepts. Automaton has 104814 states and 139692 transitions. Word has length 178 [2019-09-10 08:29:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:35,517 INFO L475 AbstractCegarLoop]: Abstraction has 104814 states and 139692 transitions. [2019-09-10 08:29:35,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:29:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 104814 states and 139692 transitions. [2019-09-10 08:29:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:29:35,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:35,522 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:35,522 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1423660390, now seen corresponding path program 1 times [2019-09-10 08:29:35,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:35,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:35,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:35,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:35,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:29:35,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2019-09-10 08:29:35,840 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7022], [7024], [7027], [7031], [7033], [7038], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9000], [9005], [9007], [9022], [9024], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9110], [9112], [9114], [9117], [9132], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9169], [9172], [9175], [9183], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:29:35,846 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:29:35,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:29:35,954 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:29:36,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:29:36,875 INFO L272 AbstractInterpreter]: Visited 168 different actions 1216 times. Merged at 63 different actions 908 times. Widened at 28 different actions 162 times. Performed 4430 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4430 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 144 fixpoints after 24 different actions. Largest state had 389 variables. [2019-09-10 08:29:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:36,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:29:36,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:36,876 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:29:36,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:36,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:29:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:37,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:29:37,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:29:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:37,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:29:37,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:37,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:41,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:41,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:29:41,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:29:41,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:29:41,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:29:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:29:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:29:41,731 INFO L87 Difference]: Start difference. First operand 104814 states and 139692 transitions. Second operand 21 states. [2019-09-10 08:29:44,139 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:29:44,436 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:29:44,823 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:29:45,184 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:29:45,701 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:29:45,887 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:29:46,304 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:29:46,461 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:29:46,604 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:29:46,751 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:29:46,889 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:29:47,197 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:29:47,355 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:29:47,771 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:29:47,940 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:29:48,101 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:29:48,244 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:29:48,719 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:29:48,902 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:29:49,084 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:29:50,663 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:29:51,145 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:29:51,637 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:29:51,816 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:29:51,994 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:29:52,157 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:29:52,777 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:29:52,958 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:29:53,130 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:29:53,300 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:29:53,489 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:29:53,638 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:29:53,802 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:29:54,333 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:29:54,623 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:29:54,929 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:29:55,154 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:29:55,350 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:29:55,526 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:29:55,715 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:29:57,048 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:29:57,189 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:29:57,348 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:29:58,079 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:29:58,243 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:29:58,393 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:29:58,850 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:29:59,040 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:29:59,212 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:29:59,384 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:29:59,537 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:29:59,727 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:30:00,571 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:30:00,729 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:30:01,047 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:30:01,215 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:30:01,405 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:30:01,621 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:30:01,782 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:30:02,083 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:30:02,798 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:30:03,101 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:30:03,251 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:30:03,724 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:30:03,926 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:30:04,241 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:30:04,427 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:30:04,626 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:30:04,797 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:30:05,106 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:30:05,785 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:30:06,584 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:30:06,788 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:30:06,979 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:30:07,194 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:30:07,346 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:30:07,506 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:30:07,681 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:30:07,847 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:30:07,990 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:30:08,281 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:30:08,447 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:30:08,635 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:30:09,031 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:30:09,260 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:30:09,413 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:30:09,584 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:30:09,739 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:30:09,926 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:30:10,099 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:30:10,397 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:30:10,544 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:30:10,695 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:30:10,895 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:30:11,072 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:30:11,222 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:30:11,545 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:30:12,174 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:30:12,371 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:30:12,688 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:30:12,980 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:30:13,135 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:30:13,553 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:30:14,444 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:30:14,629 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:30:14,780 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:30:15,428 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:30:15,839 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:30:16,339 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:30:16,501 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:30:16,681 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:30:16,941 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:30:20,232 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:30:20,547 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:30:21,204 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:30:21,528 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:30:21,951 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:30:22,929 WARN L188 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:30:23,110 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:30:23,454 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:30:23,615 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:30:23,770 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:30:24,046 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:30:24,349 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:30:24,540 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:30:24,856 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:30:25,462 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:30:25,623 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:30:26,258 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:30:26,447 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:30:27,004 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:30:27,363 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:30:27,626 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:30:27,980 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:30:28,157 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:30:28,335 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:30:28,620 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:30:28,805 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:30:28,985 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:30:29,417 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:30:29,897 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:30:30,123 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:30:30,320 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:30:30,533 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:30:31,097 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:30:31,257 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:30:31,616 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:30:31,779 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:30:31,963 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:30:32,197 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:30:32,960 WARN L188 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:30:33,285 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:30:33,626 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:30:33,983 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:30:34,179 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:30:34,337 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:30:34,514 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:30:34,714 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:30:34,875 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:30:35,083 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:30:35,282 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:30:35,862 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:30:36,084 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:30:36,282 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:30:36,687 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:30:36,872 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:30:37,048 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:30:37,211 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:30:37,488 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:30:38,986 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:30:39,166 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:30:39,450 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:30:45,776 WARN L188 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:30:45,918 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:30:46,282 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:30:46,471 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:30:46,648 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:30:46,930 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:30:47,086 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:30:47,322 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:30:47,533 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:30:47,694 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:30:47,861 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:30:48,143 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:30:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:58,750 INFO L93 Difference]: Finished difference Result 2473033 states and 3241958 transitions. [2019-09-10 08:30:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:30:58,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-09-10 08:30:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:01,928 INFO L225 Difference]: With dead ends: 2473033 [2019-09-10 08:31:01,928 INFO L226 Difference]: Without dead ends: 2473033 [2019-09-10 08:31:01,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 285 SyntacticMatches, 56 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52451 ImplicationChecksByTransitivity, 59.0s TimeCoverageRelationStatistics Valid=15654, Invalid=110016, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:31:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473033 states. [2019-09-10 08:31:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473033 to 515433. [2019-09-10 08:31:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515433 states. [2019-09-10 08:31:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515433 states to 515433 states and 683161 transitions. [2019-09-10 08:31:31,098 INFO L78 Accepts]: Start accepts. Automaton has 515433 states and 683161 transitions. Word has length 179 [2019-09-10 08:31:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:31,098 INFO L475 AbstractCegarLoop]: Abstraction has 515433 states and 683161 transitions. [2019-09-10 08:31:31,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:31:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 515433 states and 683161 transitions. [2019-09-10 08:31:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:31:31,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:31,120 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:31,121 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1878210198, now seen corresponding path program 1 times [2019-09-10 08:31:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:31,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:31,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:31,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:31:31,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:31:31,414 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7024], [7027], [7031], [7044], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9000], [9005], [9007], [9010], [9015], [9018], [9024], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9110], [9112], [9114], [9117], [9120], [9125], [9128], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9169], [9172], [9175], [9183], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:31:31,418 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:31:31,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:31:31,486 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:31:33,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:31:33,843 INFO L272 AbstractInterpreter]: Visited 170 different actions 1172 times. Merged at 66 different actions 881 times. Widened at 28 different actions 185 times. Performed 4265 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 104 fixpoints after 20 different actions. Largest state had 389 variables. [2019-09-10 08:31:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:33,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:31:33,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:33,844 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) [2019-09-10 08:31:33,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:33,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:31:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:34,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:31:34,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:31:34,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:34,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:31:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:34,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:31:34,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 08:31:34,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:31:34,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:31:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:31:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:31:34,957 INFO L87 Difference]: Start difference. First operand 515433 states and 683161 transitions. Second operand 20 states. [2019-09-10 08:31:37,456 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:31:38,856 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:31:39,326 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:31:40,071 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:31:40,271 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:31:40,719 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:31:40,865 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:31:41,146 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:31:41,288 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:31:41,579 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:31:41,957 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:31:42,129 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:31:42,290 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:31:42,440 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:31:42,982 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:31:43,658 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:31:43,837 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:31:43,990 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:31:44,146 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:31:44,660 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:31:44,864 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:31:45,065 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:31:45,220 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:31:45,383 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:31:46,553 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:31:46,935 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:31:47,227 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:31:47,453 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:31:47,624 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:31:47,806 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:31:47,988 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:31:48,292 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:31:48,499 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:31:48,701 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:31:48,875 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:31:49,041 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:31:49,320 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:31:49,642 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:31:50,280 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:31:52,765 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:31:52,949 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:31:53,130 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:31:53,491 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:31:58,629 WARN L188 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:31:58,851 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:31:59,012 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:31:59,221 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:31:59,374 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:31:59,743 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:32:00,254 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:32:00,437 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:32:00,736 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:32:01,222 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:32:01,392 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:32:01,589 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:32:01,813 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:32:02,297 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:32:02,498 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:32:02,689 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:32:02,889 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:32:03,050 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:32:03,211 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:32:03,559 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:32:03,868 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:32:04,038 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:32:04,189 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:32:04,376 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:32:04,648 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:32:05,036 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:32:05,294 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:32:05,608 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:32:05,773 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:32:05,986 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:32:06,191 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:32:06,378 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:32:06,592 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:32:06,806 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:32:06,958 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:32:07,129 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:32:07,315 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:32:07,493 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:32:07,673 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:32:07,861 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:32:08,042 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:08,204 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:32:08,417 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:32:08,578 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:32:08,751 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:32:08,950 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:32:09,113 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:32:09,269 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:32:09,438 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:32:09,615 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:32:09,777 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:32:10,145 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:32:10,359 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:32:10,682 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:32:10,853 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:32:11,019 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:11,183 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:32:11,514 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:32:11,707 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:12,037 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:32:12,201 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:32:12,486 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:32:12,671 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:12,865 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:32:13,032 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:32:13,193 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:32:13,357 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:32:13,950 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:32:14,105 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:14,260 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:14,698 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:32:14,850 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:32:15,011 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:32:15,321 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:32:15,631 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:15,802 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:15,974 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:32:16,135 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:32:17,107 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:32:17,291 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:32:17,844 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:32:18,196 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:32:18,673 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:32:18,847 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:32:19,024 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:32:19,298 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:32:20,587 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:20,888 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:32:21,193 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:32:22,243 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:22,534 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:32:23,218 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:32:23,741 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:32:24,315 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:32:24,649 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 08:32:24,976 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:32:25,191 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:32:25,550 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:25,910 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:32:26,072 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:26,757 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:32:27,131 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:32:27,798 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:28,224 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:32:28,439 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:32:28,665 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:32:29,069 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:32:29,262 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:32:29,431 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:32:29,927 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:32:32,811 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:33,090 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:33,261 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:34,546 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:34,737 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:35,160 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:32:35,731 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:32:35,899 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:32:36,264 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:32:36,713 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:32:36,899 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:32:37,103 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:32:37,306 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:32:37,542 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:32:37,710 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:32:38,036 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:32:38,237 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:32:38,662 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:32:38,892 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:32:39,312 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:32:39,492 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:32:39,737 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:32:39,897 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:40,081 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:32:46,938 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:32:47,174 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:32:47,351 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:32:48,464 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:32:48,895 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:32:49,097 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:32:49,443 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:32:50,901 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:32:51,096 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:32:51,299 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:32:51,541 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:32:51,698 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:32:51,939 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:32:52,266 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:32:52,538 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:32:52,689 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:32:52,893 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:32:53,074 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:32:53,341 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:32:53,723 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:32:53,911 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:32:54,086 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:32:54,248 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:32:54,506 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:32:55,047 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:32:55,453 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:32:55,683 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57