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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:43:37,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:43:37,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:43:37,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:43:37,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:43:37,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:43:37,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:43:37,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:43:37,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:43:37,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:43:37,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:43:37,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:43:37,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:43:37,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:43:37,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:43:37,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:43:37,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:43:37,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:43:37,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:43:37,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:43:37,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:43:37,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:43:37,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:43:37,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:43:37,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:43:37,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:43:37,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:43:37,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:43:37,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:43:37,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:43:37,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:43:37,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:43:37,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:43:37,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:43:37,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:43:37,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:43:37,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:43:37,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:43:37,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:43:37,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:43:37,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:43:37,937 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:43:37,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:43:37,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:43:37,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:43:37,960 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:43:37,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:43:37,961 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:43:37,961 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:43:37,962 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:43:37,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:43:37,962 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:43:37,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:43:37,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:43:37,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:43:37,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:43:37,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:43:37,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:43:37,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:43:37,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:43:37,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:43:37,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:43:37,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:43:37,966 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:43:37,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:43:37,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:43:37,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:43:37,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:43:37,967 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:43:37,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:43:37,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:43:37,968 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:43:37,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:43:38,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:43:38,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:43:38,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:43:38,017 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:43:38,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:43:38,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c059297c/0e5ad30a95b24931a5b0156377daacb6/FLAG3e683d5eb [2019-09-10 07:43:38,699 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:43:38,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:43:38,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c059297c/0e5ad30a95b24931a5b0156377daacb6/FLAG3e683d5eb [2019-09-10 07:43:38,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c059297c/0e5ad30a95b24931a5b0156377daacb6 [2019-09-10 07:43:38,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:43:38,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:43:38,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:43:38,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:43:38,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:43:38,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:43:38" (1/1) ... [2019-09-10 07:43:38,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5c5391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:38, skipping insertion in model container [2019-09-10 07:43:38,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:43:38" (1/1) ... [2019-09-10 07:43:38,940 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:43:39,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:43:39,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:43:39,651 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:43:40,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:43:40,075 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:43:40,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40 WrapperNode [2019-09-10 07:43:40,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:43:40,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:43:40,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:43:40,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:43:40,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (1/1) ... [2019-09-10 07:43:40,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:43:40,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:43:40,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:43:40,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:43:40,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (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:43:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:43:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:43:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:43:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:43:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:43:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:43:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:43:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:43:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:43:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:43:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:43:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:43:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:43:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:43:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:43:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:43:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:43:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:43:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:43:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:43:41,984 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:43:41,985 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:43:41,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:43:41 BoogieIcfgContainer [2019-09-10 07:43:41,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:43:41,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:43:41,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:43:41,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:43:41,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:43:38" (1/3) ... [2019-09-10 07:43:41,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590643aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:43:41, skipping insertion in model container [2019-09-10 07:43:41,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:43:40" (2/3) ... [2019-09-10 07:43:41,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590643aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:43:41, skipping insertion in model container [2019-09-10 07:43:41,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:43:41" (3/3) ... [2019-09-10 07:43:41,996 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:43:42,007 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:43:42,017 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:43:42,038 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:43:42,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:43:42,069 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:43:42,070 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:43:42,070 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:43:42,070 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:43:42,071 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:43:42,071 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:43:42,071 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:43:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states. [2019-09-10 07:43:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 07:43:42,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:42,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:42,121 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 941972639, now seen corresponding path program 1 times [2019-09-10 07:43:42,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:42,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:42,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:42,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:42,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:42,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:43:42,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:42,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:43:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:43:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:43:42,718 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 5 states. [2019-09-10 07:43:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:43,338 INFO L93 Difference]: Finished difference Result 443 states and 720 transitions. [2019-09-10 07:43:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:43:43,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-10 07:43:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:43,367 INFO L225 Difference]: With dead ends: 443 [2019-09-10 07:43:43,367 INFO L226 Difference]: Without dead ends: 431 [2019-09-10 07:43:43,369 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:43:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-10 07:43:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 389. [2019-09-10 07:43:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-09-10 07:43:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 513 transitions. [2019-09-10 07:43:43,449 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 513 transitions. Word has length 62 [2019-09-10 07:43:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:43,450 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 513 transitions. [2019-09-10 07:43:43,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:43:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 513 transitions. [2019-09-10 07:43:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:43:43,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:43,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash 66564200, now seen corresponding path program 1 times [2019-09-10 07:43:43,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:43,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:43,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:43,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:43,600 INFO L134 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:43:43,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:43,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:43:43,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:43,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:43:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:43:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:43:43,608 INFO L87 Difference]: Start difference. First operand 389 states and 513 transitions. Second operand 5 states. [2019-09-10 07:43:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:43,888 INFO L93 Difference]: Finished difference Result 363 states and 481 transitions. [2019-09-10 07:43:43,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:43:43,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:43:43,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:43,894 INFO L225 Difference]: With dead ends: 363 [2019-09-10 07:43:43,894 INFO L226 Difference]: Without dead ends: 363 [2019-09-10 07:43:43,895 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:43:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-10 07:43:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-09-10 07:43:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-10 07:43:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 481 transitions. [2019-09-10 07:43:43,929 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 481 transitions. Word has length 63 [2019-09-10 07:43:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:43,930 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 481 transitions. [2019-09-10 07:43:43,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:43:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 481 transitions. [2019-09-10 07:43:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:43:43,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:43,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,934 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash 459645881, now seen corresponding path program 1 times [2019-09-10 07:43:43,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:43,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:44,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:44,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:43:44,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:44,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:43:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:43:44,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:43:44,119 INFO L87 Difference]: Start difference. First operand 363 states and 481 transitions. Second operand 6 states. [2019-09-10 07:43:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:44,406 INFO L93 Difference]: Finished difference Result 516 states and 681 transitions. [2019-09-10 07:43:44,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:43:44,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-10 07:43:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:44,413 INFO L225 Difference]: With dead ends: 516 [2019-09-10 07:43:44,413 INFO L226 Difference]: Without dead ends: 516 [2019-09-10 07:43:44,414 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:43:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-10 07:43:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 476. [2019-09-10 07:43:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-09-10 07:43:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 648 transitions. [2019-09-10 07:43:44,429 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 648 transitions. Word has length 64 [2019-09-10 07:43:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:44,430 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 648 transitions. [2019-09-10 07:43:44,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:43:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 648 transitions. [2019-09-10 07:43:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:43:44,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:44,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,433 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:44,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1942655578, now seen corresponding path program 1 times [2019-09-10 07:43:44,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:44,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:44,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:44,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:44,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:43:44,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:44,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:43:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:43:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:43:44,550 INFO L87 Difference]: Start difference. First operand 476 states and 648 transitions. Second operand 5 states. [2019-09-10 07:43:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:44,748 INFO L93 Difference]: Finished difference Result 465 states and 632 transitions. [2019-09-10 07:43:44,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:43:44,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-10 07:43:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:44,752 INFO L225 Difference]: With dead ends: 465 [2019-09-10 07:43:44,752 INFO L226 Difference]: Without dead ends: 465 [2019-09-10 07:43:44,752 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:43:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-10 07:43:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-09-10 07:43:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 632 transitions. [2019-09-10 07:43:44,766 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 632 transitions. Word has length 65 [2019-09-10 07:43:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:44,766 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 632 transitions. [2019-09-10 07:43:44,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:43:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 632 transitions. [2019-09-10 07:43:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:43:44,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:44,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,769 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash -795955653, now seen corresponding path program 1 times [2019-09-10 07:43:44,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:44,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:44,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:44,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:44,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:44,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:44,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:44,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:44,936 INFO L87 Difference]: Start difference. First operand 465 states and 632 transitions. Second operand 9 states. [2019-09-10 07:43:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:45,973 INFO L93 Difference]: Finished difference Result 1199 states and 1704 transitions. [2019-09-10 07:43:45,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:43:45,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-10 07:43:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:45,980 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:43:45,980 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:43:45,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:43:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:43:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 465. [2019-09-10 07:43:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 630 transitions. [2019-09-10 07:43:46,004 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 630 transitions. Word has length 66 [2019-09-10 07:43:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:46,004 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 630 transitions. [2019-09-10 07:43:46,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 630 transitions. [2019-09-10 07:43:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:43:46,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:46,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:46,007 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1601893614, now seen corresponding path program 1 times [2019-09-10 07:43:46,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:46,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:46,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:46,198 INFO L134 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:43:46,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:46,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:43:46,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:46,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:43:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:43:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:43:46,200 INFO L87 Difference]: Start difference. First operand 465 states and 630 transitions. Second operand 8 states. [2019-09-10 07:43:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:46,752 INFO L93 Difference]: Finished difference Result 813 states and 1134 transitions. [2019-09-10 07:43:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:43:46,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-09-10 07:43:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:46,758 INFO L225 Difference]: With dead ends: 813 [2019-09-10 07:43:46,758 INFO L226 Difference]: Without dead ends: 813 [2019-09-10 07:43:46,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:43:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-10 07:43:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 465. [2019-09-10 07:43:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 629 transitions. [2019-09-10 07:43:46,773 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 629 transitions. Word has length 66 [2019-09-10 07:43:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:46,774 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 629 transitions. [2019-09-10 07:43:46,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:43:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 629 transitions. [2019-09-10 07:43:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:43:46,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:46,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:46,776 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash -867057492, now seen corresponding path program 1 times [2019-09-10 07:43:46,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:46,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:46,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:46,946 INFO L134 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:43:46,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:46,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:46,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:46,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:46,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:46,948 INFO L87 Difference]: Start difference. First operand 465 states and 629 transitions. Second operand 9 states. [2019-09-10 07:43:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:48,102 INFO L93 Difference]: Finished difference Result 1006 states and 1441 transitions. [2019-09-10 07:43:48,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:43:48,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-10 07:43:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:48,108 INFO L225 Difference]: With dead ends: 1006 [2019-09-10 07:43:48,108 INFO L226 Difference]: Without dead ends: 1006 [2019-09-10 07:43:48,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:43:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-10 07:43:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 465. [2019-09-10 07:43:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 628 transitions. [2019-09-10 07:43:48,133 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 628 transitions. Word has length 66 [2019-09-10 07:43:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 628 transitions. [2019-09-10 07:43:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 628 transitions. [2019-09-10 07:43:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:43:48,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:48,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:48,135 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1942709412, now seen corresponding path program 1 times [2019-09-10 07:43:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:48,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:48,296 INFO L134 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:43:48,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:48,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:48,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:48,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:48,298 INFO L87 Difference]: Start difference. First operand 465 states and 628 transitions. Second operand 9 states. [2019-09-10 07:43:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:49,339 INFO L93 Difference]: Finished difference Result 1224 states and 1739 transitions. [2019-09-10 07:43:49,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:49,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-10 07:43:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:49,346 INFO L225 Difference]: With dead ends: 1224 [2019-09-10 07:43:49,346 INFO L226 Difference]: Without dead ends: 1224 [2019-09-10 07:43:49,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-10 07:43:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 465. [2019-09-10 07:43:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 627 transitions. [2019-09-10 07:43:49,369 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 627 transitions. Word has length 66 [2019-09-10 07:43:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:49,369 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 627 transitions. [2019-09-10 07:43:49,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 627 transitions. [2019-09-10 07:43:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:43:49,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:49,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:49,371 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash 703847879, now seen corresponding path program 1 times [2019-09-10 07:43:49,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:49,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:49,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:49,532 INFO L134 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:43:49,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:49,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:49,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:49,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:49,534 INFO L87 Difference]: Start difference. First operand 465 states and 627 transitions. Second operand 9 states. [2019-09-10 07:43:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:50,675 INFO L93 Difference]: Finished difference Result 1200 states and 1697 transitions. [2019-09-10 07:43:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:50,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:43:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:50,683 INFO L225 Difference]: With dead ends: 1200 [2019-09-10 07:43:50,683 INFO L226 Difference]: Without dead ends: 1200 [2019-09-10 07:43:50,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-10 07:43:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-10 07:43:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 625 transitions. [2019-09-10 07:43:50,707 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 625 transitions. Word has length 68 [2019-09-10 07:43:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:50,707 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 625 transitions. [2019-09-10 07:43:50,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 625 transitions. [2019-09-10 07:43:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:43:50,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:50,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:50,709 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash 318799718, now seen corresponding path program 1 times [2019-09-10 07:43:50,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:50,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:50,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:50,880 INFO L134 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:43:50,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:50,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:50,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:50,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:50,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:50,885 INFO L87 Difference]: Start difference. First operand 465 states and 625 transitions. Second operand 9 states. [2019-09-10 07:43:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:51,928 INFO L93 Difference]: Finished difference Result 1224 states and 1735 transitions. [2019-09-10 07:43:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:51,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:43:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:51,937 INFO L225 Difference]: With dead ends: 1224 [2019-09-10 07:43:51,938 INFO L226 Difference]: Without dead ends: 1224 [2019-09-10 07:43:51,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-10 07:43:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 465. [2019-09-10 07:43:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 623 transitions. [2019-09-10 07:43:51,956 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 623 transitions. Word has length 68 [2019-09-10 07:43:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:51,956 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 623 transitions. [2019-09-10 07:43:51,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 623 transitions. [2019-09-10 07:43:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:43:51,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:51,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:51,958 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1611983614, now seen corresponding path program 1 times [2019-09-10 07:43:51,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:51,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:51,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:51,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:52,086 INFO L134 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:43:52,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:52,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:52,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:52,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:52,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:52,088 INFO L87 Difference]: Start difference. First operand 465 states and 623 transitions. Second operand 9 states. [2019-09-10 07:43:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:53,211 INFO L93 Difference]: Finished difference Result 1224 states and 1733 transitions. [2019-09-10 07:43:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:53,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:43:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:53,218 INFO L225 Difference]: With dead ends: 1224 [2019-09-10 07:43:53,218 INFO L226 Difference]: Without dead ends: 1224 [2019-09-10 07:43:53,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-10 07:43:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 465. [2019-09-10 07:43:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 622 transitions. [2019-09-10 07:43:53,236 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 622 transitions. Word has length 68 [2019-09-10 07:43:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:53,237 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 622 transitions. [2019-09-10 07:43:53,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 622 transitions. [2019-09-10 07:43:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:43:53,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:53,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:53,239 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash -317172898, now seen corresponding path program 1 times [2019-09-10 07:43:53,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:53,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:53,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:53,367 INFO L134 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:43:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:53,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:53,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:53,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:53,369 INFO L87 Difference]: Start difference. First operand 465 states and 622 transitions. Second operand 9 states. [2019-09-10 07:43:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:54,451 INFO L93 Difference]: Finished difference Result 1200 states and 1693 transitions. [2019-09-10 07:43:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:54,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:43:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:54,458 INFO L225 Difference]: With dead ends: 1200 [2019-09-10 07:43:54,458 INFO L226 Difference]: Without dead ends: 1200 [2019-09-10 07:43:54,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-10 07:43:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-10 07:43:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 621 transitions. [2019-09-10 07:43:54,476 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 621 transitions. Word has length 68 [2019-09-10 07:43:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:54,476 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 621 transitions. [2019-09-10 07:43:54,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 621 transitions. [2019-09-10 07:43:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:43:54,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:54,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:54,478 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1479311023, now seen corresponding path program 1 times [2019-09-10 07:43:54,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:54,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:54,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:54,602 INFO L134 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:43:54,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:54,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:54,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:54,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:54,604 INFO L87 Difference]: Start difference. First operand 465 states and 621 transitions. Second operand 9 states. [2019-09-10 07:43:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:55,476 INFO L93 Difference]: Finished difference Result 1200 states and 1691 transitions. [2019-09-10 07:43:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:55,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:43:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:55,483 INFO L225 Difference]: With dead ends: 1200 [2019-09-10 07:43:55,483 INFO L226 Difference]: Without dead ends: 1200 [2019-09-10 07:43:55,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-10 07:43:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-10 07:43:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 620 transitions. [2019-09-10 07:43:55,499 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 620 transitions. Word has length 68 [2019-09-10 07:43:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:55,499 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 620 transitions. [2019-09-10 07:43:55,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 620 transitions. [2019-09-10 07:43:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:43:55,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:55,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:55,501 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash -205437134, now seen corresponding path program 1 times [2019-09-10 07:43:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:55,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:55,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:55,621 INFO L134 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:43:55,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:55,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:43:55,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:55,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:43:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:43:55,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:43:55,623 INFO L87 Difference]: Start difference. First operand 465 states and 620 transitions. Second operand 9 states. [2019-09-10 07:43:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:56,665 INFO L93 Difference]: Finished difference Result 1200 states and 1690 transitions. [2019-09-10 07:43:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:43:56,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:43:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:56,672 INFO L225 Difference]: With dead ends: 1200 [2019-09-10 07:43:56,672 INFO L226 Difference]: Without dead ends: 1200 [2019-09-10 07:43:56,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-10 07:43:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-10 07:43:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 07:43:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 619 transitions. [2019-09-10 07:43:56,688 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 619 transitions. Word has length 68 [2019-09-10 07:43:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:56,688 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 619 transitions. [2019-09-10 07:43:56,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:43:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 619 transitions. [2019-09-10 07:43:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:43:56,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:56,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:56,690 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1850627413, now seen corresponding path program 1 times [2019-09-10 07:43:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:56,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:57,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:57,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:43:57,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:57,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:43:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:43:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:43:57,480 INFO L87 Difference]: Start difference. First operand 465 states and 619 transitions. Second operand 16 states. [2019-09-10 07:43:58,202 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:43:58,481 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:43:58,624 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:43:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:59,863 INFO L93 Difference]: Finished difference Result 909 states and 1227 transitions. [2019-09-10 07:43:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:43:59,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2019-09-10 07:43:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:59,868 INFO L225 Difference]: With dead ends: 909 [2019-09-10 07:43:59,868 INFO L226 Difference]: Without dead ends: 909 [2019-09-10 07:43:59,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:43:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-10 07:43:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 464. [2019-09-10 07:43:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:43:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 617 transitions. [2019-09-10 07:43:59,882 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 617 transitions. Word has length 70 [2019-09-10 07:43:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:59,882 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 617 transitions. [2019-09-10 07:43:59,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:43:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2019-09-10 07:43:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:43:59,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:59,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:59,884 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1999891916, now seen corresponding path program 1 times [2019-09-10 07:43:59,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:59,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:59,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:59,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:59,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:01,340 INFO L134 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:44:01,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:44:01,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:01,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:44:01,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:44:01,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:44:01,342 INFO L87 Difference]: Start difference. First operand 464 states and 617 transitions. Second operand 21 states. [2019-09-10 07:44:01,499 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:44:02,093 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:44:02,256 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 07:44:02,463 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:44:02,742 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:44:03,077 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 07:44:03,311 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:44:03,539 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:44:03,803 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:44:04,083 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:44:04,550 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:44:04,844 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:44:05,073 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:44:05,371 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:44:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:07,408 INFO L93 Difference]: Finished difference Result 957 states and 1290 transitions. [2019-09-10 07:44:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:44:07,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2019-09-10 07:44:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:07,413 INFO L225 Difference]: With dead ends: 957 [2019-09-10 07:44:07,414 INFO L226 Difference]: Without dead ends: 957 [2019-09-10 07:44:07,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:44:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-09-10 07:44:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 464. [2019-09-10 07:44:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:44:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 616 transitions. [2019-09-10 07:44:07,425 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 616 transitions. Word has length 70 [2019-09-10 07:44:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:07,426 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 616 transitions. [2019-09-10 07:44:07,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:44:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 616 transitions. [2019-09-10 07:44:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:44:07,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:07,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:07,427 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1089068483, now seen corresponding path program 1 times [2019-09-10 07:44:07,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:07,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:07,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:07,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:07,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:08,233 INFO L134 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:44:08,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:08,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:44:08,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:08,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:44:08,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:44:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:44:08,236 INFO L87 Difference]: Start difference. First operand 464 states and 616 transitions. Second operand 17 states. [2019-09-10 07:44:08,751 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:44:08,889 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:44:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:09,664 INFO L93 Difference]: Finished difference Result 599 states and 806 transitions. [2019-09-10 07:44:09,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:44:09,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-09-10 07:44:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:09,670 INFO L225 Difference]: With dead ends: 599 [2019-09-10 07:44:09,670 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 07:44:09,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:44:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 07:44:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 445. [2019-09-10 07:44:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-10 07:44:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2019-09-10 07:44:09,680 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 70 [2019-09-10 07:44:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:09,681 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2019-09-10 07:44:09,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:44:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2019-09-10 07:44:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:44:09,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:09,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:09,682 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1455333677, now seen corresponding path program 1 times [2019-09-10 07:44:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:09,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:11,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:44:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:11,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:44:11,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:11,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:44:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:44:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:44:11,093 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 21 states. [2019-09-10 07:44:11,254 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:44:12,038 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:44:12,228 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:44:12,497 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 07:44:12,697 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:44:12,875 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:44:13,082 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:44:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:14,544 INFO L93 Difference]: Finished difference Result 686 states and 915 transitions. [2019-09-10 07:44:14,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:44:14,544 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2019-09-10 07:44:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:14,548 INFO L225 Difference]: With dead ends: 686 [2019-09-10 07:44:14,548 INFO L226 Difference]: Without dead ends: 686 [2019-09-10 07:44:14,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=241, Invalid=815, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:44:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-10 07:44:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 455. [2019-09-10 07:44:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-10 07:44:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2019-09-10 07:44:14,559 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 70 [2019-09-10 07:44:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:14,559 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2019-09-10 07:44:14,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:44:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2019-09-10 07:44:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:44:14,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:14,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:14,561 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -836030750, now seen corresponding path program 1 times [2019-09-10 07:44:14,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:14,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:14,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:15,146 INFO L134 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:44:15,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:15,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:44:15,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:15,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:44:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:44:15,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:44:15,151 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand 14 states. [2019-09-10 07:44:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:16,876 INFO L93 Difference]: Finished difference Result 873 states and 1234 transitions. [2019-09-10 07:44:16,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:44:16,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-09-10 07:44:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:16,882 INFO L225 Difference]: With dead ends: 873 [2019-09-10 07:44:16,883 INFO L226 Difference]: Without dead ends: 873 [2019-09-10 07:44:16,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:44:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-09-10 07:44:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 428. [2019-09-10 07:44:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-10 07:44:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 573 transitions. [2019-09-10 07:44:16,892 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 573 transitions. Word has length 70 [2019-09-10 07:44:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:16,892 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 573 transitions. [2019-09-10 07:44:16,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:44:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 573 transitions. [2019-09-10 07:44:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:16,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:16,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:16,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1658652679, now seen corresponding path program 1 times [2019-09-10 07:44:16,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:16,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:17,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:17,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:44:17,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:17,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:44:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:44:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:44:17,561 INFO L87 Difference]: Start difference. First operand 428 states and 573 transitions. Second operand 16 states. [2019-09-10 07:44:18,285 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:44:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:19,447 INFO L93 Difference]: Finished difference Result 1039 states and 1462 transitions. [2019-09-10 07:44:19,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:44:19,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-10 07:44:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:19,450 INFO L225 Difference]: With dead ends: 1039 [2019-09-10 07:44:19,450 INFO L226 Difference]: Without dead ends: 1039 [2019-09-10 07:44:19,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:44:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-09-10 07:44:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 428. [2019-09-10 07:44:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-10 07:44:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 570 transitions. [2019-09-10 07:44:19,462 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 570 transitions. Word has length 71 [2019-09-10 07:44:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:19,462 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 570 transitions. [2019-09-10 07:44:19,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:44:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 570 transitions. [2019-09-10 07:44:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:19,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:19,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:19,464 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1627558840, now seen corresponding path program 1 times [2019-09-10 07:44:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:19,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:19,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:20,070 INFO L134 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:44:20,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:20,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:44:20,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:20,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:44:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:44:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:44:20,072 INFO L87 Difference]: Start difference. First operand 428 states and 570 transitions. Second operand 15 states. [2019-09-10 07:44:20,674 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-09-10 07:44:20,859 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 07:44:21,024 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-10 07:44:21,182 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-10 07:44:21,388 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:44:21,612 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-10 07:44:21,857 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-10 07:44:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:22,336 INFO L93 Difference]: Finished difference Result 1002 states and 1407 transitions. [2019-09-10 07:44:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:44:22,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2019-09-10 07:44:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:22,342 INFO L225 Difference]: With dead ends: 1002 [2019-09-10 07:44:22,342 INFO L226 Difference]: Without dead ends: 1002 [2019-09-10 07:44:22,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:44:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-10 07:44:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 424. [2019-09-10 07:44:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-10 07:44:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2019-09-10 07:44:22,352 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 71 [2019-09-10 07:44:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:22,352 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2019-09-10 07:44:22,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:44:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2019-09-10 07:44:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:22,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:22,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:22,354 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1111539522, now seen corresponding path program 1 times [2019-09-10 07:44:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:22,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:22,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:22,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:22,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:44:22,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:22,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:44:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:44:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:22,480 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 9 states. [2019-09-10 07:44:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:23,337 INFO L93 Difference]: Finished difference Result 1128 states and 1602 transitions. [2019-09-10 07:44:23,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:44:23,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:44:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:23,344 INFO L225 Difference]: With dead ends: 1128 [2019-09-10 07:44:23,344 INFO L226 Difference]: Without dead ends: 1128 [2019-09-10 07:44:23,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:44:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-09-10 07:44:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 424. [2019-09-10 07:44:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-10 07:44:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 564 transitions. [2019-09-10 07:44:23,362 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 564 transitions. Word has length 71 [2019-09-10 07:44:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:23,362 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 564 transitions. [2019-09-10 07:44:23,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:44:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 564 transitions. [2019-09-10 07:44:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:23,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:23,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:23,364 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash 843086847, now seen corresponding path program 1 times [2019-09-10 07:44:23,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:23,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:23,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:23,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:23,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:44:23,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:23,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:44:23,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:44:23,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:23,490 INFO L87 Difference]: Start difference. First operand 424 states and 564 transitions. Second operand 9 states. [2019-09-10 07:44:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:24,318 INFO L93 Difference]: Finished difference Result 1110 states and 1578 transitions. [2019-09-10 07:44:24,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:44:24,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:44:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:24,322 INFO L225 Difference]: With dead ends: 1110 [2019-09-10 07:44:24,322 INFO L226 Difference]: Without dead ends: 1110 [2019-09-10 07:44:24,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:44:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-09-10 07:44:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 424. [2019-09-10 07:44:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-10 07:44:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 560 transitions. [2019-09-10 07:44:24,332 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 560 transitions. Word has length 71 [2019-09-10 07:44:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:24,332 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 560 transitions. [2019-09-10 07:44:24,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:44:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 560 transitions. [2019-09-10 07:44:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:24,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:24,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,334 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1610747723, now seen corresponding path program 1 times [2019-09-10 07:44:24,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:24,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:24,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:24,716 INFO L134 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:44:24,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:24,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:44:24,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:24,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:44:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:44:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:44:24,718 INFO L87 Difference]: Start difference. First operand 424 states and 560 transitions. Second operand 12 states. [2019-09-10 07:44:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:25,884 INFO L93 Difference]: Finished difference Result 1582 states and 2274 transitions. [2019-09-10 07:44:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:44:25,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 07:44:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:25,890 INFO L225 Difference]: With dead ends: 1582 [2019-09-10 07:44:25,891 INFO L226 Difference]: Without dead ends: 1582 [2019-09-10 07:44:25,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:44:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-09-10 07:44:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 392. [2019-09-10 07:44:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-10 07:44:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 522 transitions. [2019-09-10 07:44:25,902 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 522 transitions. Word has length 71 [2019-09-10 07:44:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:25,903 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 522 transitions. [2019-09-10 07:44:25,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:44:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 522 transitions. [2019-09-10 07:44:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:25,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:25,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:25,904 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:25,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:25,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1217335281, now seen corresponding path program 1 times [2019-09-10 07:44:25,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:25,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:25,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:25,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:25,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:26,360 INFO L134 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:44:26,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:44:26,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:26,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:44:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:44:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:44:26,361 INFO L87 Difference]: Start difference. First operand 392 states and 522 transitions. Second operand 12 states. [2019-09-10 07:44:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:27,320 INFO L93 Difference]: Finished difference Result 2117 states and 3124 transitions. [2019-09-10 07:44:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:44:27,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 07:44:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:27,329 INFO L225 Difference]: With dead ends: 2117 [2019-09-10 07:44:27,330 INFO L226 Difference]: Without dead ends: 2117 [2019-09-10 07:44:27,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:44:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-09-10 07:44:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 377. [2019-09-10 07:44:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-10 07:44:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2019-09-10 07:44:27,345 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 503 transitions. Word has length 71 [2019-09-10 07:44:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:27,345 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 503 transitions. [2019-09-10 07:44:27,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:44:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 503 transitions. [2019-09-10 07:44:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:27,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:27,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,347 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1510879078, now seen corresponding path program 1 times [2019-09-10 07:44:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:27,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:27,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:44:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:44:27,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:27,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:44:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:44:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:44:27,715 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. Second operand 12 states. [2019-09-10 07:44:28,159 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 07:44:28,306 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 07:44:28,504 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-10 07:44:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:28,876 INFO L93 Difference]: Finished difference Result 657 states and 895 transitions. [2019-09-10 07:44:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:44:28,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 07:44:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:28,882 INFO L225 Difference]: With dead ends: 657 [2019-09-10 07:44:28,882 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 07:44:28,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:44:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 07:44:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 373. [2019-09-10 07:44:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 07:44:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 498 transitions. [2019-09-10 07:44:28,889 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 498 transitions. Word has length 71 [2019-09-10 07:44:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:28,890 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 498 transitions. [2019-09-10 07:44:28,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:44:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 498 transitions. [2019-09-10 07:44:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:44:28,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:28,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:28,891 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1268048671, now seen corresponding path program 1 times [2019-09-10 07:44:28,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:28,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:28,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:28,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:28,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:28,996 INFO L134 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:44:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:44:28,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:28,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:44:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:44:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:28,998 INFO L87 Difference]: Start difference. First operand 373 states and 498 transitions. Second operand 9 states. [2019-09-10 07:44:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:29,522 INFO L93 Difference]: Finished difference Result 649 states and 888 transitions. [2019-09-10 07:44:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:44:29,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:44:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:29,527 INFO L225 Difference]: With dead ends: 649 [2019-09-10 07:44:29,527 INFO L226 Difference]: Without dead ends: 649 [2019-09-10 07:44:29,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:44:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-10 07:44:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 373. [2019-09-10 07:44:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 07:44:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 497 transitions. [2019-09-10 07:44:29,535 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 497 transitions. Word has length 72 [2019-09-10 07:44:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:29,536 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 497 transitions. [2019-09-10 07:44:29,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:44:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 497 transitions. [2019-09-10 07:44:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:44:29,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:29,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:29,538 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1461520139, now seen corresponding path program 1 times [2019-09-10 07:44:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:29,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:29,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:29,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:44:29,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:29,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:44:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:44:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:29,653 INFO L87 Difference]: Start difference. First operand 373 states and 497 transitions. Second operand 9 states. [2019-09-10 07:44:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:30,320 INFO L93 Difference]: Finished difference Result 649 states and 886 transitions. [2019-09-10 07:44:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:44:30,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:44:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:30,323 INFO L225 Difference]: With dead ends: 649 [2019-09-10 07:44:30,323 INFO L226 Difference]: Without dead ends: 649 [2019-09-10 07:44:30,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:44:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-10 07:44:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 373. [2019-09-10 07:44:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 07:44:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 496 transitions. [2019-09-10 07:44:30,331 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 496 transitions. Word has length 72 [2019-09-10 07:44:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:30,331 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 496 transitions. [2019-09-10 07:44:30,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:44:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 496 transitions. [2019-09-10 07:44:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:44:30,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:30,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:30,333 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1549803195, now seen corresponding path program 1 times [2019-09-10 07:44:30,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:30,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:31,050 INFO L134 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:44:31,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:44:31,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:31,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:44:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:44:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:44:31,051 INFO L87 Difference]: Start difference. First operand 373 states and 496 transitions. Second operand 23 states. [2019-09-10 07:44:31,265 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 07:44:32,093 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:44:32,262 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:44:32,463 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:44:32,635 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:44:32,794 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:44:33,566 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:44:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:35,686 INFO L93 Difference]: Finished difference Result 2727 states and 4050 transitions. [2019-09-10 07:44:35,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:44:35,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2019-09-10 07:44:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:35,691 INFO L225 Difference]: With dead ends: 2727 [2019-09-10 07:44:35,691 INFO L226 Difference]: Without dead ends: 2727 [2019-09-10 07:44:35,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:44:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-09-10 07:44:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 384. [2019-09-10 07:44:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-10 07:44:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 510 transitions. [2019-09-10 07:44:35,705 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 510 transitions. Word has length 73 [2019-09-10 07:44:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:35,705 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 510 transitions. [2019-09-10 07:44:35,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:44:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 510 transitions. [2019-09-10 07:44:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:44:35,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:35,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:35,707 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1572662879, now seen corresponding path program 1 times [2019-09-10 07:44:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:35,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:36,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:36,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:44:36,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:36,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:44:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:44:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:44:36,419 INFO L87 Difference]: Start difference. First operand 384 states and 510 transitions. Second operand 16 states. [2019-09-10 07:44:37,082 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:44:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:38,710 INFO L93 Difference]: Finished difference Result 1835 states and 2669 transitions. [2019-09-10 07:44:38,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:44:38,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-09-10 07:44:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:38,713 INFO L225 Difference]: With dead ends: 1835 [2019-09-10 07:44:38,713 INFO L226 Difference]: Without dead ends: 1835 [2019-09-10 07:44:38,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:44:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-10 07:44:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 373. [2019-09-10 07:44:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 07:44:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 495 transitions. [2019-09-10 07:44:38,726 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 495 transitions. Word has length 74 [2019-09-10 07:44:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:38,726 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 495 transitions. [2019-09-10 07:44:38,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:44:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 495 transitions. [2019-09-10 07:44:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:44:38,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:38,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:38,728 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1304108329, now seen corresponding path program 1 times [2019-09-10 07:44:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:38,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:39,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:44:39,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:39,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:44:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:44:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:44:39,135 INFO L87 Difference]: Start difference. First operand 373 states and 495 transitions. Second operand 13 states. [2019-09-10 07:44:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:40,069 INFO L93 Difference]: Finished difference Result 829 states and 1173 transitions. [2019-09-10 07:44:40,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:44:40,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2019-09-10 07:44:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:40,072 INFO L225 Difference]: With dead ends: 829 [2019-09-10 07:44:40,072 INFO L226 Difference]: Without dead ends: 829 [2019-09-10 07:44:40,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:44:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-10 07:44:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 355. [2019-09-10 07:44:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-10 07:44:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 475 transitions. [2019-09-10 07:44:40,081 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 475 transitions. Word has length 74 [2019-09-10 07:44:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,081 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 475 transitions. [2019-09-10 07:44:40,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:44:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 475 transitions. [2019-09-10 07:44:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:44:40,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:40,083 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 988299827, now seen corresponding path program 1 times [2019-09-10 07:44:40,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:40,466 INFO L134 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:44:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:44:40,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:40,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:44:40,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:44:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:44:40,467 INFO L87 Difference]: Start difference. First operand 355 states and 475 transitions. Second operand 12 states. [2019-09-10 07:44:40,918 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 07:44:41,060 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 07:44:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:41,702 INFO L93 Difference]: Finished difference Result 1051 states and 1502 transitions. [2019-09-10 07:44:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:44:41,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 07:44:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:41,705 INFO L225 Difference]: With dead ends: 1051 [2019-09-10 07:44:41,706 INFO L226 Difference]: Without dead ends: 1051 [2019-09-10 07:44:41,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:44:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-10 07:44:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 349. [2019-09-10 07:44:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-10 07:44:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 469 transitions. [2019-09-10 07:44:41,716 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 469 transitions. Word has length 74 [2019-09-10 07:44:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,717 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 469 transitions. [2019-09-10 07:44:41,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:44:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 469 transitions. [2019-09-10 07:44:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:44:41,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,718 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1612741772, now seen corresponding path program 1 times [2019-09-10 07:44:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:43,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:43,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:44:43,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:43,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:44:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:44:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:44:43,172 INFO L87 Difference]: Start difference. First operand 349 states and 469 transitions. Second operand 23 states. [2019-09-10 07:44:43,324 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:44:43,805 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:44:43,961 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:44:44,180 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:44:44,469 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:44:44,771 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:44:45,094 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:44:45,359 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:44:45,613 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:44:45,865 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:44:46,188 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:44:46,399 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:44:46,636 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:44:46,905 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:44:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:48,068 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2019-09-10 07:44:48,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:44:48,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2019-09-10 07:44:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:48,070 INFO L225 Difference]: With dead ends: 579 [2019-09-10 07:44:48,070 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 07:44:48,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=363, Invalid=1277, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:44:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 07:44:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 354. [2019-09-10 07:44:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-10 07:44:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 474 transitions. [2019-09-10 07:44:48,077 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 474 transitions. Word has length 74 [2019-09-10 07:44:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:48,077 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 474 transitions. [2019-09-10 07:44:48,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:44:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 474 transitions. [2019-09-10 07:44:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:44:48,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:48,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:48,079 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash -688715173, now seen corresponding path program 1 times [2019-09-10 07:44:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:48,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:48,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:48,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:48,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:48,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:48,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:44:48,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:48,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:44:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:44:48,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:44:48,506 INFO L87 Difference]: Start difference. First operand 354 states and 474 transitions. Second operand 11 states. [2019-09-10 07:44:49,074 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:44:49,208 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:44:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:50,105 INFO L93 Difference]: Finished difference Result 1215 states and 1795 transitions. [2019-09-10 07:44:50,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:44:50,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-09-10 07:44:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:50,109 INFO L225 Difference]: With dead ends: 1215 [2019-09-10 07:44:50,109 INFO L226 Difference]: Without dead ends: 1215 [2019-09-10 07:44:50,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:44:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-10 07:44:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 325. [2019-09-10 07:44:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-10 07:44:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 443 transitions. [2019-09-10 07:44:50,118 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 443 transitions. Word has length 75 [2019-09-10 07:44:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:50,118 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 443 transitions. [2019-09-10 07:44:50,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:44:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 443 transitions. [2019-09-10 07:44:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:44:50,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:50,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,120 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1982800984, now seen corresponding path program 1 times [2019-09-10 07:44:50,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:50,186 INFO L134 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:44:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:50,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:50,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:50,188 INFO L87 Difference]: Start difference. First operand 325 states and 443 transitions. Second operand 3 states. [2019-09-10 07:44:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:50,215 INFO L93 Difference]: Finished difference Result 517 states and 724 transitions. [2019-09-10 07:44:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:50,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 07:44:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:50,217 INFO L225 Difference]: With dead ends: 517 [2019-09-10 07:44:50,217 INFO L226 Difference]: Without dead ends: 517 [2019-09-10 07:44:50,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-10 07:44:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2019-09-10 07:44:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-10 07:44:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 723 transitions. [2019-09-10 07:44:50,226 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 723 transitions. Word has length 96 [2019-09-10 07:44:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:50,226 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 723 transitions. [2019-09-10 07:44:50,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 723 transitions. [2019-09-10 07:44:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:44:50,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:50,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,229 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash -76698584, now seen corresponding path program 1 times [2019-09-10 07:44:50,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:50,296 INFO L134 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:44:50,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:50,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:50,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:50,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:50,298 INFO L87 Difference]: Start difference. First operand 515 states and 723 transitions. Second operand 5 states. [2019-09-10 07:44:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:50,583 INFO L93 Difference]: Finished difference Result 2021 states and 2906 transitions. [2019-09-10 07:44:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:44:50,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 07:44:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:50,587 INFO L225 Difference]: With dead ends: 2021 [2019-09-10 07:44:50,588 INFO L226 Difference]: Without dead ends: 2021 [2019-09-10 07:44:50,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2019-09-10 07:44:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 951. [2019-09-10 07:44:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-09-10 07:44:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1359 transitions. [2019-09-10 07:44:50,602 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1359 transitions. Word has length 98 [2019-09-10 07:44:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:50,603 INFO L475 AbstractCegarLoop]: Abstraction has 951 states and 1359 transitions. [2019-09-10 07:44:50,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1359 transitions. [2019-09-10 07:44:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:44:50,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:50,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,605 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash 506415028, now seen corresponding path program 1 times [2019-09-10 07:44:50,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:50,664 INFO L134 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:44:50,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:50,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:50,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:50,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:50,668 INFO L87 Difference]: Start difference. First operand 951 states and 1359 transitions. Second operand 5 states. [2019-09-10 07:44:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:50,879 INFO L93 Difference]: Finished difference Result 3421 states and 4866 transitions. [2019-09-10 07:44:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:44:50,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 07:44:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:50,883 INFO L225 Difference]: With dead ends: 3421 [2019-09-10 07:44:50,883 INFO L226 Difference]: Without dead ends: 3421 [2019-09-10 07:44:50,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2019-09-10 07:44:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 1847. [2019-09-10 07:44:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-09-10 07:44:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2655 transitions. [2019-09-10 07:44:50,906 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2655 transitions. Word has length 98 [2019-09-10 07:44:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:50,906 INFO L475 AbstractCegarLoop]: Abstraction has 1847 states and 2655 transitions. [2019-09-10 07:44:50,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2655 transitions. [2019-09-10 07:44:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:44:50,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:50,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,909 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1917954603, now seen corresponding path program 1 times [2019-09-10 07:44:50,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:50,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:50,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:50,975 INFO L134 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:44:50,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:50,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:50,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:50,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:50,976 INFO L87 Difference]: Start difference. First operand 1847 states and 2655 transitions. Second operand 3 states. [2019-09-10 07:44:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:51,010 INFO L93 Difference]: Finished difference Result 2745 states and 3944 transitions. [2019-09-10 07:44:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:51,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:44:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:51,014 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 07:44:51,014 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 07:44:51,014 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:44:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 07:44:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2743. [2019-09-10 07:44:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2019-09-10 07:44:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 3943 transitions. [2019-09-10 07:44:51,045 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 3943 transitions. Word has length 98 [2019-09-10 07:44:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:51,045 INFO L475 AbstractCegarLoop]: Abstraction has 2743 states and 3943 transitions. [2019-09-10 07:44:51,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3943 transitions. [2019-09-10 07:44:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:44:51,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:51,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:51,048 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1207766954, now seen corresponding path program 1 times [2019-09-10 07:44:51,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:51,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:51,103 INFO L134 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:44:51,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:51,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:51,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:51,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:51,104 INFO L87 Difference]: Start difference. First operand 2743 states and 3943 transitions. Second operand 3 states. [2019-09-10 07:44:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:51,139 INFO L93 Difference]: Finished difference Result 4081 states and 5764 transitions. [2019-09-10 07:44:51,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:51,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:44:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:51,144 INFO L225 Difference]: With dead ends: 4081 [2019-09-10 07:44:51,144 INFO L226 Difference]: Without dead ends: 4081 [2019-09-10 07:44:51,144 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:44:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2019-09-10 07:44:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 4031. [2019-09-10 07:44:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-10 07:44:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5715 transitions. [2019-09-10 07:44:51,190 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5715 transitions. Word has length 98 [2019-09-10 07:44:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:51,190 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5715 transitions. [2019-09-10 07:44:51,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5715 transitions. [2019-09-10 07:44:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:44:51,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:51,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,193 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:51,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1496995374, now seen corresponding path program 1 times [2019-09-10 07:44:51,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:51,250 INFO L134 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:44:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:51,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:51,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:51,251 INFO L87 Difference]: Start difference. First operand 4031 states and 5715 transitions. Second operand 5 states. [2019-09-10 07:44:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:51,465 INFO L93 Difference]: Finished difference Result 13121 states and 18226 transitions. [2019-09-10 07:44:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:44:51,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 07:44:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:51,478 INFO L225 Difference]: With dead ends: 13121 [2019-09-10 07:44:51,479 INFO L226 Difference]: Without dead ends: 13121 [2019-09-10 07:44:51,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-09-10 07:44:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 8231. [2019-09-10 07:44:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8231 states. [2019-09-10 07:44:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8231 states to 8231 states and 11591 transitions. [2019-09-10 07:44:51,614 INFO L78 Accepts]: Start accepts. Automaton has 8231 states and 11591 transitions. Word has length 98 [2019-09-10 07:44:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:51,614 INFO L475 AbstractCegarLoop]: Abstraction has 8231 states and 11591 transitions. [2019-09-10 07:44:51,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8231 states and 11591 transitions. [2019-09-10 07:44:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:44:51,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:51,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:51,619 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1555516846, now seen corresponding path program 1 times [2019-09-10 07:44:51,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:51,690 INFO L134 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:44:51,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:51,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:51,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:51,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:51,691 INFO L87 Difference]: Start difference. First operand 8231 states and 11591 transitions. Second operand 3 states. [2019-09-10 07:44:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:51,756 INFO L93 Difference]: Finished difference Result 9065 states and 12656 transitions. [2019-09-10 07:44:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:51,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:44:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:51,769 INFO L225 Difference]: With dead ends: 9065 [2019-09-10 07:44:51,769 INFO L226 Difference]: Without dead ends: 9065 [2019-09-10 07:44:51,770 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:44:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2019-09-10 07:44:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8967. [2019-09-10 07:44:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8967 states. [2019-09-10 07:44:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 12543 transitions. [2019-09-10 07:44:51,883 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 12543 transitions. Word has length 99 [2019-09-10 07:44:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:51,884 INFO L475 AbstractCegarLoop]: Abstraction has 8967 states and 12543 transitions. [2019-09-10 07:44:51,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 12543 transitions. [2019-09-10 07:44:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:44:51,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:51,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,887 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash 143060042, now seen corresponding path program 1 times [2019-09-10 07:44:51,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:51,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:51,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:51,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:51,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:51,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:51,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:51,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:51,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:51,944 INFO L87 Difference]: Start difference. First operand 8967 states and 12543 transitions. Second operand 5 states. [2019-09-10 07:44:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:52,142 INFO L93 Difference]: Finished difference Result 18909 states and 25922 transitions. [2019-09-10 07:44:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:44:52,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:44:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:52,160 INFO L225 Difference]: With dead ends: 18909 [2019-09-10 07:44:52,160 INFO L226 Difference]: Without dead ends: 18909 [2019-09-10 07:44:52,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18909 states. [2019-09-10 07:44:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18909 to 11031. [2019-09-10 07:44:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11031 states. [2019-09-10 07:44:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 15183 transitions. [2019-09-10 07:44:52,377 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 15183 transitions. Word has length 99 [2019-09-10 07:44:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:52,378 INFO L475 AbstractCegarLoop]: Abstraction has 11031 states and 15183 transitions. [2019-09-10 07:44:52,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 15183 transitions. [2019-09-10 07:44:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:44:52,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:52,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:52,380 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -732117008, now seen corresponding path program 1 times [2019-09-10 07:44:52,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:52,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:52,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:52,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:52,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:52,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:52,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:44:52,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:52,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:44:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:44:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:52,473 INFO L87 Difference]: Start difference. First operand 11031 states and 15183 transitions. Second operand 6 states. [2019-09-10 07:44:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:52,577 INFO L93 Difference]: Finished difference Result 17589 states and 23603 transitions. [2019-09-10 07:44:52,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:44:52,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 07:44:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:52,593 INFO L225 Difference]: With dead ends: 17589 [2019-09-10 07:44:52,593 INFO L226 Difference]: Without dead ends: 17589 [2019-09-10 07:44:52,593 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:44:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2019-09-10 07:44:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 11223. [2019-09-10 07:44:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11223 states. [2019-09-10 07:44:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11223 states to 11223 states and 15311 transitions. [2019-09-10 07:44:52,762 INFO L78 Accepts]: Start accepts. Automaton has 11223 states and 15311 transitions. Word has length 99 [2019-09-10 07:44:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:52,762 INFO L475 AbstractCegarLoop]: Abstraction has 11223 states and 15311 transitions. [2019-09-10 07:44:52,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:44:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11223 states and 15311 transitions. [2019-09-10 07:44:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:44:52,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:52,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,766 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash -589488884, now seen corresponding path program 1 times [2019-09-10 07:44:52,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:52,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:52,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:52,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:52,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:52,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:52,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:52,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:52,819 INFO L87 Difference]: Start difference. First operand 11223 states and 15311 transitions. Second operand 3 states. [2019-09-10 07:44:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:52,858 INFO L93 Difference]: Finished difference Result 10585 states and 14192 transitions. [2019-09-10 07:44:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:52,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:44:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:52,870 INFO L225 Difference]: With dead ends: 10585 [2019-09-10 07:44:52,871 INFO L226 Difference]: Without dead ends: 10585 [2019-09-10 07:44:52,871 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:44:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10585 states. [2019-09-10 07:44:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10585 to 8047. [2019-09-10 07:44:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8047 states. [2019-09-10 07:44:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8047 states to 8047 states and 10755 transitions. [2019-09-10 07:44:52,960 INFO L78 Accepts]: Start accepts. Automaton has 8047 states and 10755 transitions. Word has length 100 [2019-09-10 07:44:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:52,960 INFO L475 AbstractCegarLoop]: Abstraction has 8047 states and 10755 transitions. [2019-09-10 07:44:52,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8047 states and 10755 transitions. [2019-09-10 07:44:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:44:52,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:52,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,962 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash 446049293, now seen corresponding path program 1 times [2019-09-10 07:44:52,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:52,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:52,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:52,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:52,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:53,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:53,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:53,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:53,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:53,014 INFO L87 Difference]: Start difference. First operand 8047 states and 10755 transitions. Second operand 3 states. [2019-09-10 07:44:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:53,044 INFO L93 Difference]: Finished difference Result 7569 states and 9940 transitions. [2019-09-10 07:44:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:53,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:44:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:53,052 INFO L225 Difference]: With dead ends: 7569 [2019-09-10 07:44:53,053 INFO L226 Difference]: Without dead ends: 7569 [2019-09-10 07:44:53,053 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:44:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7569 states. [2019-09-10 07:44:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7569 to 7015. [2019-09-10 07:44:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7015 states. [2019-09-10 07:44:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 9279 transitions. [2019-09-10 07:44:53,127 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 9279 transitions. Word has length 101 [2019-09-10 07:44:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:53,127 INFO L475 AbstractCegarLoop]: Abstraction has 7015 states and 9279 transitions. [2019-09-10 07:44:53,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 9279 transitions. [2019-09-10 07:44:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 07:44:53,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:53,131 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:53,131 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:53,131 INFO L82 PathProgramCache]: Analyzing trace with hash -385409352, now seen corresponding path program 1 times [2019-09-10 07:44:53,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:53,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:53,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:53,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:53,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:53,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:53,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:53,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:53,223 INFO L87 Difference]: Start difference. First operand 7015 states and 9279 transitions. Second operand 3 states. [2019-09-10 07:44:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:53,253 INFO L93 Difference]: Finished difference Result 5671 states and 7212 transitions. [2019-09-10 07:44:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:53,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 07:44:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:53,261 INFO L225 Difference]: With dead ends: 5671 [2019-09-10 07:44:53,261 INFO L226 Difference]: Without dead ends: 5671 [2019-09-10 07:44:53,261 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:44:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2019-09-10 07:44:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 5589. [2019-09-10 07:44:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2019-09-10 07:44:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 7115 transitions. [2019-09-10 07:44:53,340 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 7115 transitions. Word has length 125 [2019-09-10 07:44:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:53,340 INFO L475 AbstractCegarLoop]: Abstraction has 5589 states and 7115 transitions. [2019-09-10 07:44:53,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 7115 transitions. [2019-09-10 07:44:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:44:53,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:53,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:53,347 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:53,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 474885696, now seen corresponding path program 1 times [2019-09-10 07:44:53,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:53,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:53,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:53,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:53,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:44:53,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:53,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:44:53,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:53,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:44:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:44:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:53,591 INFO L87 Difference]: Start difference. First operand 5589 states and 7115 transitions. Second operand 6 states. [2019-09-10 07:44:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:53,819 INFO L93 Difference]: Finished difference Result 22393 states and 28409 transitions. [2019-09-10 07:44:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:44:53,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 07:44:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:53,849 INFO L225 Difference]: With dead ends: 22393 [2019-09-10 07:44:53,849 INFO L226 Difference]: Without dead ends: 22393 [2019-09-10 07:44:53,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22393 states. [2019-09-10 07:44:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22393 to 9621. [2019-09-10 07:44:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9621 states. [2019-09-10 07:44:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9621 states to 9621 states and 12179 transitions. [2019-09-10 07:44:54,046 INFO L78 Accepts]: Start accepts. Automaton has 9621 states and 12179 transitions. Word has length 126 [2019-09-10 07:44:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:54,046 INFO L475 AbstractCegarLoop]: Abstraction has 9621 states and 12179 transitions. [2019-09-10 07:44:54,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:44:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9621 states and 12179 transitions. [2019-09-10 07:44:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:44:54,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:54,049 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:54,050 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1057999308, now seen corresponding path program 1 times [2019-09-10 07:44:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:54,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:54,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:54,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:54,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:54,118 INFO L87 Difference]: Start difference. First operand 9621 states and 12179 transitions. Second operand 3 states. [2019-09-10 07:44:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:54,159 INFO L93 Difference]: Finished difference Result 12025 states and 15176 transitions. [2019-09-10 07:44:54,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:54,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:44:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:54,173 INFO L225 Difference]: With dead ends: 12025 [2019-09-10 07:44:54,173 INFO L226 Difference]: Without dead ends: 12025 [2019-09-10 07:44:54,174 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:44:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12025 states. [2019-09-10 07:44:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12025 to 11855. [2019-09-10 07:44:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11855 states. [2019-09-10 07:44:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11855 states to 11855 states and 15007 transitions. [2019-09-10 07:44:54,304 INFO L78 Accepts]: Start accepts. Automaton has 11855 states and 15007 transitions. Word has length 126 [2019-09-10 07:44:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:54,305 INFO L475 AbstractCegarLoop]: Abstraction has 11855 states and 15007 transitions. [2019-09-10 07:44:54,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 11855 states and 15007 transitions. [2019-09-10 07:44:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:44:54,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:54,308 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:54,308 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -396378024, now seen corresponding path program 1 times [2019-09-10 07:44:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:54,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:54,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:54,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:54,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:54,378 INFO L87 Difference]: Start difference. First operand 11855 states and 15007 transitions. Second operand 3 states. [2019-09-10 07:44:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:54,434 INFO L93 Difference]: Finished difference Result 18217 states and 22552 transitions. [2019-09-10 07:44:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:54,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 07:44:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:54,455 INFO L225 Difference]: With dead ends: 18217 [2019-09-10 07:44:54,456 INFO L226 Difference]: Without dead ends: 18217 [2019-09-10 07:44:54,456 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:44:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18217 states. [2019-09-10 07:44:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18217 to 16935. [2019-09-10 07:44:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16935 states. [2019-09-10 07:44:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16935 states to 16935 states and 21151 transitions. [2019-09-10 07:44:54,654 INFO L78 Accepts]: Start accepts. Automaton has 16935 states and 21151 transitions. Word has length 127 [2019-09-10 07:44:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:54,654 INFO L475 AbstractCegarLoop]: Abstraction has 16935 states and 21151 transitions. [2019-09-10 07:44:54,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16935 states and 21151 transitions. [2019-09-10 07:44:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:44:54,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:54,657 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:54,657 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -827219872, now seen corresponding path program 1 times [2019-09-10 07:44:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:44:54,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:54,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:44:54,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:54,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:44:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:44:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:54,765 INFO L87 Difference]: Start difference. First operand 16935 states and 21151 transitions. Second operand 6 states. [2019-09-10 07:44:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:54,909 INFO L93 Difference]: Finished difference Result 33837 states and 42234 transitions. [2019-09-10 07:44:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:54,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-10 07:44:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:54,950 INFO L225 Difference]: With dead ends: 33837 [2019-09-10 07:44:54,951 INFO L226 Difference]: Without dead ends: 33837 [2019-09-10 07:44:54,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33837 states. [2019-09-10 07:44:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33837 to 33639. [2019-09-10 07:44:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33639 states. [2019-09-10 07:44:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33639 states to 33639 states and 42039 transitions. [2019-09-10 07:44:56,087 INFO L78 Accepts]: Start accepts. Automaton has 33639 states and 42039 transitions. Word has length 128 [2019-09-10 07:44:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:56,087 INFO L475 AbstractCegarLoop]: Abstraction has 33639 states and 42039 transitions. [2019-09-10 07:44:56,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:44:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 33639 states and 42039 transitions. [2019-09-10 07:44:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:44:56,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:56,091 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:56,092 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 163360474, now seen corresponding path program 1 times [2019-09-10 07:44:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:56,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:56,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:44:56,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:44:56,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:56,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:44:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:44:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:56,241 INFO L87 Difference]: Start difference. First operand 33639 states and 42039 transitions. Second operand 6 states. [2019-09-10 07:44:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:56,473 INFO L93 Difference]: Finished difference Result 73447 states and 91839 transitions. [2019-09-10 07:44:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:44:56,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-10 07:44:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:56,540 INFO L225 Difference]: With dead ends: 73447 [2019-09-10 07:44:56,540 INFO L226 Difference]: Without dead ends: 73447 [2019-09-10 07:44:56,540 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:44:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73447 states. [2019-09-10 07:44:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73447 to 44279. [2019-09-10 07:44:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44279 states. [2019-09-10 07:44:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44279 states to 44279 states and 55151 transitions. [2019-09-10 07:44:57,854 INFO L78 Accepts]: Start accepts. Automaton has 44279 states and 55151 transitions. Word has length 128 [2019-09-10 07:44:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:57,854 INFO L475 AbstractCegarLoop]: Abstraction has 44279 states and 55151 transitions. [2019-09-10 07:44:57,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:44:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 44279 states and 55151 transitions. [2019-09-10 07:44:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:44:57,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:57,858 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:57,858 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1572708942, now seen corresponding path program 1 times [2019-09-10 07:44:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:57,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:57,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:58,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:58,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:58,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 07:44:58,121 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [170], [172], [174], [177], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [222], [224], [227], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [311], [313], [316], [319], [321], [336], [338], [341], [344], [346], [361], [363], [366], [369], [371], [379], [382], [388], [390], [393], [396], [398], [433], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:44:58,164 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:58,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:58,296 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:59,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:59,017 INFO L272 AbstractInterpreter]: Visited 120 different actions 571 times. Merged at 48 different actions 394 times. Widened at 19 different actions 67 times. Performed 1961 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1961 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 13 different actions. Largest state had 189 variables. [2019-09-10 07:44:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:59,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:59,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:59,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:59,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:44:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:59,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:44:59,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:44:59,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:44:59,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:44:59,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 6] total 19 [2019-09-10 07:44:59,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:59,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:44:59,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:44:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:44:59,651 INFO L87 Difference]: Start difference. First operand 44279 states and 55151 transitions. Second operand 6 states. [2019-09-10 07:45:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:00,005 INFO L93 Difference]: Finished difference Result 94839 states and 118359 transitions. [2019-09-10 07:45:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:45:00,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-10 07:45:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:00,543 INFO L225 Difference]: With dead ends: 94839 [2019-09-10 07:45:00,544 INFO L226 Difference]: Without dead ends: 94839 [2019-09-10 07:45:00,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:45:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94839 states. [2019-09-10 07:45:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94839 to 51415. [2019-09-10 07:45:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51415 states. [2019-09-10 07:45:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51415 states to 51415 states and 63999 transitions. [2019-09-10 07:45:01,616 INFO L78 Accepts]: Start accepts. Automaton has 51415 states and 63999 transitions. Word has length 128 [2019-09-10 07:45:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:01,617 INFO L475 AbstractCegarLoop]: Abstraction has 51415 states and 63999 transitions. [2019-09-10 07:45:01,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:45:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51415 states and 63999 transitions. [2019-09-10 07:45:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:45:01,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:01,625 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:01,625 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 779954056, now seen corresponding path program 1 times [2019-09-10 07:45:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:01,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:01,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:02,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:02,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:02,052 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:45:02,052 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [170], [172], [174], [177], [187], [190], [194], [197], [200], [204], [206], [209], [214], [222], [224], [227], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [271], [275], [277], [279], [282], [283], [285], [288], [293], [295], [298], [311], [313], [316], [319], [321], [336], [338], [341], [344], [346], [361], [363], [366], [369], [371], [386], [388], [390], [393], [396], [398], [433], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:45:02,064 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:02,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:02,120 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:02,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:02,935 INFO L272 AbstractInterpreter]: Visited 120 different actions 637 times. Merged at 47 different actions 448 times. Widened at 19 different actions 64 times. Performed 2160 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 73 fixpoints after 16 different actions. Largest state had 189 variables. [2019-09-10 07:45:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:02,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:02,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:02,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:02,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:02,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:03,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:45:03,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:03,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:03,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:03,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:04,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:04,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:06,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 07:45:06,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:06,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 07:45:06,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:06,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:45:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:45:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:45:06,374 INFO L87 Difference]: Start difference. First operand 51415 states and 63999 transitions. Second operand 21 states. [2019-09-10 07:45:08,659 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:45:08,804 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:45:08,955 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:45:09,231 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:45:09,575 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:45:09,850 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:10,026 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:45:10,227 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:10,852 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:10,989 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:45:11,231 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:45:11,965 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:45:12,614 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:45:13,156 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:45:13,463 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:45:13,823 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:14,014 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:14,631 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:45:14,824 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:45:15,122 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:45:15,303 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:45:15,491 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:45:15,685 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:45:16,255 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:45:16,411 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:45:16,564 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:45:16,750 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:45:17,475 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:45:17,703 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:45:18,123 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:45:18,457 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:45:19,103 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:45:19,547 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:45:19,738 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:45:19,953 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:45:20,411 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:45:20,594 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:20,757 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:45:20,971 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:45:21,126 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:45:21,592 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:45:21,915 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:45:22,106 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:45:22,594 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:45:23,234 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:45:23,425 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:45:23,741 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:45:24,025 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:45:24,199 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:45:24,467 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:45:25,533 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:45:25,700 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:45:26,219 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:45:26,647 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:45:27,268 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:45:27,447 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:45:27,673 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:27,997 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:45:28,175 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:45:28,336 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:45:28,645 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:45:29,131 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:45:29,414 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:45:29,567 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:45:29,747 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:45:29,914 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:45:30,092 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:45:30,521 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:30,683 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:30,870 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:31,030 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:45:31,193 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:45:31,802 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:45:31,993 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:45:32,374 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:45:32,531 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:45:32,868 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:45:33,067 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:33,399 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:45:33,588 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:45:33,782 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:45:33,979 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:45:34,271 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:45:34,413 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:45:34,663 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:45:34,853 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:45:35,137 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:45:35,314 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:45:35,633 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:45:35,826 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:45:36,210 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:45:36,389 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:45:36,765 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:45:37,005 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:45:37,180 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:45:37,334 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:45:37,807 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:45:38,311 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:45:38,483 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:45:38,704 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:38,993 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:45:39,155 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:45:39,349 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:45:39,525 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:45:39,853 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:45:40,059 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:45:40,285 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:45:40,464 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:40,674 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:40,844 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:45:41,006 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:45:41,180 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:45:41,383 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:45:41,614 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:45:41,781 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:45:41,972 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:45:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:42,450 INFO L93 Difference]: Finished difference Result 392126 states and 475089 transitions. [2019-09-10 07:45:42,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-09-10 07:45:42,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 129 [2019-09-10 07:45:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:45,736 INFO L225 Difference]: With dead ends: 392126 [2019-09-10 07:45:45,737 INFO L226 Difference]: Without dead ends: 392126 [2019-09-10 07:45:45,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 208 SyntacticMatches, 33 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20355 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=8508, Invalid=45548, Unknown=0, NotChecked=0, Total=54056 [2019-09-10 07:45:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392126 states. [2019-09-10 07:45:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392126 to 156111. [2019-09-10 07:45:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156111 states. [2019-09-10 07:45:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156111 states to 156111 states and 192687 transitions. [2019-09-10 07:45:48,216 INFO L78 Accepts]: Start accepts. Automaton has 156111 states and 192687 transitions. Word has length 129 [2019-09-10 07:45:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:48,217 INFO L475 AbstractCegarLoop]: Abstraction has 156111 states and 192687 transitions. [2019-09-10 07:45:48,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:45:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 156111 states and 192687 transitions. [2019-09-10 07:45:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:45:48,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:48,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:48,230 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1442513702, now seen corresponding path program 1 times [2019-09-10 07:45:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:48,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:48,364 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:45:48,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:48,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:45:48,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:48,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:45:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:45:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:45:48,365 INFO L87 Difference]: Start difference. First operand 156111 states and 192687 transitions. Second operand 9 states. [2019-09-10 07:45:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:50,079 INFO L93 Difference]: Finished difference Result 233057 states and 288192 transitions. [2019-09-10 07:45:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:45:50,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 07:45:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:50,418 INFO L225 Difference]: With dead ends: 233057 [2019-09-10 07:45:50,419 INFO L226 Difference]: Without dead ends: 233057 [2019-09-10 07:45:50,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:45:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233057 states. [2019-09-10 07:45:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233057 to 156111. [2019-09-10 07:45:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156111 states. [2019-09-10 07:45:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156111 states to 156111 states and 192683 transitions. [2019-09-10 07:45:55,117 INFO L78 Accepts]: Start accepts. Automaton has 156111 states and 192683 transitions. Word has length 130 [2019-09-10 07:45:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:55,117 INFO L475 AbstractCegarLoop]: Abstraction has 156111 states and 192683 transitions. [2019-09-10 07:45:55,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:45:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 156111 states and 192683 transitions. [2019-09-10 07:45:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:45:55,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:55,127 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:55,127 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1244488833, now seen corresponding path program 1 times [2019-09-10 07:45:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:55,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:55,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:45:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:55,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:45:55,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:55,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:45:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:45:55,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:45:55,189 INFO L87 Difference]: Start difference. First operand 156111 states and 192683 transitions. Second operand 4 states. [2019-09-10 07:45:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:55,583 INFO L93 Difference]: Finished difference Result 156187 states and 192760 transitions. [2019-09-10 07:45:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:45:55,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-10 07:45:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:56,411 INFO L225 Difference]: With dead ends: 156187 [2019-09-10 07:45:56,411 INFO L226 Difference]: Without dead ends: 156187 [2019-09-10 07:45:56,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:45:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156187 states. [2019-09-10 07:45:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156187 to 156097. [2019-09-10 07:45:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156097 states. [2019-09-10 07:45:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156097 states to 156097 states and 192669 transitions. [2019-09-10 07:45:58,508 INFO L78 Accepts]: Start accepts. Automaton has 156097 states and 192669 transitions. Word has length 132 [2019-09-10 07:45:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:58,508 INFO L475 AbstractCegarLoop]: Abstraction has 156097 states and 192669 transitions. [2019-09-10 07:45:58,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:45:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 156097 states and 192669 transitions. [2019-09-10 07:45:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:45:58,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:58,515 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:58,516 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1099134564, now seen corresponding path program 1 times [2019-09-10 07:45:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:58,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:58,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:58,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:58,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:58,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:45:58,846 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [222], [224], [227], [235], [237], [240], [248], [250], [253], [261], [263], [265], [268], [271], [275], [277], [279], [282], [283], [285], [288], [293], [295], [298], [311], [313], [316], [319], [321], [336], [338], [341], [344], [346], [361], [363], [366], [369], [371], [386], [388], [390], [393], [396], [398], [436], [491], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:45:58,851 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:58,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:58,900 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:59,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:59,426 INFO L272 AbstractInterpreter]: Visited 123 different actions 601 times. Merged at 47 different actions 413 times. Widened at 20 different actions 58 times. Performed 2038 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2038 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 69 fixpoints after 17 different actions. Largest state had 189 variables. [2019-09-10 07:45:59,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:59,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:59,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:59,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:59,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:59,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:45:59,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:59,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:00,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:00,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:00,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:01,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:01,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:01,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 07:46:01,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:01,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:46:01,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:46:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:46:01,456 INFO L87 Difference]: Start difference. First operand 156097 states and 192669 transitions. Second operand 22 states. [2019-09-10 07:46:03,941 WARN L188 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 07:46:04,268 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:46:04,546 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:46:04,838 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:46:05,150 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:46:06,365 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:46:06,765 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 07:46:07,239 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:46:07,442 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 07:46:08,331 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 07:46:08,651 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 07:46:09,345 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:46:09,548 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:46:09,917 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 07:46:10,061 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 07:46:10,274 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 07:46:10,466 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-09-10 07:46:11,717 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 07:46:12,171 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-09-10 07:46:13,614 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 07:46:14,269 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 07:46:14,630 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:46:15,099 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 07:46:15,278 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:46:16,034 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:46:16,326 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 07:46:16,749 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:46:17,549 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 07:46:17,814 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:46:17,965 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:46:18,472 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:46:18,653 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 07:46:19,121 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:46:20,125 WARN L188 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2019-09-10 07:46:20,313 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:46:20,462 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:46:20,836 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 07:46:21,012 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 07:46:21,197 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 07:46:21,459 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:46:22,023 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:46:22,307 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:46:24,754 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:46:26,285 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 07:46:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:28,709 INFO L93 Difference]: Finished difference Result 580861 states and 708832 transitions. [2019-09-10 07:46:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-10 07:46:28,710 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 132 [2019-09-10 07:46:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:29,550 INFO L225 Difference]: With dead ends: 580861 [2019-09-10 07:46:29,550 INFO L226 Difference]: Without dead ends: 580861 [2019-09-10 07:46:29,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 227 SyntacticMatches, 18 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10365 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=5194, Invalid=26312, Unknown=0, NotChecked=0, Total=31506 [2019-09-10 07:46:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580861 states. [2019-09-10 07:46:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580861 to 156090. [2019-09-10 07:46:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156090 states. [2019-09-10 07:46:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156090 states to 156090 states and 192662 transitions. [2019-09-10 07:46:35,188 INFO L78 Accepts]: Start accepts. Automaton has 156090 states and 192662 transitions. Word has length 132 [2019-09-10 07:46:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:35,188 INFO L475 AbstractCegarLoop]: Abstraction has 156090 states and 192662 transitions. [2019-09-10 07:46:35,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:46:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 156090 states and 192662 transitions. [2019-09-10 07:46:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:46:35,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:35,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:35,195 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1163034943, now seen corresponding path program 1 times [2019-09-10 07:46:35,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:35,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:35,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:35,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:35,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:46:35,507 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [222], [224], [227], [235], [237], [240], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [304], [307], [313], [316], [319], [321], [336], [338], [341], [344], [346], [361], [363], [366], [369], [371], [379], [382], [388], [390], [393], [396], [398], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:46:35,516 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:35,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:35,543 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:36,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:36,053 INFO L272 AbstractInterpreter]: Visited 124 different actions 748 times. Merged at 50 different actions 553 times. Widened at 20 different actions 120 times. Performed 2456 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2456 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 60 fixpoints after 14 different actions. Largest state had 189 variables. [2019-09-10 07:46:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:36,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:36,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:36,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:39,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:39,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:46:39,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:39,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:40,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:40,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:41,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:41,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 07:46:41,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:41,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:46:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:46:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:46:41,780 INFO L87 Difference]: Start difference. First operand 156090 states and 192662 transitions. Second operand 20 states. [2019-09-10 07:46:42,192 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:46:42,876 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:46:43,518 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:46:43,763 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:46:44,025 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:46:44,361 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:46:44,725 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:46:44,978 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:46:45,374 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:46:45,685 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:46:46,014 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:46:46,305 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:46:46,661 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:46:47,230 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:46:47,567 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:46:47,848 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 07:46:48,329 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-10 07:46:48,746 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 07:46:49,079 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:46:49,472 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:46:50,180 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 07:46:50,533 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 07:46:50,800 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:46:51,222 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-09-10 07:46:51,568 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:46:52,040 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:46:52,577 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 07:46:52,996 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 07:46:53,494 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:46:53,807 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-10 07:46:56,346 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:46:56,734 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:46:57,078 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-10 07:46:57,381 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:46:57,897 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:46:58,278 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 07:46:58,721 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:46:59,151 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:46:59,623 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:46:59,859 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:47:00,156 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:47:00,766 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 07:47:01,131 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:47:01,663 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 07:47:02,142 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:47:02,462 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:47:02,965 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:47:03,591 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 07:47:03,937 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:47:06,312 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:47:06,656 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:47:07,294 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:47:07,864 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:47:10,340 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:47:10,689 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:47:11,175 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:47:11,640 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 07:47:11,960 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 07:47:12,281 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 07:47:12,648 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:47:13,446 WARN L188 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:47:13,809 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:47:14,341 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:47:14,716 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-10 07:47:15,050 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:47:15,368 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 07:47:15,787 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:47:16,288 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:47:16,558 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:47:16,805 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:47:17,175 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:47:17,530 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:47:17,894 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:47:18,188 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:47:18,466 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:47:18,871 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:47:19,204 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:47:19,751 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:47:20,127 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:47:21,286 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:47:21,823 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 07:47:22,122 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:47:23,093 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:47:23,600 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-10 07:47:23,984 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:47:24,448 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:47:24,913 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:47:25,281 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:47:25,768 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 07:47:26,179 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 07:47:26,580 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-10 07:47:27,106 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:47:27,690 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:47:28,050 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-10 07:47:28,791 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:47:29,252 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:47:29,676 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-10 07:47:30,001 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:47:30,348 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:47:30,743 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:47:31,019 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 07:47:31,363 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:47:31,814 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:47:32,262 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-09-10 07:47:32,728 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:47:33,338 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:47:33,686 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 07:47:34,097 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:47:35,300 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-10 07:47:35,796 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 07:47:36,198 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:47:37,029 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-10 07:47:37,553 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-09-10 07:47:37,976 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:47:38,459 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 07:47:38,825 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-10 07:47:39,300 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 07:47:39,646 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:47:40,215 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:47:40,769 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:47:41,200 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-10 07:47:41,609 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-10 07:47:42,344 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-09-10 07:47:42,727 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-10 07:47:43,241 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-10 07:47:43,612 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 07:47:44,006 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:47:44,516 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:47:45,100 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-10 07:47:45,490 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:47:45,888 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 07:47:46,292 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 07:47:46,728 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 07:47:47,214 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:47:47,710 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-09-10 07:47:48,224 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-10 07:47:48,637 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 07:47:49,335 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2019-09-10 07:47:49,763 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 07:47:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:51,002 INFO L93 Difference]: Finished difference Result 664845 states and 808783 transitions. [2019-09-10 07:47:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-10 07:47:51,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2019-09-10 07:47:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:51,794 INFO L225 Difference]: With dead ends: 664845 [2019-09-10 07:47:51,794 INFO L226 Difference]: Without dead ends: 664845 [2019-09-10 07:47:51,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 225 SyntacticMatches, 21 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10078 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=5275, Invalid=24137, Unknown=0, NotChecked=0, Total=29412 [2019-09-10 07:47:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664845 states. [2019-09-10 07:48:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664845 to 411353. [2019-09-10 07:48:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411353 states. [2019-09-10 07:48:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411353 states to 411353 states and 504413 transitions. [2019-09-10 07:48:00,740 INFO L78 Accepts]: Start accepts. Automaton has 411353 states and 504413 transitions. Word has length 132 [2019-09-10 07:48:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:00,741 INFO L475 AbstractCegarLoop]: Abstraction has 411353 states and 504413 transitions. [2019-09-10 07:48:00,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:48:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 411353 states and 504413 transitions. [2019-09-10 07:48:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:48:00,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:00,759 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:00,759 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2116815551, now seen corresponding path program 1 times [2019-09-10 07:48:00,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:00,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:48:00,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:00,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:48:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:48:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:48:00,825 INFO L87 Difference]: Start difference. First operand 411353 states and 504413 transitions. Second operand 3 states. [2019-09-10 07:48:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:01,246 INFO L93 Difference]: Finished difference Result 199147 states and 240578 transitions. [2019-09-10 07:48:01,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:48:01,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-10 07:48:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:01,455 INFO L225 Difference]: With dead ends: 199147 [2019-09-10 07:48:01,455 INFO L226 Difference]: Without dead ends: 199147 [2019-09-10 07:48:01,455 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:48:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199147 states. [2019-09-10 07:48:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199147 to 199145. [2019-09-10 07:48:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199145 states. [2019-09-10 07:48:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199145 states to 199145 states and 240577 transitions. [2019-09-10 07:48:08,674 INFO L78 Accepts]: Start accepts. Automaton has 199145 states and 240577 transitions. Word has length 134 [2019-09-10 07:48:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:08,675 INFO L475 AbstractCegarLoop]: Abstraction has 199145 states and 240577 transitions. [2019-09-10 07:48:08,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:48:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 199145 states and 240577 transitions. [2019-09-10 07:48:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:48:08,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:08,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:08,683 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1110639681, now seen corresponding path program 1 times [2019-09-10 07:48:08,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:08,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:08,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:08,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:08,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:08,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:08,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:08,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:48:08,922 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [222], [224], [227], [230], [235], [237], [240], [248], [250], [253], [256], [259], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [313], [316], [319], [321], [336], [338], [341], [344], [346], [354], [357], [363], [366], [369], [371], [379], [382], [388], [390], [393], [396], [398], [496], [609], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:48:08,925 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:08,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:08,957 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:09,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:09,306 INFO L272 AbstractInterpreter]: Visited 126 different actions 501 times. Merged at 51 different actions 331 times. Widened at 17 different actions 49 times. Performed 1756 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:48:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:09,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:09,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:09,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:09,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:09,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:09,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:48:09,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:09,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:09,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:09,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:09,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:09,955 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:10,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:10,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:10,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:10,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:10,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:10,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:48:11,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:11,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:48:11,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:11,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:48:11,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:48:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:48:11,090 INFO L87 Difference]: Start difference. First operand 199145 states and 240577 transitions. Second operand 20 states. [2019-09-10 07:48:11,655 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-09-10 07:48:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:19,681 INFO L93 Difference]: Finished difference Result 635267 states and 758624 transitions. [2019-09-10 07:48:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:48:19,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 134 [2019-09-10 07:48:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:20,403 INFO L225 Difference]: With dead ends: 635267 [2019-09-10 07:48:20,404 INFO L226 Difference]: Without dead ends: 635267 [2019-09-10 07:48:20,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 230 SyntacticMatches, 19 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1360, Invalid=5446, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 07:48:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635267 states. [2019-09-10 07:48:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635267 to 198986. [2019-09-10 07:48:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198986 states. [2019-09-10 07:48:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198986 states to 198986 states and 240404 transitions. [2019-09-10 07:48:29,378 INFO L78 Accepts]: Start accepts. Automaton has 198986 states and 240404 transitions. Word has length 134 [2019-09-10 07:48:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:29,378 INFO L475 AbstractCegarLoop]: Abstraction has 198986 states and 240404 transitions. [2019-09-10 07:48:29,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:48:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 198986 states and 240404 transitions. [2019-09-10 07:48:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:48:29,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:29,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:29,387 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:29,388 INFO L82 PathProgramCache]: Analyzing trace with hash -784289086, now seen corresponding path program 1 times [2019-09-10 07:48:29,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:29,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:29,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:29,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:29,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:48:29,706 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [222], [224], [227], [230], [235], [237], [240], [243], [246], [248], [250], [253], [256], [259], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [313], [316], [319], [321], [338], [341], [344], [346], [354], [357], [363], [366], [369], [371], [379], [382], [388], [390], [393], [396], [398], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:48:29,709 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:29,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:29,733 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:30,163 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:30,165 INFO L272 AbstractInterpreter]: Visited 126 different actions 667 times. Merged at 52 different actions 485 times. Widened at 17 different actions 82 times. Performed 2246 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 53 fixpoints after 14 different actions. Largest state had 189 variables. [2019-09-10 07:48:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:30,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:30,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:30,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:48:30,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:30,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:30,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 07:48:30,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:30,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:31,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:31,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:32,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:33,374 WARN L188 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-09-10 07:48:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:34,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:34,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 15] total 44 [2019-09-10 07:48:34,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:34,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:48:34,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:48:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1718, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:48:34,209 INFO L87 Difference]: Start difference. First operand 198986 states and 240404 transitions. Second operand 32 states. [2019-09-10 07:48:37,744 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:48:38,166 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:48:38,931 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:48:43,315 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:48:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:49,380 INFO L93 Difference]: Finished difference Result 866005 states and 1045017 transitions. [2019-09-10 07:48:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 07:48:49,381 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 134 [2019-09-10 07:48:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:50,477 INFO L225 Difference]: With dead ends: 866005 [2019-09-10 07:48:50,477 INFO L226 Difference]: Without dead ends: 866005 [2019-09-10 07:48:50,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 231 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=986, Invalid=5656, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 07:48:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866005 states. [2019-09-10 07:49:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866005 to 220808. [2019-09-10 07:49:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220808 states. [2019-09-10 07:49:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220808 states to 220808 states and 265989 transitions. [2019-09-10 07:49:00,475 INFO L78 Accepts]: Start accepts. Automaton has 220808 states and 265989 transitions. Word has length 134 [2019-09-10 07:49:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:00,475 INFO L475 AbstractCegarLoop]: Abstraction has 220808 states and 265989 transitions. [2019-09-10 07:49:00,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:49:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 220808 states and 265989 transitions. [2019-09-10 07:49:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:49:00,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:00,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:00,482 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2087663585, now seen corresponding path program 1 times [2019-09-10 07:49:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:00,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:00,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:01,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:01,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:01,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:49:01,004 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [220], [222], [224], [227], [230], [235], [237], [240], [243], [246], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [304], [307], [313], [316], [319], [321], [338], [341], [344], [346], [354], [357], [363], [366], [369], [371], [388], [390], [393], [396], [398], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:49:01,006 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:01,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:01,030 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:01,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:01,481 INFO L272 AbstractInterpreter]: Visited 126 different actions 674 times. Merged at 52 different actions 488 times. Widened at 18 different actions 76 times. Performed 2297 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2297 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 56 fixpoints after 15 different actions. Largest state had 189 variables. [2019-09-10 07:49:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:01,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:01,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:01,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:49:01,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:01,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:01,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 07:49:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:01,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:03,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:04,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:04,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:49:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:05,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:05,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 16] total 49 [2019-09-10 07:49:05,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:05,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:49:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:49:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2191, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:49:05,743 INFO L87 Difference]: Start difference. First operand 220808 states and 265989 transitions. Second operand 35 states. [2019-09-10 07:49:05,993 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:49:07,501 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:49:07,723 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:49:08,000 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:49:10,206 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:49:11,339 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 07:49:12,428 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:49:14,186 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 07:49:16,903 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-09-10 07:49:23,012 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-09-10 07:49:23,649 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:49:39,190 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:49:43,593 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 07:49:47,621 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 07:49:49,413 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:49:51,061 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 07:49:54,441 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:49:57,759 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:50:09,805 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 07:50:16,193 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:50:18,503 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 07:50:19,725 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-10 07:50:22,327 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:50:23,096 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:50:26,868 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-10 07:50:28,303 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 07:50:38,295 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 07:50:41,752 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-10 07:50:48,638 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:50:48,957 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:50:53,956 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-10 07:50:54,455 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:50:57,286 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-10 07:50:59,188 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-10 07:50:59,674 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:51:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:00,746 INFO L93 Difference]: Finished difference Result 574470 states and 688821 transitions. [2019-09-10 07:51:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-10 07:51:00,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2019-09-10 07:51:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:02,541 INFO L225 Difference]: With dead ends: 574470 [2019-09-10 07:51:02,541 INFO L226 Difference]: Without dead ends: 574470 [2019-09-10 07:51:02,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 227 SyntacticMatches, 15 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12748 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=4933, Invalid=34867, Unknown=0, NotChecked=0, Total=39800 [2019-09-10 07:51:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574470 states. [2019-09-10 07:51:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574470 to 267927. [2019-09-10 07:51:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267927 states. [2019-09-10 07:51:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267927 states to 267927 states and 321613 transitions. [2019-09-10 07:51:12,823 INFO L78 Accepts]: Start accepts. Automaton has 267927 states and 321613 transitions. Word has length 134 [2019-09-10 07:51:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:12,823 INFO L475 AbstractCegarLoop]: Abstraction has 267927 states and 321613 transitions. [2019-09-10 07:51:12,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:51:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 267927 states and 321613 transitions. [2019-09-10 07:51:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:51:12,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:12,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:51:12,831 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:12,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1050007307, now seen corresponding path program 1 times [2019-09-10 07:51:12,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:12,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:12,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:12,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:51:12,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:51:12,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:51:12,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:51:12,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:51:12,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:51:12,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:51:12,887 INFO L87 Difference]: Start difference. First operand 267927 states and 321613 transitions. Second operand 4 states. [2019-09-10 07:51:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:14,428 INFO L93 Difference]: Finished difference Result 365872 states and 439781 transitions. [2019-09-10 07:51:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:51:14,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-09-10 07:51:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:14,861 INFO L225 Difference]: With dead ends: 365872 [2019-09-10 07:51:14,861 INFO L226 Difference]: Without dead ends: 365872 [2019-09-10 07:51:14,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:51:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365872 states. [2019-09-10 07:51:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365872 to 266431. [2019-09-10 07:51:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266431 states. [2019-09-10 07:51:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266431 states to 266431 states and 320117 transitions. [2019-09-10 07:51:23,486 INFO L78 Accepts]: Start accepts. Automaton has 266431 states and 320117 transitions. Word has length 134 [2019-09-10 07:51:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:23,486 INFO L475 AbstractCegarLoop]: Abstraction has 266431 states and 320117 transitions. [2019-09-10 07:51:23,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:51:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 266431 states and 320117 transitions. [2019-09-10 07:51:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:51:23,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:23,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:51:23,494 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash 482858160, now seen corresponding path program 1 times [2019-09-10 07:51:23,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:23,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:23,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:23,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:23,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:23,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:51:23,805 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [146], [148], [151], [154], [157], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [222], [224], [227], [235], [237], [240], [243], [246], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [304], [307], [313], [316], [319], [321], [338], [341], [344], [346], [361], [363], [366], [369], [371], [379], [382], [388], [390], [393], [396], [398], [614], [838], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:51:23,808 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:23,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:23,831 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:24,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:24,182 INFO L272 AbstractInterpreter]: Visited 126 different actions 640 times. Merged at 51 different actions 458 times. Widened at 18 different actions 72 times. Performed 2160 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 47 fixpoints after 12 different actions. Largest state had 189 variables. [2019-09-10 07:51:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:24,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:24,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:24,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:51:24,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:24,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:24,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:51:24,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:24,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:24,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:24,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:25,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:25,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:25,831 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-09-10 07:51:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:25,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:25,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 28 [2019-09-10 07:51:25,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:25,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:51:25,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:51:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:51:25,880 INFO L87 Difference]: Start difference. First operand 266431 states and 320117 transitions. Second operand 23 states. [2019-09-10 07:51:26,245 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 07:51:26,607 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:51:26,862 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:51:27,073 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:51:28,031 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 07:51:28,345 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 07:51:28,559 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 07:51:28,980 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 07:51:29,563 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 07:51:29,724 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-09-10 07:51:30,362 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-09-10 07:51:30,958 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-10 07:51:31,156 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 07:51:31,564 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 07:51:32,329 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-10 07:51:32,604 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 07:51:33,241 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-09-10 07:51:33,666 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-09-10 07:51:34,139 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:51:34,472 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:51:35,232 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-10 07:51:35,946 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:51:36,468 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-09-10 07:51:36,924 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:51:37,527 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-10 07:51:37,992 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-09-10 07:51:39,928 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:51:40,118 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:51:40,446 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 07:51:40,696 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 07:51:40,975 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 07:51:41,354 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-10 07:51:41,741 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:51:42,044 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:51:42,309 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 07:51:43,074 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 07:51:43,561 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-09-10 07:51:44,517 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:51:45,138 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:51:45,542 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 07:51:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:47,929 INFO L93 Difference]: Finished difference Result 609629 states and 733031 transitions. [2019-09-10 07:51:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 07:51:47,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 134 [2019-09-10 07:51:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:48,621 INFO L225 Difference]: With dead ends: 609629 [2019-09-10 07:51:48,621 INFO L226 Difference]: Without dead ends: 609629 [2019-09-10 07:51:48,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 252 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1167, Invalid=4533, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 07:51:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609629 states. [2019-09-10 07:51:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609629 to 284760. [2019-09-10 07:51:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284760 states. [2019-09-10 07:51:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284760 states to 284760 states and 342050 transitions. [2019-09-10 07:51:57,438 INFO L78 Accepts]: Start accepts. Automaton has 284760 states and 342050 transitions. Word has length 134 [2019-09-10 07:51:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:57,438 INFO L475 AbstractCegarLoop]: Abstraction has 284760 states and 342050 transitions. [2019-09-10 07:51:57,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:51:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 284760 states and 342050 transitions. [2019-09-10 07:51:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:51:57,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:57,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:51:57,448 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 512450297, now seen corresponding path program 1 times [2019-09-10 07:51:57,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:57,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:57,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:57,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:57,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 07:51:57,761 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [220], [222], [224], [227], [230], [235], [237], [240], [243], [246], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [304], [307], [313], [316], [319], [321], [338], [341], [344], [346], [354], [357], [363], [366], [369], [371], [388], [390], [393], [396], [398], [496], [609], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:51:57,764 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:57,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:57,791 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:58,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:58,183 INFO L272 AbstractInterpreter]: Visited 127 different actions 601 times. Merged at 52 different actions 424 times. Widened at 15 different actions 52 times. Performed 2016 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2016 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 14 different actions. Largest state had 189 variables. [2019-09-10 07:51:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:58,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:58,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:58,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:58,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:58,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:51:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:58,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 07:51:58,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:58,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:58,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:00,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:00,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,641 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-09-10 07:52:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:03,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:03,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 21] total 55 [2019-09-10 07:52:03,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:03,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 07:52:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 07:52:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2658, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:52:03,370 INFO L87 Difference]: Start difference. First operand 284760 states and 342050 transitions. Second operand 36 states. [2019-09-10 07:52:07,413 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 07:52:08,816 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:52:09,784 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:52:26,388 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:52:32,030 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 07:52:32,377 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 07:52:33,916 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:52:34,596 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:52:37,104 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:52:38,365 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:53:07,311 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:53:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:09,239 INFO L93 Difference]: Finished difference Result 735501 states and 882347 transitions. [2019-09-10 07:53:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-10 07:53:09,239 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 135 [2019-09-10 07:53:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:10,079 INFO L225 Difference]: With dead ends: 735501 [2019-09-10 07:53:10,079 INFO L226 Difference]: Without dead ends: 735396 [2019-09-10 07:53:10,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 215 SyntacticMatches, 17 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11483 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=6077, Invalid=27958, Unknown=5, NotChecked=0, Total=34040 [2019-09-10 07:53:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735396 states. [2019-09-10 07:53:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735396 to 371014. [2019-09-10 07:53:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371014 states. [2019-09-10 07:53:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371014 states to 371014 states and 445690 transitions. [2019-09-10 07:53:22,031 INFO L78 Accepts]: Start accepts. Automaton has 371014 states and 445690 transitions. Word has length 135 [2019-09-10 07:53:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:22,031 INFO L475 AbstractCegarLoop]: Abstraction has 371014 states and 445690 transitions. [2019-09-10 07:53:22,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 07:53:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 371014 states and 445690 transitions. [2019-09-10 07:53:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:53:22,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:22,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:22,044 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 269606614, now seen corresponding path program 1 times [2019-09-10 07:53:22,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:22,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:22,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:22,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:22,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:22,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 07:53:22,443 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [159], [161], [164], [167], [170], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [220], [222], [224], [227], [230], [235], [237], [240], [243], [248], [250], [253], [256], [259], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [313], [316], [319], [321], [329], [332], [338], [341], [344], [346], [354], [357], [363], [366], [369], [371], [388], [390], [393], [396], [398], [496], [609], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:53:22,446 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:22,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:22,482 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:22,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:22,969 INFO L272 AbstractInterpreter]: Visited 127 different actions 722 times. Merged at 52 different actions 533 times. Widened at 16 different actions 90 times. Performed 2333 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2333 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 17 different actions. Largest state had 189 variables. [2019-09-10 07:53:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:22,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:22,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:22,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:53:22,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:22,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:23,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:53:23,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:23,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:23,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:27,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:53:27,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:27,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2019-09-10 07:53:27,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:27,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:53:27,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:53:27,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:53:27,797 INFO L87 Difference]: Start difference. First operand 371014 states and 445690 transitions. Second operand 21 states. [2019-09-10 07:53:27,974 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:53:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:32,241 INFO L93 Difference]: Finished difference Result 749421 states and 892985 transitions. [2019-09-10 07:53:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:53:32,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2019-09-10 07:53:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:33,052 INFO L225 Difference]: With dead ends: 749421 [2019-09-10 07:53:33,052 INFO L226 Difference]: Without dead ends: 749421 [2019-09-10 07:53:33,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:53:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749421 states. [2019-09-10 07:53:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749421 to 442652. [2019-09-10 07:53:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442652 states. [2019-09-10 07:53:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442652 states to 442652 states and 529518 transitions. [2019-09-10 07:53:45,629 INFO L78 Accepts]: Start accepts. Automaton has 442652 states and 529518 transitions. Word has length 135 [2019-09-10 07:53:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:45,630 INFO L475 AbstractCegarLoop]: Abstraction has 442652 states and 529518 transitions. [2019-09-10 07:53:45,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:53:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 442652 states and 529518 transitions. [2019-09-10 07:53:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:53:45,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:45,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:45,641 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -352860159, now seen corresponding path program 1 times [2019-09-10 07:53:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:45,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:45,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:46,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:46,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:46,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 07:53:46,677 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [172], [174], [177], [180], [183], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [220], [222], [224], [227], [230], [233], [235], [237], [240], [243], [248], [250], [253], [256], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [304], [307], [313], [316], [319], [321], [329], [332], [338], [341], [344], [346], [363], [366], [369], [371], [388], [390], [393], [396], [398], [436], [491], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:53:46,679 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:46,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:46,693 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:46,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:46,991 INFO L272 AbstractInterpreter]: Visited 127 different actions 611 times. Merged at 52 different actions 434 times. Widened at 16 different actions 63 times. Performed 2098 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2098 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 13 different actions. Largest state had 189 variables. [2019-09-10 07:53:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:46,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:46,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:46,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:47,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:47,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:53:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:47,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:53:47,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:47,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:47,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:47,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:47,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:48,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:48,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:48,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11, 11] total 44 [2019-09-10 07:53:48,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:48,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:53:48,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:53:48,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1759, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:53:48,226 INFO L87 Difference]: Start difference. First operand 442652 states and 529518 transitions. Second operand 35 states. [2019-09-10 07:53:48,569 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:53:49,774 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:53:50,045 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 07:53:50,285 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:53:50,487 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:53:50,698 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:53:57,408 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:53:59,511 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:53:59,948 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:54:01,272 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:54:02,292 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:54:03,016 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:54:04,966 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:05,663 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:54:06,957 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:54:07,327 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:54:07,523 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:08,394 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:54:08,648 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:54:08,803 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:54:09,626 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:54:10,337 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:10,507 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:10,763 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:54:10,995 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:54:11,441 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:54:13,996 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:54:14,193 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:54:15,885 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:16,111 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:54:16,365 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:16,675 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:54:16,940 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:54:18,609 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:18,841 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:54:19,300 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:54:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:20,381 INFO L93 Difference]: Finished difference Result 1067805 states and 1284155 transitions. [2019-09-10 07:54:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-10 07:54:20,381 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 135 [2019-09-10 07:54:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:21,797 INFO L225 Difference]: With dead ends: 1067805 [2019-09-10 07:54:21,798 INFO L226 Difference]: Without dead ends: 1067805 [2019-09-10 07:54:22,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11779 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=4622, Invalid=31288, Unknown=0, NotChecked=0, Total=35910 [2019-09-10 07:54:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067805 states. [2019-09-10 07:54:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067805 to 415759. [2019-09-10 07:54:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415759 states. [2019-09-10 07:54:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415759 states to 415759 states and 497665 transitions. [2019-09-10 07:54:39,464 INFO L78 Accepts]: Start accepts. Automaton has 415759 states and 497665 transitions. Word has length 135 [2019-09-10 07:54:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:39,464 INFO L475 AbstractCegarLoop]: Abstraction has 415759 states and 497665 transitions. [2019-09-10 07:54:39,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:54:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 415759 states and 497665 transitions. [2019-09-10 07:54:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:54:39,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:39,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:54:39,473 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:39,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2147002727, now seen corresponding path program 1 times [2019-09-10 07:54:39,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:39,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:39,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:39,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:39,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:39,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 07:54:39,837 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [131], [134], [138], [141], [144], [146], [148], [151], [154], [157], [159], [161], [164], [167], [172], [174], [177], [180], [185], [187], [190], [194], [197], [200], [204], [206], [209], [214], [217], [222], [224], [227], [230], [233], [235], [237], [240], [243], [248], [250], [253], [261], [263], [265], [268], [275], [277], [279], [282], [283], [285], [295], [298], [302], [311], [313], [316], [319], [321], [329], [332], [338], [341], [344], [346], [363], [366], [369], [371], [379], [382], [388], [390], [393], [396], [398], [409], [431], [436], [491], [1326], [1327], [1331], [1332], [1333] [2019-09-10 07:54:39,839 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:39,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:39,876 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:40,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:40,243 INFO L272 AbstractInterpreter]: Visited 127 different actions 525 times. Merged at 51 different actions 352 times. Widened at 16 different actions 47 times. Performed 1853 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1853 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:54:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:40,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:40,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:40,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:54:40,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:40,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:40,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:54:40,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:40,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:40,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:40,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:40,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:41,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:41,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:41,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2019-09-10 07:54:41,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:41,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:54:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:54:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:54:41,066 INFO L87 Difference]: Start difference. First operand 415759 states and 497665 transitions. Second operand 18 states. [2019-09-10 07:54:48,365 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:54:48,624 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:54:49,126 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 07:54:49,952 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 07:54:50,616 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:54:51,014 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:54:51,813 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:54:51,991 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:54:52,787 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 07:54:54,573 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:54:54,864 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:54:55,691 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 07:54:59,569 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:55:01,457 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 07:55:01,752 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:55:01,999 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 07:55:02,176 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:55:02,971 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 07:55:03,184 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:55:03,756 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 07:55:04,209 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:55:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:06,680 INFO L93 Difference]: Finished difference Result 1064694 states and 1267635 transitions. [2019-09-10 07:55:06,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-10 07:55:06,681 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-09-10 07:55:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:08,035 INFO L225 Difference]: With dead ends: 1064694 [2019-09-10 07:55:08,035 INFO L226 Difference]: Without dead ends: 1064694 [2019-09-10 07:55:08,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8341 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4069, Invalid=20423, Unknown=0, NotChecked=0, Total=24492 [2019-09-10 07:55:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064694 states.