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-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:01:45,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:01:45,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:01:45,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:01:45,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:01:45,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:01:45,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:01:45,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:01:45,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:01:45,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:01:45,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:01:45,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:01:45,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:01:45,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:01:45,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:01:45,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:01:45,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:01:45,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:01:45,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:01:45,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:01:45,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:01:45,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:01:45,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:01:45,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:01:45,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:01:45,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:01:45,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:01:45,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:01:45,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:01:45,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:01:45,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:01:45,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:01:45,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:01:45,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:01:45,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:01:45,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:01:45,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:01:45,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:01:45,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:01:45,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:01:45,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:01:45,811 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 07:01:45,843 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:01:45,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:01:45,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:01:45,843 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:01:45,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:01:45,844 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:01:45,845 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:01:45,845 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:01:45,845 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:01:45,847 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:01:45,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:01:45,848 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:01:45,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:01:45,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:01:45,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:01:45,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:01:45,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:01:45,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:01:45,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:01:45,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:01:45,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:01:45,851 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:01:45,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:01:45,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:01:45,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:01:45,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:01:45,852 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:01:45,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:01:45,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:01:45,853 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:01:45,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:01:45,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:01:45,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:01:45,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:01:45,920 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:01:45,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:01:45,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4a2d67a/b5aaaff6f8364ccc8286745e4fcd0365/FLAG90767a857 [2019-09-10 07:01:46,618 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:01:46,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:01:46,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4a2d67a/b5aaaff6f8364ccc8286745e4fcd0365/FLAG90767a857 [2019-09-10 07:01:46,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4a2d67a/b5aaaff6f8364ccc8286745e4fcd0365 [2019-09-10 07:01:46,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:01:46,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:01:46,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:01:46,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:01:46,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:01:46,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:01:46" (1/1) ... [2019-09-10 07:01:46,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f08c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:46, skipping insertion in model container [2019-09-10 07:01:46,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:01:46" (1/1) ... [2019-09-10 07:01:46,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:01:46,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:01:48,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:01:48,167 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:01:48,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:01:48,774 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:01:48,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48 WrapperNode [2019-09-10 07:01:48,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:01:48,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:01:48,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:01:48,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:01:48,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:48,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:48,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:48,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:48,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:48,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:49,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (1/1) ... [2019-09-10 07:01:49,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:01:49,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:01:49,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:01:49,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:01:49,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (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 07:01:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:01:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:01:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:01:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:01:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:01:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:01:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:01:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:01:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:01:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:01:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:01:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:01:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:01:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:01:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:01:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:01:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:01:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:01:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:01:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:01:52,839 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:01:52,839 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:01:52,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:01:52 BoogieIcfgContainer [2019-09-10 07:01:52,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:01:52,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:01:52,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:01:52,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:01:52,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:01:46" (1/3) ... [2019-09-10 07:01:52,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac3fa4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:01:52, skipping insertion in model container [2019-09-10 07:01:52,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:48" (2/3) ... [2019-09-10 07:01:52,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac3fa4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:01:52, skipping insertion in model container [2019-09-10 07:01:52,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:01:52" (3/3) ... [2019-09-10 07:01:52,856 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:01:52,867 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:01:52,891 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:01:52,910 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:01:52,950 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:01:52,950 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:01:52,950 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:01:52,951 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:01:52,951 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:01:52,951 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:01:52,951 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:01:52,952 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:01:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states. [2019-09-10 07:01:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:01:53,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:53,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:53,053 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash -492967282, now seen corresponding path program 1 times [2019-09-10 07:01:53,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:53,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:53,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:53,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:53,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:53,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:53,785 INFO L87 Difference]: Start difference. First operand 1107 states. Second operand 5 states. [2019-09-10 07:01:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:55,182 INFO L93 Difference]: Finished difference Result 1003 states and 1798 transitions. [2019-09-10 07:01:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:55,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 07:01:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:55,213 INFO L225 Difference]: With dead ends: 1003 [2019-09-10 07:01:55,214 INFO L226 Difference]: Without dead ends: 991 [2019-09-10 07:01:55,219 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 07:01:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-09-10 07:01:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 983. [2019-09-10 07:01:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-09-10 07:01:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1314 transitions. [2019-09-10 07:01:55,365 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1314 transitions. Word has length 67 [2019-09-10 07:01:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:55,366 INFO L475 AbstractCegarLoop]: Abstraction has 983 states and 1314 transitions. [2019-09-10 07:01:55,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1314 transitions. [2019-09-10 07:01:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:01:55,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:55,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:55,372 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash 39988205, now seen corresponding path program 1 times [2019-09-10 07:01:55,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:55,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:55,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:55,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:55,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:55,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:55,633 INFO L87 Difference]: Start difference. First operand 983 states and 1314 transitions. Second operand 6 states. [2019-09-10 07:01:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:56,383 INFO L93 Difference]: Finished difference Result 1334 states and 1877 transitions. [2019-09-10 07:01:56,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:56,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 07:01:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:56,392 INFO L225 Difference]: With dead ends: 1334 [2019-09-10 07:01:56,393 INFO L226 Difference]: Without dead ends: 1334 [2019-09-10 07:01:56,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-10 07:01:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1318. [2019-09-10 07:01:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-09-10 07:01:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1869 transitions. [2019-09-10 07:01:56,439 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1869 transitions. Word has length 68 [2019-09-10 07:01:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:56,441 INFO L475 AbstractCegarLoop]: Abstraction has 1318 states and 1869 transitions. [2019-09-10 07:01:56,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1869 transitions. [2019-09-10 07:01:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:01:56,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:56,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:56,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2058401878, now seen corresponding path program 1 times [2019-09-10 07:01:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:56,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:56,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:56,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:56,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:56,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:56,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:56,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:56,717 INFO L87 Difference]: Start difference. First operand 1318 states and 1869 transitions. Second operand 3 states. [2019-09-10 07:01:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:56,777 INFO L93 Difference]: Finished difference Result 1892 states and 2675 transitions. [2019-09-10 07:01:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:56,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 07:01:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:56,796 INFO L225 Difference]: With dead ends: 1892 [2019-09-10 07:01:56,796 INFO L226 Difference]: Without dead ends: 1892 [2019-09-10 07:01:56,797 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 07:01:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-09-10 07:01:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1880. [2019-09-10 07:01:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1880 states. [2019-09-10 07:01:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2667 transitions. [2019-09-10 07:01:56,846 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2667 transitions. Word has length 69 [2019-09-10 07:01:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:56,847 INFO L475 AbstractCegarLoop]: Abstraction has 1880 states and 2667 transitions. [2019-09-10 07:01:56,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2667 transitions. [2019-09-10 07:01:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:01:56,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:56,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:56,852 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1291573, now seen corresponding path program 1 times [2019-09-10 07:01:56,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:56,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:56,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:57,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:57,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:57,002 INFO L87 Difference]: Start difference. First operand 1880 states and 2667 transitions. Second operand 3 states. [2019-09-10 07:01:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:57,081 INFO L93 Difference]: Finished difference Result 2827 states and 4048 transitions. [2019-09-10 07:01:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:57,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 07:01:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:57,107 INFO L225 Difference]: With dead ends: 2827 [2019-09-10 07:01:57,107 INFO L226 Difference]: Without dead ends: 2827 [2019-09-10 07:01:57,108 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 07:01:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2019-09-10 07:01:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2819. [2019-09-10 07:01:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2019-09-10 07:01:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 4044 transitions. [2019-09-10 07:01:57,212 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 4044 transitions. Word has length 69 [2019-09-10 07:01:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:57,213 INFO L475 AbstractCegarLoop]: Abstraction has 2819 states and 4044 transitions. [2019-09-10 07:01:57,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 4044 transitions. [2019-09-10 07:01:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:01:57,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:57,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:57,221 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -327434068, now seen corresponding path program 1 times [2019-09-10 07:01:57,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:57,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:57,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:57,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:57,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:57,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:57,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:57,396 INFO L87 Difference]: Start difference. First operand 2819 states and 4044 transitions. Second operand 3 states. [2019-09-10 07:01:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:57,478 INFO L93 Difference]: Finished difference Result 3911 states and 5538 transitions. [2019-09-10 07:01:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:57,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 07:01:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:57,506 INFO L225 Difference]: With dead ends: 3911 [2019-09-10 07:01:57,507 INFO L226 Difference]: Without dead ends: 3911 [2019-09-10 07:01:57,508 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 07:01:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2019-09-10 07:01:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3893. [2019-09-10 07:01:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-09-10 07:01:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5524 transitions. [2019-09-10 07:01:57,653 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5524 transitions. Word has length 69 [2019-09-10 07:01:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:57,654 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5524 transitions. [2019-09-10 07:01:57,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5524 transitions. [2019-09-10 07:01:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:01:57,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:57,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:57,663 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash -135245892, now seen corresponding path program 1 times [2019-09-10 07:01:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:57,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:57,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:57,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:57,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:57,863 INFO L87 Difference]: Start difference. First operand 3893 states and 5524 transitions. Second operand 6 states. [2019-09-10 07:01:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:58,679 INFO L93 Difference]: Finished difference Result 7001 states and 10117 transitions. [2019-09-10 07:01:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:58,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:01:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:58,720 INFO L225 Difference]: With dead ends: 7001 [2019-09-10 07:01:58,720 INFO L226 Difference]: Without dead ends: 7001 [2019-09-10 07:01:58,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2019-09-10 07:01:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 6955. [2019-09-10 07:01:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6955 states. [2019-09-10 07:01:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 10079 transitions. [2019-09-10 07:01:58,916 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 10079 transitions. Word has length 69 [2019-09-10 07:01:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:58,918 INFO L475 AbstractCegarLoop]: Abstraction has 6955 states and 10079 transitions. [2019-09-10 07:01:58,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 10079 transitions. [2019-09-10 07:01:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:01:58,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:58,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:58,933 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash 956177235, now seen corresponding path program 1 times [2019-09-10 07:01:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:58,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:59,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 07:01:59,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:59,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:59,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:59,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:59,093 INFO L87 Difference]: Start difference. First operand 6955 states and 10079 transitions. Second operand 6 states. [2019-09-10 07:01:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:59,781 INFO L93 Difference]: Finished difference Result 16325 states and 23584 transitions. [2019-09-10 07:01:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:59,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:01:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:59,857 INFO L225 Difference]: With dead ends: 16325 [2019-09-10 07:01:59,857 INFO L226 Difference]: Without dead ends: 16325 [2019-09-10 07:01:59,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:01:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16325 states. [2019-09-10 07:02:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16325 to 16309. [2019-09-10 07:02:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16309 states. [2019-09-10 07:02:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16309 states to 16309 states and 23576 transitions. [2019-09-10 07:02:00,156 INFO L78 Accepts]: Start accepts. Automaton has 16309 states and 23576 transitions. Word has length 70 [2019-09-10 07:02:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:00,157 INFO L475 AbstractCegarLoop]: Abstraction has 16309 states and 23576 transitions. [2019-09-10 07:02:00,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 16309 states and 23576 transitions. [2019-09-10 07:02:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:02:00,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:00,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] [2019-09-10 07:02:00,165 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1074377200, now seen corresponding path program 1 times [2019-09-10 07:02:00,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:00,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:00,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:00,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:00,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:00,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:00,296 INFO L87 Difference]: Start difference. First operand 16309 states and 23576 transitions. Second operand 3 states. [2019-09-10 07:02:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:00,463 INFO L93 Difference]: Finished difference Result 24527 states and 35039 transitions. [2019-09-10 07:02:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:00,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 07:02:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:00,518 INFO L225 Difference]: With dead ends: 24527 [2019-09-10 07:02:00,518 INFO L226 Difference]: Without dead ends: 24527 [2019-09-10 07:02:00,519 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 07:02:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24527 states. [2019-09-10 07:02:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24527 to 24369. [2019-09-10 07:02:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24369 states. [2019-09-10 07:02:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24369 states to 24369 states and 34885 transitions. [2019-09-10 07:02:01,063 INFO L78 Accepts]: Start accepts. Automaton has 24369 states and 34885 transitions. Word has length 70 [2019-09-10 07:02:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:01,063 INFO L475 AbstractCegarLoop]: Abstraction has 24369 states and 34885 transitions. [2019-09-10 07:02:01,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 24369 states and 34885 transitions. [2019-09-10 07:02:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:02:01,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:01,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:01,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash -36131484, now seen corresponding path program 1 times [2019-09-10 07:02:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:01,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:01,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:01,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:01,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:01,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:01,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:01,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:01,212 INFO L87 Difference]: Start difference. First operand 24369 states and 34885 transitions. Second operand 7 states. [2019-09-10 07:02:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:02,784 INFO L93 Difference]: Finished difference Result 78161 states and 112755 transitions. [2019-09-10 07:02:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:02:02,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:02:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:02,973 INFO L225 Difference]: With dead ends: 78161 [2019-09-10 07:02:02,973 INFO L226 Difference]: Without dead ends: 78161 [2019-09-10 07:02:02,974 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 07:02:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78161 states. [2019-09-10 07:02:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78161 to 24397. [2019-09-10 07:02:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24397 states. [2019-09-10 07:02:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24397 states to 24397 states and 34921 transitions. [2019-09-10 07:02:04,112 INFO L78 Accepts]: Start accepts. Automaton has 24397 states and 34921 transitions. Word has length 71 [2019-09-10 07:02:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:04,113 INFO L475 AbstractCegarLoop]: Abstraction has 24397 states and 34921 transitions. [2019-09-10 07:02:04,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 24397 states and 34921 transitions. [2019-09-10 07:02:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:02:04,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:04,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:04,127 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1924835021, now seen corresponding path program 1 times [2019-09-10 07:02:04,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:04,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:04,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:04,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:04,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:04,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 07:02:04,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:04,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:04,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:04,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:04,318 INFO L87 Difference]: Start difference. First operand 24397 states and 34921 transitions. Second operand 7 states. [2019-09-10 07:02:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:05,914 INFO L93 Difference]: Finished difference Result 89450 states and 128879 transitions. [2019-09-10 07:02:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:02:05,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:02:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:06,106 INFO L225 Difference]: With dead ends: 89450 [2019-09-10 07:02:06,106 INFO L226 Difference]: Without dead ends: 89450 [2019-09-10 07:02:06,107 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 07:02:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89450 states. [2019-09-10 07:02:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89450 to 24485. [2019-09-10 07:02:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24485 states. [2019-09-10 07:02:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24485 states to 24485 states and 35042 transitions. [2019-09-10 07:02:07,394 INFO L78 Accepts]: Start accepts. Automaton has 24485 states and 35042 transitions. Word has length 71 [2019-09-10 07:02:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:07,395 INFO L475 AbstractCegarLoop]: Abstraction has 24485 states and 35042 transitions. [2019-09-10 07:02:07,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24485 states and 35042 transitions. [2019-09-10 07:02:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:02:07,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:07,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:07,411 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash -181098417, now seen corresponding path program 1 times [2019-09-10 07:02:07,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:07,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:07,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:07,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:07,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:07,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:07,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:07,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:07,555 INFO L87 Difference]: Start difference. First operand 24485 states and 35042 transitions. Second operand 7 states. [2019-09-10 07:02:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:08,977 INFO L93 Difference]: Finished difference Result 131076 states and 189541 transitions. [2019-09-10 07:02:08,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:02:08,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:02:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:09,145 INFO L225 Difference]: With dead ends: 131076 [2019-09-10 07:02:09,146 INFO L226 Difference]: Without dead ends: 131076 [2019-09-10 07:02:09,146 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 07:02:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131076 states. [2019-09-10 07:02:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131076 to 24553. [2019-09-10 07:02:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24553 states. [2019-09-10 07:02:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24553 states to 24553 states and 35130 transitions. [2019-09-10 07:02:10,416 INFO L78 Accepts]: Start accepts. Automaton has 24553 states and 35130 transitions. Word has length 71 [2019-09-10 07:02:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:10,416 INFO L475 AbstractCegarLoop]: Abstraction has 24553 states and 35130 transitions. [2019-09-10 07:02:10,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 24553 states and 35130 transitions. [2019-09-10 07:02:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:02:10,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:10,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] [2019-09-10 07:02:10,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 514388176, now seen corresponding path program 1 times [2019-09-10 07:02:10,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:10,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:10,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:10,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:10,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:10,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:10,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:10,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:10,555 INFO L87 Difference]: Start difference. First operand 24553 states and 35130 transitions. Second operand 7 states. [2019-09-10 07:02:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:11,913 INFO L93 Difference]: Finished difference Result 104410 states and 150685 transitions. [2019-09-10 07:02:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:02:11,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:02:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:12,271 INFO L225 Difference]: With dead ends: 104410 [2019-09-10 07:02:12,272 INFO L226 Difference]: Without dead ends: 104410 [2019-09-10 07:02:12,272 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 07:02:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104410 states. [2019-09-10 07:02:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104410 to 24682. [2019-09-10 07:02:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24682 states. [2019-09-10 07:02:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24682 states to 24682 states and 35301 transitions. [2019-09-10 07:02:12,964 INFO L78 Accepts]: Start accepts. Automaton has 24682 states and 35301 transitions. Word has length 71 [2019-09-10 07:02:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:12,965 INFO L475 AbstractCegarLoop]: Abstraction has 24682 states and 35301 transitions. [2019-09-10 07:02:12,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24682 states and 35301 transitions. [2019-09-10 07:02:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:02:12,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:12,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:12,985 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash 178314812, now seen corresponding path program 1 times [2019-09-10 07:02:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:12,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:12,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:12,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:13,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:13,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:13,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:13,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:13,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:13,199 INFO L87 Difference]: Start difference. First operand 24682 states and 35301 transitions. Second operand 9 states. [2019-09-10 07:02:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:16,241 INFO L93 Difference]: Finished difference Result 102128 states and 149128 transitions. [2019-09-10 07:02:16,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:02:16,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:02:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:16,397 INFO L225 Difference]: With dead ends: 102128 [2019-09-10 07:02:16,398 INFO L226 Difference]: Without dead ends: 102128 [2019-09-10 07:02:16,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:02:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102128 states. [2019-09-10 07:02:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102128 to 24673. [2019-09-10 07:02:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24673 states. [2019-09-10 07:02:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24673 states to 24673 states and 35283 transitions. [2019-09-10 07:02:17,164 INFO L78 Accepts]: Start accepts. Automaton has 24673 states and 35283 transitions. Word has length 72 [2019-09-10 07:02:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:17,164 INFO L475 AbstractCegarLoop]: Abstraction has 24673 states and 35283 transitions. [2019-09-10 07:02:17,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24673 states and 35283 transitions. [2019-09-10 07:02:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:02:17,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:17,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] [2019-09-10 07:02:17,176 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 334798970, now seen corresponding path program 1 times [2019-09-10 07:02:17,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:17,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:17,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:17,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:17,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:17,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:17,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:17,318 INFO L87 Difference]: Start difference. First operand 24673 states and 35283 transitions. Second operand 7 states. [2019-09-10 07:02:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:18,966 INFO L93 Difference]: Finished difference Result 89666 states and 129168 transitions. [2019-09-10 07:02:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:02:18,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 07:02:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:19,084 INFO L225 Difference]: With dead ends: 89666 [2019-09-10 07:02:19,085 INFO L226 Difference]: Without dead ends: 89666 [2019-09-10 07:02:19,085 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 07:02:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89666 states. [2019-09-10 07:02:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89666 to 24742. [2019-09-10 07:02:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24742 states. [2019-09-10 07:02:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24742 states to 24742 states and 35380 transitions. [2019-09-10 07:02:19,817 INFO L78 Accepts]: Start accepts. Automaton has 24742 states and 35380 transitions. Word has length 72 [2019-09-10 07:02:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:19,818 INFO L475 AbstractCegarLoop]: Abstraction has 24742 states and 35380 transitions. [2019-09-10 07:02:19,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 24742 states and 35380 transitions. [2019-09-10 07:02:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:02:19,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:19,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:19,827 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash -132358958, now seen corresponding path program 1 times [2019-09-10 07:02:19,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:19,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:19,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:20,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:20,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:20,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:20,031 INFO L87 Difference]: Start difference. First operand 24742 states and 35380 transitions. Second operand 9 states. [2019-09-10 07:02:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:22,551 INFO L93 Difference]: Finished difference Result 102212 states and 149251 transitions. [2019-09-10 07:02:22,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:02:22,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:02:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:22,709 INFO L225 Difference]: With dead ends: 102212 [2019-09-10 07:02:22,709 INFO L226 Difference]: Without dead ends: 102212 [2019-09-10 07:02:22,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:02:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102212 states. [2019-09-10 07:02:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102212 to 24714. [2019-09-10 07:02:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24714 states. [2019-09-10 07:02:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24714 states to 24714 states and 35336 transitions. [2019-09-10 07:02:23,473 INFO L78 Accepts]: Start accepts. Automaton has 24714 states and 35336 transitions. Word has length 72 [2019-09-10 07:02:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:23,474 INFO L475 AbstractCegarLoop]: Abstraction has 24714 states and 35336 transitions. [2019-09-10 07:02:23,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 24714 states and 35336 transitions. [2019-09-10 07:02:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:02:23,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:23,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:23,481 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1003542542, now seen corresponding path program 1 times [2019-09-10 07:02:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:23,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:23,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:23,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:23,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:23,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:23,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:23,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:23,715 INFO L87 Difference]: Start difference. First operand 24714 states and 35336 transitions. Second operand 9 states. [2019-09-10 07:02:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:25,990 INFO L93 Difference]: Finished difference Result 101002 states and 146287 transitions. [2019-09-10 07:02:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:02:25,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:02:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:26,111 INFO L225 Difference]: With dead ends: 101002 [2019-09-10 07:02:26,111 INFO L226 Difference]: Without dead ends: 101002 [2019-09-10 07:02:26,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:02:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101002 states. [2019-09-10 07:02:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101002 to 24528. [2019-09-10 07:02:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24528 states. [2019-09-10 07:02:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24528 states to 24528 states and 35089 transitions. [2019-09-10 07:02:26,802 INFO L78 Accepts]: Start accepts. Automaton has 24528 states and 35089 transitions. Word has length 72 [2019-09-10 07:02:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:26,802 INFO L475 AbstractCegarLoop]: Abstraction has 24528 states and 35089 transitions. [2019-09-10 07:02:26,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24528 states and 35089 transitions. [2019-09-10 07:02:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:02:26,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:26,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:26,809 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash 499783753, now seen corresponding path program 1 times [2019-09-10 07:02:26,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:26,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:27,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:27,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:02:27,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:27,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:02:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:02:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:02:27,013 INFO L87 Difference]: Start difference. First operand 24528 states and 35089 transitions. Second operand 8 states. [2019-09-10 07:02:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:28,606 INFO L93 Difference]: Finished difference Result 80251 states and 116761 transitions. [2019-09-10 07:02:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:02:28,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-10 07:02:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:28,698 INFO L225 Difference]: With dead ends: 80251 [2019-09-10 07:02:28,699 INFO L226 Difference]: Without dead ends: 80251 [2019-09-10 07:02:28,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:02:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80251 states. [2019-09-10 07:02:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80251 to 23936. [2019-09-10 07:02:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23936 states. [2019-09-10 07:02:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23936 states to 23936 states and 34317 transitions. [2019-09-10 07:02:29,487 INFO L78 Accepts]: Start accepts. Automaton has 23936 states and 34317 transitions. Word has length 72 [2019-09-10 07:02:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:29,488 INFO L475 AbstractCegarLoop]: Abstraction has 23936 states and 34317 transitions. [2019-09-10 07:02:29,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:02:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23936 states and 34317 transitions. [2019-09-10 07:02:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:02:29,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:29,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:29,494 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash -108281974, now seen corresponding path program 1 times [2019-09-10 07:02:29,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:29,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:29,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:29,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:29,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:30,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:02:30,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:30,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:02:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:02:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:02:30,069 INFO L87 Difference]: Start difference. First operand 23936 states and 34317 transitions. Second operand 12 states. [2019-09-10 07:02:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:32,756 INFO L93 Difference]: Finished difference Result 135842 states and 198282 transitions. [2019-09-10 07:02:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:02:32,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:02:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:32,907 INFO L225 Difference]: With dead ends: 135842 [2019-09-10 07:02:32,907 INFO L226 Difference]: Without dead ends: 135842 [2019-09-10 07:02:32,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:02:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135842 states. [2019-09-10 07:02:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135842 to 23882. [2019-09-10 07:02:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23882 states. [2019-09-10 07:02:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23882 states to 23882 states and 34240 transitions. [2019-09-10 07:02:33,604 INFO L78 Accepts]: Start accepts. Automaton has 23882 states and 34240 transitions. Word has length 73 [2019-09-10 07:02:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:33,604 INFO L475 AbstractCegarLoop]: Abstraction has 23882 states and 34240 transitions. [2019-09-10 07:02:33,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:02:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23882 states and 34240 transitions. [2019-09-10 07:02:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:02:33,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:33,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:33,611 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1790307750, now seen corresponding path program 1 times [2019-09-10 07:02:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:33,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:33,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:33,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:33,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:34,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:34,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:02:34,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:34,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:02:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:02:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:02:34,134 INFO L87 Difference]: Start difference. First operand 23882 states and 34240 transitions. Second operand 11 states. [2019-09-10 07:02:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:36,528 INFO L93 Difference]: Finished difference Result 148035 states and 215290 transitions. [2019-09-10 07:02:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:02:36,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-10 07:02:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:36,690 INFO L225 Difference]: With dead ends: 148035 [2019-09-10 07:02:36,690 INFO L226 Difference]: Without dead ends: 148035 [2019-09-10 07:02:36,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:02:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148035 states. [2019-09-10 07:02:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148035 to 23417. [2019-09-10 07:02:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23417 states. [2019-09-10 07:02:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23417 states to 23417 states and 33604 transitions. [2019-09-10 07:02:37,441 INFO L78 Accepts]: Start accepts. Automaton has 23417 states and 33604 transitions. Word has length 73 [2019-09-10 07:02:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:37,441 INFO L475 AbstractCegarLoop]: Abstraction has 23417 states and 33604 transitions. [2019-09-10 07:02:37,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:02:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23417 states and 33604 transitions. [2019-09-10 07:02:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:02:37,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:37,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:37,447 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 127087552, now seen corresponding path program 1 times [2019-09-10 07:02:37,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:37,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:37,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:37,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:02:37,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:37,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:02:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:02:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:02:37,929 INFO L87 Difference]: Start difference. First operand 23417 states and 33604 transitions. Second operand 12 states. [2019-09-10 07:02:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:41,617 INFO L93 Difference]: Finished difference Result 135773 states and 198079 transitions. [2019-09-10 07:02:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:02:41,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:02:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:41,804 INFO L225 Difference]: With dead ends: 135773 [2019-09-10 07:02:41,804 INFO L226 Difference]: Without dead ends: 135773 [2019-09-10 07:02:41,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:02:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135773 states. [2019-09-10 07:02:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135773 to 23137. [2019-09-10 07:02:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23137 states. [2019-09-10 07:02:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23137 states to 23137 states and 33253 transitions. [2019-09-10 07:02:42,590 INFO L78 Accepts]: Start accepts. Automaton has 23137 states and 33253 transitions. Word has length 73 [2019-09-10 07:02:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:42,591 INFO L475 AbstractCegarLoop]: Abstraction has 23137 states and 33253 transitions. [2019-09-10 07:02:42,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:02:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 23137 states and 33253 transitions. [2019-09-10 07:02:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:02:42,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:42,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:42,597 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1318862985, now seen corresponding path program 1 times [2019-09-10 07:02:42,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:42,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:42,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:42,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:42,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:42,694 INFO L87 Difference]: Start difference. First operand 23137 states and 33253 transitions. Second operand 3 states. [2019-09-10 07:02:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:42,798 INFO L93 Difference]: Finished difference Result 23141 states and 32989 transitions. [2019-09-10 07:02:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:42,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:02:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:42,834 INFO L225 Difference]: With dead ends: 23141 [2019-09-10 07:02:42,834 INFO L226 Difference]: Without dead ends: 23141 [2019-09-10 07:02:42,835 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 07:02:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23141 states. [2019-09-10 07:02:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23141 to 23137. [2019-09-10 07:02:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23137 states. [2019-09-10 07:02:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23137 states to 23137 states and 32987 transitions. [2019-09-10 07:02:43,129 INFO L78 Accepts]: Start accepts. Automaton has 23137 states and 32987 transitions. Word has length 74 [2019-09-10 07:02:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:43,129 INFO L475 AbstractCegarLoop]: Abstraction has 23137 states and 32987 transitions. [2019-09-10 07:02:43,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 23137 states and 32987 transitions. [2019-09-10 07:02:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:43,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:43,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:43,134 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2059949975, now seen corresponding path program 1 times [2019-09-10 07:02:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:43,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:43,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:43,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:43,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:43,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:43,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:43,217 INFO L87 Difference]: Start difference. First operand 23137 states and 32987 transitions. Second operand 3 states. [2019-09-10 07:02:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:43,395 INFO L93 Difference]: Finished difference Result 34274 states and 49275 transitions. [2019-09-10 07:02:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:43,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:02:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:43,430 INFO L225 Difference]: With dead ends: 34274 [2019-09-10 07:02:43,430 INFO L226 Difference]: Without dead ends: 34274 [2019-09-10 07:02:43,430 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 07:02:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34274 states. [2019-09-10 07:02:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34274 to 26832. [2019-09-10 07:02:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26832 states. [2019-09-10 07:02:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26832 states to 26832 states and 38509 transitions. [2019-09-10 07:02:43,667 INFO L78 Accepts]: Start accepts. Automaton has 26832 states and 38509 transitions. Word has length 75 [2019-09-10 07:02:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:43,667 INFO L475 AbstractCegarLoop]: Abstraction has 26832 states and 38509 transitions. [2019-09-10 07:02:43,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26832 states and 38509 transitions. [2019-09-10 07:02:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:02:43,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:43,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:43,672 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 927142990, now seen corresponding path program 1 times [2019-09-10 07:02:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:43,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:43,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:43,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:43,747 INFO L87 Difference]: Start difference. First operand 26832 states and 38509 transitions. Second operand 3 states. [2019-09-10 07:02:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:43,882 INFO L93 Difference]: Finished difference Result 34550 states and 49699 transitions. [2019-09-10 07:02:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:43,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:02:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:43,923 INFO L225 Difference]: With dead ends: 34550 [2019-09-10 07:02:43,923 INFO L226 Difference]: Without dead ends: 34550 [2019-09-10 07:02:43,924 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 07:02:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34550 states. [2019-09-10 07:02:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34550 to 25602. [2019-09-10 07:02:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25602 states. [2019-09-10 07:02:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25602 states to 25602 states and 36850 transitions. [2019-09-10 07:02:44,186 INFO L78 Accepts]: Start accepts. Automaton has 25602 states and 36850 transitions. Word has length 75 [2019-09-10 07:02:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:44,186 INFO L475 AbstractCegarLoop]: Abstraction has 25602 states and 36850 transitions. [2019-09-10 07:02:44,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25602 states and 36850 transitions. [2019-09-10 07:02:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:02:44,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:44,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:44,190 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash 444387185, now seen corresponding path program 1 times [2019-09-10 07:02:44,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:44,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:44,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:44,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:44,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:44,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:44,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:44,378 INFO L87 Difference]: Start difference. First operand 25602 states and 36850 transitions. Second operand 9 states. [2019-09-10 07:02:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:46,325 INFO L93 Difference]: Finished difference Result 79403 states and 115164 transitions. [2019-09-10 07:02:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:02:46,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-10 07:02:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:46,432 INFO L225 Difference]: With dead ends: 79403 [2019-09-10 07:02:46,432 INFO L226 Difference]: Without dead ends: 79403 [2019-09-10 07:02:46,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:02:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79403 states. [2019-09-10 07:02:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79403 to 25566. [2019-09-10 07:02:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25566 states. [2019-09-10 07:02:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25566 states to 25566 states and 36801 transitions. [2019-09-10 07:02:46,913 INFO L78 Accepts]: Start accepts. Automaton has 25566 states and 36801 transitions. Word has length 76 [2019-09-10 07:02:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:46,913 INFO L475 AbstractCegarLoop]: Abstraction has 25566 states and 36801 transitions. [2019-09-10 07:02:46,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 25566 states and 36801 transitions. [2019-09-10 07:02:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:02:46,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:46,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] [2019-09-10 07:02:46,917 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -31713190, now seen corresponding path program 1 times [2019-09-10 07:02:46,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:46,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:46,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:47,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:47,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:47,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:47,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:47,008 INFO L87 Difference]: Start difference. First operand 25566 states and 36801 transitions. Second operand 3 states. [2019-09-10 07:02:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:47,115 INFO L93 Difference]: Finished difference Result 25570 states and 36414 transitions. [2019-09-10 07:02:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:47,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:02:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:47,152 INFO L225 Difference]: With dead ends: 25570 [2019-09-10 07:02:47,153 INFO L226 Difference]: Without dead ends: 25570 [2019-09-10 07:02:47,153 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 07:02:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25570 states. [2019-09-10 07:02:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25570 to 25566. [2019-09-10 07:02:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25566 states. [2019-09-10 07:02:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25566 states to 25566 states and 36412 transitions. [2019-09-10 07:02:47,454 INFO L78 Accepts]: Start accepts. Automaton has 25566 states and 36412 transitions. Word has length 77 [2019-09-10 07:02:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:47,454 INFO L475 AbstractCegarLoop]: Abstraction has 25566 states and 36412 transitions. [2019-09-10 07:02:47,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25566 states and 36412 transitions. [2019-09-10 07:02:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:02:47,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:47,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:47,461 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:47,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash 598552081, now seen corresponding path program 1 times [2019-09-10 07:02:47,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:47,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:47,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:47,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:47,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:48,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:48,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:02:48,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:48,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:02:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:02:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:02:48,261 INFO L87 Difference]: Start difference. First operand 25566 states and 36412 transitions. Second operand 17 states. [2019-09-10 07:02:48,944 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:02:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:51,067 INFO L93 Difference]: Finished difference Result 42369 states and 60509 transitions. [2019-09-10 07:02:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:02:51,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2019-09-10 07:02:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:51,115 INFO L225 Difference]: With dead ends: 42369 [2019-09-10 07:02:51,115 INFO L226 Difference]: Without dead ends: 42369 [2019-09-10 07:02:51,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:02:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42369 states. [2019-09-10 07:02:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42369 to 25534. [2019-09-10 07:02:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25534 states. [2019-09-10 07:02:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 36372 transitions. [2019-09-10 07:02:51,430 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 36372 transitions. Word has length 79 [2019-09-10 07:02:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:51,431 INFO L475 AbstractCegarLoop]: Abstraction has 25534 states and 36372 transitions. [2019-09-10 07:02:51,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:02:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 36372 transitions. [2019-09-10 07:02:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:02:51,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:51,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:51,436 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1291163895, now seen corresponding path program 1 times [2019-09-10 07:02:51,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:51,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02: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 07:02:51,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:51,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:51,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:51,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:51,516 INFO L87 Difference]: Start difference. First operand 25534 states and 36372 transitions. Second operand 3 states. [2019-09-10 07:02:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:51,699 INFO L93 Difference]: Finished difference Result 39093 states and 55893 transitions. [2019-09-10 07:02:51,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:51,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:02:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:51,934 INFO L225 Difference]: With dead ends: 39093 [2019-09-10 07:02:51,935 INFO L226 Difference]: Without dead ends: 39093 [2019-09-10 07:02:51,935 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 07:02:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39093 states. [2019-09-10 07:02:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39093 to 25420. [2019-09-10 07:02:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25420 states. [2019-09-10 07:02:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25420 states to 25420 states and 36146 transitions. [2019-09-10 07:02:52,190 INFO L78 Accepts]: Start accepts. Automaton has 25420 states and 36146 transitions. Word has length 79 [2019-09-10 07:02:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:52,191 INFO L475 AbstractCegarLoop]: Abstraction has 25420 states and 36146 transitions. [2019-09-10 07:02:52,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 25420 states and 36146 transitions. [2019-09-10 07:02:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:02:52,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:52,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:52,196 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1359737498, now seen corresponding path program 1 times [2019-09-10 07:02:52,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:52,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:52,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:52,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:02:52,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:52,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:02:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:02:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:02:52,586 INFO L87 Difference]: Start difference. First operand 25420 states and 36146 transitions. Second operand 11 states. [2019-09-10 07:02:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:53,696 INFO L93 Difference]: Finished difference Result 61779 states and 88480 transitions. [2019-09-10 07:02:53,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:02:53,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2019-09-10 07:02:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:53,773 INFO L225 Difference]: With dead ends: 61779 [2019-09-10 07:02:53,773 INFO L226 Difference]: Without dead ends: 61779 [2019-09-10 07:02:53,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:02:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61779 states. [2019-09-10 07:02:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61779 to 25416. [2019-09-10 07:02:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25416 states. [2019-09-10 07:02:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25416 states to 25416 states and 36141 transitions. [2019-09-10 07:02:54,162 INFO L78 Accepts]: Start accepts. Automaton has 25416 states and 36141 transitions. Word has length 80 [2019-09-10 07:02:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:54,162 INFO L475 AbstractCegarLoop]: Abstraction has 25416 states and 36141 transitions. [2019-09-10 07:02:54,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:02:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25416 states and 36141 transitions. [2019-09-10 07:02:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:02:54,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:54,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:54,181 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash 638116678, now seen corresponding path program 1 times [2019-09-10 07:02:54,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:54,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:54,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:54,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:54,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:02:54,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:54,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:02:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:02:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:02:54,311 INFO L87 Difference]: Start difference. First operand 25416 states and 36141 transitions. Second operand 7 states. [2019-09-10 07:02:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:54,908 INFO L93 Difference]: Finished difference Result 172133 states and 243223 transitions. [2019-09-10 07:02:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:02:54,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:02:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:55,155 INFO L225 Difference]: With dead ends: 172133 [2019-09-10 07:02:55,156 INFO L226 Difference]: Without dead ends: 172133 [2019-09-10 07:02:55,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:02:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172133 states. [2019-09-10 07:02:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172133 to 95976. [2019-09-10 07:02:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95976 states. [2019-09-10 07:02:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95976 states to 95976 states and 135876 transitions. [2019-09-10 07:02:58,182 INFO L78 Accepts]: Start accepts. Automaton has 95976 states and 135876 transitions. Word has length 88 [2019-09-10 07:02:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:58,182 INFO L475 AbstractCegarLoop]: Abstraction has 95976 states and 135876 transitions. [2019-09-10 07:02:58,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:02:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 95976 states and 135876 transitions. [2019-09-10 07:02:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:02:58,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:58,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] [2019-09-10 07:02:58,205 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1941368129, now seen corresponding path program 1 times [2019-09-10 07:02:58,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:58,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:58,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:58,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:58,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:58,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:02:58,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:58,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:02:58,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:02:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:02:58,365 INFO L87 Difference]: Start difference. First operand 95976 states and 135876 transitions. Second operand 6 states. [2019-09-10 07:02:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:58,804 INFO L93 Difference]: Finished difference Result 102080 states and 142585 transitions. [2019-09-10 07:02:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:02:58,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 07:02:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:59,049 INFO L225 Difference]: With dead ends: 102080 [2019-09-10 07:02:59,050 INFO L226 Difference]: Without dead ends: 101862 [2019-09-10 07:02:59,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:02:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101862 states. [2019-09-10 07:02:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101862 to 84019. [2019-09-10 07:02:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84019 states. [2019-09-10 07:02:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84019 states to 84019 states and 117700 transitions. [2019-09-10 07:02:59,947 INFO L78 Accepts]: Start accepts. Automaton has 84019 states and 117700 transitions. Word has length 89 [2019-09-10 07:02:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:59,947 INFO L475 AbstractCegarLoop]: Abstraction has 84019 states and 117700 transitions. [2019-09-10 07:02:59,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84019 states and 117700 transitions. [2019-09-10 07:02:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:02:59,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:59,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:59,964 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1942450074, now seen corresponding path program 1 times [2019-09-10 07:02:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:59,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:59,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:00,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:00,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:00,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:00,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:00,075 INFO L87 Difference]: Start difference. First operand 84019 states and 117700 transitions. Second operand 6 states. [2019-09-10 07:03:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:00,529 INFO L93 Difference]: Finished difference Result 153650 states and 211957 transitions. [2019-09-10 07:03:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:03:00,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 07:03:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:00,896 INFO L225 Difference]: With dead ends: 153650 [2019-09-10 07:03:00,896 INFO L226 Difference]: Without dead ends: 153650 [2019-09-10 07:03:00,897 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 07:03:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153650 states. [2019-09-10 07:03:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153650 to 85798. [2019-09-10 07:03:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85798 states. [2019-09-10 07:03:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85798 states to 85798 states and 118886 transitions. [2019-09-10 07:03:04,783 INFO L78 Accepts]: Start accepts. Automaton has 85798 states and 118886 transitions. Word has length 90 [2019-09-10 07:03:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:04,784 INFO L475 AbstractCegarLoop]: Abstraction has 85798 states and 118886 transitions. [2019-09-10 07:03:04,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 85798 states and 118886 transitions. [2019-09-10 07:03:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:03:04,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:04,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:04,801 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash 473303259, now seen corresponding path program 1 times [2019-09-10 07:03:04,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:04,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:04,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:04,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:04,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:04,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:04,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:04,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:04,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:04,900 INFO L87 Difference]: Start difference. First operand 85798 states and 118886 transitions. Second operand 3 states. [2019-09-10 07:03:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:05,295 INFO L93 Difference]: Finished difference Result 159610 states and 218730 transitions. [2019-09-10 07:03:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:05,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:03:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:05,523 INFO L225 Difference]: With dead ends: 159610 [2019-09-10 07:03:05,523 INFO L226 Difference]: Without dead ends: 159610 [2019-09-10 07:03:05,525 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 07:03:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159610 states. [2019-09-10 07:03:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159610 to 158004. [2019-09-10 07:03:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158004 states. [2019-09-10 07:03:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158004 states to 158004 states and 217125 transitions. [2019-09-10 07:03:07,156 INFO L78 Accepts]: Start accepts. Automaton has 158004 states and 217125 transitions. Word has length 91 [2019-09-10 07:03:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:07,157 INFO L475 AbstractCegarLoop]: Abstraction has 158004 states and 217125 transitions. [2019-09-10 07:03:07,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 158004 states and 217125 transitions. [2019-09-10 07:03:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:03:07,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:07,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:07,185 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1096080938, now seen corresponding path program 1 times [2019-09-10 07:03:07,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:07,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:07,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:07,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:07,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:07,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:07,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:07,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:07,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:07,268 INFO L87 Difference]: Start difference. First operand 158004 states and 217125 transitions. Second operand 3 states. [2019-09-10 07:03:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:08,053 INFO L93 Difference]: Finished difference Result 299019 states and 405293 transitions. [2019-09-10 07:03:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:08,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:03:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:11,935 INFO L225 Difference]: With dead ends: 299019 [2019-09-10 07:03:11,935 INFO L226 Difference]: Without dead ends: 295016 [2019-09-10 07:03:11,935 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 07:03:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295016 states. [2019-09-10 07:03:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295016 to 277031. [2019-09-10 07:03:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277031 states. [2019-09-10 07:03:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277031 states to 277031 states and 376839 transitions. [2019-09-10 07:03:15,224 INFO L78 Accepts]: Start accepts. Automaton has 277031 states and 376839 transitions. Word has length 92 [2019-09-10 07:03:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:15,224 INFO L475 AbstractCegarLoop]: Abstraction has 277031 states and 376839 transitions. [2019-09-10 07:03:15,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 277031 states and 376839 transitions. [2019-09-10 07:03:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:03:15,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:15,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:15,252 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -489740822, now seen corresponding path program 1 times [2019-09-10 07:03:15,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:15,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:15,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:15,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 07:03:15,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:15,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:15,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:15,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:15,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:15,336 INFO L87 Difference]: Start difference. First operand 277031 states and 376839 transitions. Second operand 3 states. [2019-09-10 07:03:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:16,506 INFO L93 Difference]: Finished difference Result 531266 states and 710768 transitions. [2019-09-10 07:03:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:16,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:03:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:17,383 INFO L225 Difference]: With dead ends: 531266 [2019-09-10 07:03:17,384 INFO L226 Difference]: Without dead ends: 531266 [2019-09-10 07:03:17,384 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 07:03:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531266 states. [2019-09-10 07:03:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531266 to 497719. [2019-09-10 07:03:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497719 states. [2019-09-10 07:03:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497719 states to 497719 states and 666049 transitions. [2019-09-10 07:03:30,421 INFO L78 Accepts]: Start accepts. Automaton has 497719 states and 666049 transitions. Word has length 93 [2019-09-10 07:03:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:30,421 INFO L475 AbstractCegarLoop]: Abstraction has 497719 states and 666049 transitions. [2019-09-10 07:03:30,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 497719 states and 666049 transitions. [2019-09-10 07:03:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:03:30,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:30,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:30,446 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash 880497978, now seen corresponding path program 1 times [2019-09-10 07:03:30,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:30,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:30,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:30,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:30,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:30,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:30,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:30,530 INFO L87 Difference]: Start difference. First operand 497719 states and 666049 transitions. Second operand 3 states. [2019-09-10 07:03:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:40,627 INFO L93 Difference]: Finished difference Result 900958 states and 1188476 transitions. [2019-09-10 07:03:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:40,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:03:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:42,018 INFO L225 Difference]: With dead ends: 900958 [2019-09-10 07:03:42,019 INFO L226 Difference]: Without dead ends: 890407 [2019-09-10 07:03:42,019 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 07:03:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890407 states. [2019-09-10 07:03:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890407 to 819729. [2019-09-10 07:03:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819729 states. [2019-09-10 07:04:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819729 states to 819729 states and 1088880 transitions. [2019-09-10 07:04:10,680 INFO L78 Accepts]: Start accepts. Automaton has 819729 states and 1088880 transitions. Word has length 94 [2019-09-10 07:04:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:10,680 INFO L475 AbstractCegarLoop]: Abstraction has 819729 states and 1088880 transitions. [2019-09-10 07:04:10,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:04:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 819729 states and 1088880 transitions. [2019-09-10 07:04:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:04:10,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:10,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:10,696 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1896018749, now seen corresponding path program 1 times [2019-09-10 07:04:10,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:10,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:10,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:10,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:04:10,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:10,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:04:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:04:10,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:10,778 INFO L87 Difference]: Start difference. First operand 819729 states and 1088880 transitions. Second operand 3 states. [2019-09-10 07:04:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:16,284 INFO L93 Difference]: Finished difference Result 1284635 states and 1680681 transitions. [2019-09-10 07:04:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:04:16,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:04:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:31,452 INFO L225 Difference]: With dead ends: 1284635 [2019-09-10 07:04:31,452 INFO L226 Difference]: Without dead ends: 1284590 [2019-09-10 07:04:31,453 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 07:04:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284590 states. [2019-09-10 07:04:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284590 to 1178651. [2019-09-10 07:04:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178651 states. [2019-09-10 07:05:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178651 states to 1178651 states and 1549604 transitions. [2019-09-10 07:05:00,147 INFO L78 Accepts]: Start accepts. Automaton has 1178651 states and 1549604 transitions. Word has length 95 [2019-09-10 07:05:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:00,147 INFO L475 AbstractCegarLoop]: Abstraction has 1178651 states and 1549604 transitions. [2019-09-10 07:05:00,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1178651 states and 1549604 transitions. [2019-09-10 07:05:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:05:00,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:00,228 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:05:00,229 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash 859367608, now seen corresponding path program 1 times [2019-09-10 07:05:00,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:00,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:00,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:05:00,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:00,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:05:00,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:00,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:05:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:05:00,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:00,442 INFO L87 Difference]: Start difference. First operand 1178651 states and 1549604 transitions. Second operand 9 states. [2019-09-10 07:05:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:50,433 INFO L93 Difference]: Finished difference Result 3974356 states and 5195794 transitions. [2019-09-10 07:05:50,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:05:50,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 07:05:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:57,615 INFO L225 Difference]: With dead ends: 3974356 [2019-09-10 07:05:57,615 INFO L226 Difference]: Without dead ends: 3974356 [2019-09-10 07:05:57,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:05:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974356 states.