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/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:47:25,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:47:25,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:47:25,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:47:25,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:47:25,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:47:25,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:47:25,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:47:25,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:47:25,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:47:25,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:47:25,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:47:25,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:47:25,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:47:25,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:47:25,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:47:25,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:47:25,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:47:25,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:47:25,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:47:25,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:47:25,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:47:25,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:47:25,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:47:25,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:47:25,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:47:25,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:47:25,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:47:25,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:47:25,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:47:25,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:47:25,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:47:25,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:47:25,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:47:25,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:47:26,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:47:26,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:47:26,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:47:26,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:47:26,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:47:26,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:47:26,003 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-09 05:47:26,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:47:26,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:47:26,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:47:26,019 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:47:26,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:47:26,020 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:47:26,020 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:47:26,020 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:47:26,021 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:47:26,021 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:47:26,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:47:26,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:47:26,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:47:26,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:47:26,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:47:26,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:47:26,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:47:26,023 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:47:26,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:47:26,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:47:26,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:47:26,024 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:47:26,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:47:26,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:47:26,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:47:26,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:47:26,025 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:47:26,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:47:26,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:47:26,025 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:47:26,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:47:26,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:47:26,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:47:26,071 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:47:26,071 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:47:26,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-09-09 05:47:26,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5823ea4c9/c8fd27506e21479793556b5b4f4cd2d1/FLAGfaff53920 [2019-09-09 05:47:26,637 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:47:26,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-09-09 05:47:26,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5823ea4c9/c8fd27506e21479793556b5b4f4cd2d1/FLAGfaff53920 [2019-09-09 05:47:26,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5823ea4c9/c8fd27506e21479793556b5b4f4cd2d1 [2019-09-09 05:47:26,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:47:26,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:47:26,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:47:26,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:47:26,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:47:26,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:47:26" (1/1) ... [2019-09-09 05:47:26,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1b1139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:26, skipping insertion in model container [2019-09-09 05:47:26,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:47:26" (1/1) ... [2019-09-09 05:47:26,990 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:47:27,056 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:47:27,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:47:27,328 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:47:27,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:47:27,500 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:47:27,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27 WrapperNode [2019-09-09 05:47:27,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:47:27,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:47:27,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:47:27,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:47:27,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (1/1) ... [2019-09-09 05:47:27,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:47:27,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:47:27,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:47:27,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:47:27,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (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-09 05:47:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:47:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:47:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:47:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-09-09 05:47:27,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:47:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:47:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:47:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:47:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:47:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:47:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-09-09 05:47:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:47:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:47:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:47:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:47:27,926 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:47:28,428 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:47:28,429 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:47:28,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:47:28,435 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:47:28,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:47:28 BoogieIcfgContainer [2019-09-09 05:47:28,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:47:28,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:47:28,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:47:28,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:47:28,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:47:26" (1/3) ... [2019-09-09 05:47:28,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4818d281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:47:28, skipping insertion in model container [2019-09-09 05:47:28,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:27" (2/3) ... [2019-09-09 05:47:28,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4818d281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:47:28, skipping insertion in model container [2019-09-09 05:47:28,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:47:28" (3/3) ... [2019-09-09 05:47:28,465 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-09-09 05:47:28,477 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:47:28,488 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:47:28,507 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:47:28,543 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:47:28,543 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:47:28,544 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:47:28,544 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:47:28,544 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:47:28,544 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:47:28,544 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:47:28,545 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:47:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-09 05:47:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:47:28,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:28,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] [2019-09-09 05:47:28,608 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1696698376, now seen corresponding path program 1 times [2019-09-09 05:47:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:28,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:28,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:28,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:28,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:28,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:28,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:28,981 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-09-09 05:47:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:29,440 INFO L93 Difference]: Finished difference Result 204 states and 342 transitions. [2019-09-09 05:47:29,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:29,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-09 05:47:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:29,456 INFO L225 Difference]: With dead ends: 204 [2019-09-09 05:47:29,457 INFO L226 Difference]: Without dead ends: 183 [2019-09-09 05:47:29,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-09 05:47:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-09-09 05:47:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 05:47:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 284 transitions. [2019-09-09 05:47:29,522 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 284 transitions. Word has length 51 [2019-09-09 05:47:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:29,522 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 284 transitions. [2019-09-09 05:47:29,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 284 transitions. [2019-09-09 05:47:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:47:29,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:29,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:29,527 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash 742008338, now seen corresponding path program 1 times [2019-09-09 05:47:29,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:29,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:29,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:29,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:29,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:29,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:29,667 INFO L87 Difference]: Start difference. First operand 178 states and 284 transitions. Second operand 5 states. [2019-09-09 05:47:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:30,004 INFO L93 Difference]: Finished difference Result 226 states and 371 transitions. [2019-09-09 05:47:30,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:30,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-09 05:47:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:30,008 INFO L225 Difference]: With dead ends: 226 [2019-09-09 05:47:30,008 INFO L226 Difference]: Without dead ends: 224 [2019-09-09 05:47:30,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-09 05:47:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-09-09 05:47:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-09 05:47:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 361 transitions. [2019-09-09 05:47:30,026 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 361 transitions. Word has length 52 [2019-09-09 05:47:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:30,026 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 361 transitions. [2019-09-09 05:47:30,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 361 transitions. [2019-09-09 05:47:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:47:30,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:30,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:30,032 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:30,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash 201696029, now seen corresponding path program 1 times [2019-09-09 05:47:30,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:30,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:30,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:30,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:30,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:30,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:30,175 INFO L87 Difference]: Start difference. First operand 219 states and 361 transitions. Second operand 5 states. [2019-09-09 05:47:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:30,462 INFO L93 Difference]: Finished difference Result 250 states and 417 transitions. [2019-09-09 05:47:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:30,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-09 05:47:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:30,469 INFO L225 Difference]: With dead ends: 250 [2019-09-09 05:47:30,469 INFO L226 Difference]: Without dead ends: 250 [2019-09-09 05:47:30,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-09 05:47:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-09-09 05:47:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-09 05:47:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-09-09 05:47:30,499 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 80 [2019-09-09 05:47:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:30,500 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-09-09 05:47:30,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-09-09 05:47:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-09 05:47:30,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:30,511 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:47:30,511 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:30,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256498, now seen corresponding path program 1 times [2019-09-09 05:47:30,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:30,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:30,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:30,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:30,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:30,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:30,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:30,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:30,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:30,614 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 5 states. [2019-09-09 05:47:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:30,874 INFO L93 Difference]: Finished difference Result 296 states and 497 transitions. [2019-09-09 05:47:30,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:30,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-09 05:47:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:30,877 INFO L225 Difference]: With dead ends: 296 [2019-09-09 05:47:30,877 INFO L226 Difference]: Without dead ends: 296 [2019-09-09 05:47:30,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-09 05:47:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-09-09 05:47:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-09 05:47:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-09-09 05:47:30,890 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 91 [2019-09-09 05:47:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:30,891 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-09-09 05:47:30,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-09-09 05:47:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-09 05:47:30,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:30,893 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:47:30,894 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1933322156, now seen corresponding path program 1 times [2019-09-09 05:47:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:30,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:30,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:30,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:30,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:30,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:30,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:30,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:30,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:30,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:30,989 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 5 states. [2019-09-09 05:47:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:31,243 INFO L93 Difference]: Finished difference Result 296 states and 495 transitions. [2019-09-09 05:47:31,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:31,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-09 05:47:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:31,246 INFO L225 Difference]: With dead ends: 296 [2019-09-09 05:47:31,246 INFO L226 Difference]: Without dead ends: 294 [2019-09-09 05:47:31,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-09 05:47:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-09-09 05:47:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-09 05:47:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 487 transitions. [2019-09-09 05:47:31,257 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 487 transitions. Word has length 92 [2019-09-09 05:47:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:31,257 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 487 transitions. [2019-09-09 05:47:31,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 487 transitions. [2019-09-09 05:47:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-09 05:47:31,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:31,260 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:31,260 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1585840345, now seen corresponding path program 1 times [2019-09-09 05:47:31,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:31,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:31,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:47:31,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:31,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:31,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:31,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:31,342 INFO L87 Difference]: Start difference. First operand 290 states and 487 transitions. Second operand 5 states. [2019-09-09 05:47:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:31,523 INFO L93 Difference]: Finished difference Result 307 states and 511 transitions. [2019-09-09 05:47:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:31,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-09 05:47:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:31,526 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:47:31,526 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:47:31,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:47:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-09-09 05:47:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-09 05:47:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 509 transitions. [2019-09-09 05:47:31,535 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 509 transitions. Word has length 92 [2019-09-09 05:47:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:31,536 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 509 transitions. [2019-09-09 05:47:31,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 509 transitions. [2019-09-09 05:47:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-09 05:47:31,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:31,537 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:31,538 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 6376232, now seen corresponding path program 1 times [2019-09-09 05:47:31,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:31,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:31,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:31,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:47:31,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:31,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:31,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:31,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:31,631 INFO L87 Difference]: Start difference. First operand 305 states and 509 transitions. Second operand 5 states. [2019-09-09 05:47:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:31,809 INFO L93 Difference]: Finished difference Result 307 states and 507 transitions. [2019-09-09 05:47:31,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:31,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-09 05:47:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:31,816 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:47:31,816 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:47:31,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:47:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-09-09 05:47:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-09 05:47:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 505 transitions. [2019-09-09 05:47:31,828 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 505 transitions. Word has length 93 [2019-09-09 05:47:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:31,828 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 505 transitions. [2019-09-09 05:47:31,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 505 transitions. [2019-09-09 05:47:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:47:31,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:31,830 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:31,830 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -854791455, now seen corresponding path program 1 times [2019-09-09 05:47:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:31,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:47:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:31,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:31,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:31,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:31,920 INFO L87 Difference]: Start difference. First operand 305 states and 505 transitions. Second operand 5 states. [2019-09-09 05:47:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:32,115 INFO L93 Difference]: Finished difference Result 314 states and 511 transitions. [2019-09-09 05:47:32,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:32,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-09 05:47:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:32,117 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:47:32,118 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:47:32,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:47:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-09-09 05:47:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-09 05:47:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 511 transitions. [2019-09-09 05:47:32,126 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 511 transitions. Word has length 106 [2019-09-09 05:47:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:32,127 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 511 transitions. [2019-09-09 05:47:32,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 511 transitions. [2019-09-09 05:47:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:47:32,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:32,129 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:32,129 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1777100668, now seen corresponding path program 1 times [2019-09-09 05:47:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:32,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:32,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:47:32,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:32,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:32,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:32,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:32,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:32,193 INFO L87 Difference]: Start difference. First operand 314 states and 511 transitions. Second operand 5 states. [2019-09-09 05:47:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:32,419 INFO L93 Difference]: Finished difference Result 345 states and 560 transitions. [2019-09-09 05:47:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:32,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-09 05:47:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:32,422 INFO L225 Difference]: With dead ends: 345 [2019-09-09 05:47:32,423 INFO L226 Difference]: Without dead ends: 345 [2019-09-09 05:47:32,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-09 05:47:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-09-09 05:47:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-09 05:47:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 558 transitions. [2019-09-09 05:47:32,435 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 558 transitions. Word has length 106 [2019-09-09 05:47:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:32,435 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 558 transitions. [2019-09-09 05:47:32,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 558 transitions. [2019-09-09 05:47:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-09 05:47:32,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:32,438 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:32,438 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1284309403, now seen corresponding path program 1 times [2019-09-09 05:47:32,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:32,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:32,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:47:32,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:32,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:32,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:32,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:32,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:32,499 INFO L87 Difference]: Start difference. First operand 343 states and 558 transitions. Second operand 5 states. [2019-09-09 05:47:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:32,696 INFO L93 Difference]: Finished difference Result 345 states and 556 transitions. [2019-09-09 05:47:32,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:32,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-09 05:47:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:32,700 INFO L225 Difference]: With dead ends: 345 [2019-09-09 05:47:32,700 INFO L226 Difference]: Without dead ends: 345 [2019-09-09 05:47:32,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-09 05:47:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-09-09 05:47:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-09 05:47:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 554 transitions. [2019-09-09 05:47:32,709 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 554 transitions. Word has length 107 [2019-09-09 05:47:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:32,710 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 554 transitions. [2019-09-09 05:47:32,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 554 transitions. [2019-09-09 05:47:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-09 05:47:32,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:32,712 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:32,713 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1845761004, now seen corresponding path program 1 times [2019-09-09 05:47:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:32,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:32,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:47:32,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:32,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:32,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:32,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:32,810 INFO L87 Difference]: Start difference. First operand 343 states and 554 transitions. Second operand 5 states. [2019-09-09 05:47:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:33,036 INFO L93 Difference]: Finished difference Result 378 states and 609 transitions. [2019-09-09 05:47:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:33,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-09 05:47:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:33,041 INFO L225 Difference]: With dead ends: 378 [2019-09-09 05:47:33,041 INFO L226 Difference]: Without dead ends: 378 [2019-09-09 05:47:33,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-09 05:47:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-09-09 05:47:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-09 05:47:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 596 transitions. [2019-09-09 05:47:33,053 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 596 transitions. Word has length 108 [2019-09-09 05:47:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:33,054 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 596 transitions. [2019-09-09 05:47:33,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 596 transitions. [2019-09-09 05:47:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-09 05:47:33,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:33,056 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:33,056 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2036530603, now seen corresponding path program 1 times [2019-09-09 05:47:33,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:33,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:33,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:47:33,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:33,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:33,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:33,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:33,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:33,144 INFO L87 Difference]: Start difference. First operand 370 states and 596 transitions. Second operand 5 states. [2019-09-09 05:47:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:33,392 INFO L93 Difference]: Finished difference Result 378 states and 604 transitions. [2019-09-09 05:47:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:33,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-09 05:47:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:33,396 INFO L225 Difference]: With dead ends: 378 [2019-09-09 05:47:33,396 INFO L226 Difference]: Without dead ends: 378 [2019-09-09 05:47:33,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-09 05:47:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-09-09 05:47:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-09 05:47:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2019-09-09 05:47:33,409 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 109 [2019-09-09 05:47:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:33,409 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2019-09-09 05:47:33,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2019-09-09 05:47:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:47:33,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:33,412 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:33,412 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash -346552109, now seen corresponding path program 1 times [2019-09-09 05:47:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:47:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:33,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:33,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:33,497 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand 5 states. [2019-09-09 05:47:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:33,723 INFO L93 Difference]: Finished difference Result 395 states and 626 transitions. [2019-09-09 05:47:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:33,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-09 05:47:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:33,727 INFO L225 Difference]: With dead ends: 395 [2019-09-09 05:47:33,727 INFO L226 Difference]: Without dead ends: 395 [2019-09-09 05:47:33,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-09 05:47:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-09 05:47:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-09 05:47:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2019-09-09 05:47:33,737 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 112 [2019-09-09 05:47:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:33,737 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2019-09-09 05:47:33,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2019-09-09 05:47:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 05:47:33,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:33,739 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:33,742 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 768287860, now seen corresponding path program 1 times [2019-09-09 05:47:33,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:33,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:47:33,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:33,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:33,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:33,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:33,795 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 5 states. [2019-09-09 05:47:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:33,969 INFO L93 Difference]: Finished difference Result 395 states and 620 transitions. [2019-09-09 05:47:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:33,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-09 05:47:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:33,972 INFO L225 Difference]: With dead ends: 395 [2019-09-09 05:47:33,972 INFO L226 Difference]: Without dead ends: 395 [2019-09-09 05:47:33,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-09 05:47:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-09 05:47:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-09 05:47:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 614 transitions. [2019-09-09 05:47:33,982 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 614 transitions. Word has length 113 [2019-09-09 05:47:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:33,983 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 614 transitions. [2019-09-09 05:47:33,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 614 transitions. [2019-09-09 05:47:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:47:33,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:33,985 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:33,985 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash -105487368, now seen corresponding path program 1 times [2019-09-09 05:47:33,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:33,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-09 05:47:34,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:34,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:34,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:34,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:34,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:34,048 INFO L87 Difference]: Start difference. First operand 391 states and 614 transitions. Second operand 3 states. [2019-09-09 05:47:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:34,090 INFO L93 Difference]: Finished difference Result 766 states and 1207 transitions. [2019-09-09 05:47:34,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:34,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-09 05:47:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:34,095 INFO L225 Difference]: With dead ends: 766 [2019-09-09 05:47:34,095 INFO L226 Difference]: Without dead ends: 766 [2019-09-09 05:47:34,096 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-09 05:47:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-09-09 05:47:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-09-09 05:47:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-09-09 05:47:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1207 transitions. [2019-09-09 05:47:34,114 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1207 transitions. Word has length 128 [2019-09-09 05:47:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:34,114 INFO L475 AbstractCegarLoop]: Abstraction has 766 states and 1207 transitions. [2019-09-09 05:47:34,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1207 transitions. [2019-09-09 05:47:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:47:34,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:34,117 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:34,117 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1228256447, now seen corresponding path program 1 times [2019-09-09 05:47:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:47:34,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:34,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:34,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:34,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:34,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:34,184 INFO L87 Difference]: Start difference. First operand 766 states and 1207 transitions. Second operand 5 states. [2019-09-09 05:47:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:34,465 INFO L93 Difference]: Finished difference Result 850 states and 1337 transitions. [2019-09-09 05:47:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:34,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-09 05:47:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:34,469 INFO L225 Difference]: With dead ends: 850 [2019-09-09 05:47:34,470 INFO L226 Difference]: Without dead ends: 850 [2019-09-09 05:47:34,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-09 05:47:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2019-09-09 05:47:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-09-09 05:47:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1325 transitions. [2019-09-09 05:47:34,488 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1325 transitions. Word has length 129 [2019-09-09 05:47:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:34,489 INFO L475 AbstractCegarLoop]: Abstraction has 842 states and 1325 transitions. [2019-09-09 05:47:34,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1325 transitions. [2019-09-09 05:47:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:47:34,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:34,492 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:34,492 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:34,492 INFO L82 PathProgramCache]: Analyzing trace with hash 998366491, now seen corresponding path program 1 times [2019-09-09 05:47:34,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:47:34,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:34,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:34,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:34,560 INFO L87 Difference]: Start difference. First operand 842 states and 1325 transitions. Second operand 5 states. [2019-09-09 05:47:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:34,791 INFO L93 Difference]: Finished difference Result 850 states and 1331 transitions. [2019-09-09 05:47:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:34,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-09 05:47:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:34,797 INFO L225 Difference]: With dead ends: 850 [2019-09-09 05:47:34,797 INFO L226 Difference]: Without dead ends: 846 [2019-09-09 05:47:34,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-09 05:47:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 838. [2019-09-09 05:47:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-09 05:47:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1313 transitions. [2019-09-09 05:47:34,819 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1313 transitions. Word has length 130 [2019-09-09 05:47:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:34,820 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1313 transitions. [2019-09-09 05:47:34,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1313 transitions. [2019-09-09 05:47:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:47:34,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:34,823 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:47:34,823 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1190868920, now seen corresponding path program 1 times [2019-09-09 05:47:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 05:47:34,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:34,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:34,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:34,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:34,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:34,895 INFO L87 Difference]: Start difference. First operand 838 states and 1313 transitions. Second operand 5 states. [2019-09-09 05:47:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:35,122 INFO L93 Difference]: Finished difference Result 914 states and 1425 transitions. [2019-09-09 05:47:35,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:35,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-09-09 05:47:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:35,127 INFO L225 Difference]: With dead ends: 914 [2019-09-09 05:47:35,127 INFO L226 Difference]: Without dead ends: 914 [2019-09-09 05:47:35,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-09 05:47:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-09-09 05:47:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-09 05:47:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1421 transitions. [2019-09-09 05:47:35,146 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1421 transitions. Word has length 162 [2019-09-09 05:47:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:35,146 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1421 transitions. [2019-09-09 05:47:35,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1421 transitions. [2019-09-09 05:47:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:47:35,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:35,150 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:47:35,150 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash -618678002, now seen corresponding path program 1 times [2019-09-09 05:47:35,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:35,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:35,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:35,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:35,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 05:47:35,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:35,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:35,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:35,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:35,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:35,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:35,216 INFO L87 Difference]: Start difference. First operand 910 states and 1421 transitions. Second operand 5 states. [2019-09-09 05:47:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:35,430 INFO L93 Difference]: Finished difference Result 914 states and 1417 transitions. [2019-09-09 05:47:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:35,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-09-09 05:47:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:35,435 INFO L225 Difference]: With dead ends: 914 [2019-09-09 05:47:35,436 INFO L226 Difference]: Without dead ends: 910 [2019-09-09 05:47:35,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-09-09 05:47:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2019-09-09 05:47:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-09 05:47:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1407 transitions. [2019-09-09 05:47:35,454 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1407 transitions. Word has length 163 [2019-09-09 05:47:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:35,455 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1407 transitions. [2019-09-09 05:47:35,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1407 transitions. [2019-09-09 05:47:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-09 05:47:35,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:35,459 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-09-09 05:47:35,459 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1613187866, now seen corresponding path program 1 times [2019-09-09 05:47:35,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:35,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:35,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-09 05:47:35,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:35,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:35,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:35,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:35,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:35,532 INFO L87 Difference]: Start difference. First operand 906 states and 1407 transitions. Second operand 5 states. [2019-09-09 05:47:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:35,769 INFO L93 Difference]: Finished difference Result 978 states and 1509 transitions. [2019-09-09 05:47:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:35,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-09 05:47:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:35,775 INFO L225 Difference]: With dead ends: 978 [2019-09-09 05:47:35,775 INFO L226 Difference]: Without dead ends: 978 [2019-09-09 05:47:35,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-09-09 05:47:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-09-09 05:47:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-09 05:47:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1505 transitions. [2019-09-09 05:47:35,794 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1505 transitions. Word has length 193 [2019-09-09 05:47:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:35,794 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1505 transitions. [2019-09-09 05:47:35,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1505 transitions. [2019-09-09 05:47:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-09 05:47:35,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:35,798 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:47:35,798 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180736, now seen corresponding path program 1 times [2019-09-09 05:47:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:35,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:35,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-09 05:47:35,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:35,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:35,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:35,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:35,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:35,885 INFO L87 Difference]: Start difference. First operand 974 states and 1505 transitions. Second operand 5 states. [2019-09-09 05:47:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:36,114 INFO L93 Difference]: Finished difference Result 978 states and 1499 transitions. [2019-09-09 05:47:36,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:36,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-09-09 05:47:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:36,119 INFO L225 Difference]: With dead ends: 978 [2019-09-09 05:47:36,119 INFO L226 Difference]: Without dead ends: 974 [2019-09-09 05:47:36,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-09 05:47:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2019-09-09 05:47:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-09-09 05:47:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1489 transitions. [2019-09-09 05:47:36,140 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1489 transitions. Word has length 194 [2019-09-09 05:47:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:36,140 INFO L475 AbstractCegarLoop]: Abstraction has 970 states and 1489 transitions. [2019-09-09 05:47:36,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1489 transitions. [2019-09-09 05:47:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-09 05:47:36,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:36,145 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:36,145 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1741358840, now seen corresponding path program 1 times [2019-09-09 05:47:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:36,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:36,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-09 05:47:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:36,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:36,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:36,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:36,218 INFO L87 Difference]: Start difference. First operand 970 states and 1489 transitions. Second operand 5 states. [2019-09-09 05:47:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:36,416 INFO L93 Difference]: Finished difference Result 1046 states and 1595 transitions. [2019-09-09 05:47:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:36,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-09 05:47:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:36,422 INFO L225 Difference]: With dead ends: 1046 [2019-09-09 05:47:36,422 INFO L226 Difference]: Without dead ends: 1046 [2019-09-09 05:47:36,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-09-09 05:47:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-09-09 05:47:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-09-09 05:47:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1553 transitions. [2019-09-09 05:47:36,442 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1553 transitions. Word has length 212 [2019-09-09 05:47:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:36,443 INFO L475 AbstractCegarLoop]: Abstraction has 1020 states and 1553 transitions. [2019-09-09 05:47:36,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1553 transitions. [2019-09-09 05:47:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-09 05:47:36,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:36,447 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:36,448 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1179693335, now seen corresponding path program 1 times [2019-09-09 05:47:36,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:36,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:36,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-09 05:47:36,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:36,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:36,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:36,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:36,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:36,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:36,541 INFO L87 Difference]: Start difference. First operand 1020 states and 1553 transitions. Second operand 5 states. [2019-09-09 05:47:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:36,761 INFO L93 Difference]: Finished difference Result 1046 states and 1577 transitions. [2019-09-09 05:47:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:36,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-09-09 05:47:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:36,769 INFO L225 Difference]: With dead ends: 1046 [2019-09-09 05:47:36,769 INFO L226 Difference]: Without dead ends: 1046 [2019-09-09 05:47:36,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-09-09 05:47:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-09-09 05:47:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-09-09 05:47:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1535 transitions. [2019-09-09 05:47:36,787 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1535 transitions. Word has length 213 [2019-09-09 05:47:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:36,787 INFO L475 AbstractCegarLoop]: Abstraction has 1020 states and 1535 transitions. [2019-09-09 05:47:36,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1535 transitions. [2019-09-09 05:47:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-09 05:47:36,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:36,792 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:47:36,792 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2078256648, now seen corresponding path program 1 times [2019-09-09 05:47:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:36,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:36,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-09 05:47:36,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:36,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:36,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:36,870 INFO L87 Difference]: Start difference. First operand 1020 states and 1535 transitions. Second operand 5 states. [2019-09-09 05:47:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:37,081 INFO L93 Difference]: Finished difference Result 1028 states and 1533 transitions. [2019-09-09 05:47:37,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:37,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-09-09 05:47:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:37,089 INFO L225 Difference]: With dead ends: 1028 [2019-09-09 05:47:37,089 INFO L226 Difference]: Without dead ends: 1028 [2019-09-09 05:47:37,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-09-09 05:47:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1020. [2019-09-09 05:47:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-09-09 05:47:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1523 transitions. [2019-09-09 05:47:37,111 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1523 transitions. Word has length 224 [2019-09-09 05:47:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:37,111 INFO L475 AbstractCegarLoop]: Abstraction has 1020 states and 1523 transitions. [2019-09-09 05:47:37,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1523 transitions. [2019-09-09 05:47:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-09 05:47:37,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:37,116 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:47:37,117 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -836415730, now seen corresponding path program 1 times [2019-09-09 05:47:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:37,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-09 05:47:37,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:37,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:37,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:37,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:37,191 INFO L87 Difference]: Start difference. First operand 1020 states and 1523 transitions. Second operand 5 states. [2019-09-09 05:47:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:37,380 INFO L93 Difference]: Finished difference Result 1028 states and 1521 transitions. [2019-09-09 05:47:37,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:37,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-09 05:47:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:37,385 INFO L225 Difference]: With dead ends: 1028 [2019-09-09 05:47:37,385 INFO L226 Difference]: Without dead ends: 1010 [2019-09-09 05:47:37,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-09-09 05:47:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2019-09-09 05:47:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-09 05:47:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1485 transitions. [2019-09-09 05:47:37,404 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1485 transitions. Word has length 225 [2019-09-09 05:47:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:37,404 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1485 transitions. [2019-09-09 05:47:37,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1485 transitions. [2019-09-09 05:47:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-09 05:47:37,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:37,407 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:37,408 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1494389851, now seen corresponding path program 1 times [2019-09-09 05:47:37,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:37,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:37,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:37,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:37,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-09 05:47:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:37,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:37,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:37,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:37,501 INFO L87 Difference]: Start difference. First operand 1002 states and 1485 transitions. Second operand 5 states. [2019-09-09 05:47:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:37,712 INFO L93 Difference]: Finished difference Result 1056 states and 1549 transitions. [2019-09-09 05:47:37,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:37,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-09-09 05:47:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:37,721 INFO L225 Difference]: With dead ends: 1056 [2019-09-09 05:47:37,722 INFO L226 Difference]: Without dead ends: 1056 [2019-09-09 05:47:37,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-09 05:47:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1048. [2019-09-09 05:47:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-09 05:47:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1539 transitions. [2019-09-09 05:47:37,744 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1539 transitions. Word has length 233 [2019-09-09 05:47:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:37,744 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1539 transitions. [2019-09-09 05:47:37,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1539 transitions. [2019-09-09 05:47:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-09 05:47:37,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:37,747 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:37,747 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1829546886, now seen corresponding path program 1 times [2019-09-09 05:47:37,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:37,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-09 05:47:37,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:37,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:47:37,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:37,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:47:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:47:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:37,837 INFO L87 Difference]: Start difference. First operand 1048 states and 1539 transitions. Second operand 5 states. [2019-09-09 05:47:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:38,023 INFO L93 Difference]: Finished difference Result 1056 states and 1529 transitions. [2019-09-09 05:47:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:38,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-09-09 05:47:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:38,027 INFO L225 Difference]: With dead ends: 1056 [2019-09-09 05:47:38,027 INFO L226 Difference]: Without dead ends: 1048 [2019-09-09 05:47:38,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-09 05:47:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1040. [2019-09-09 05:47:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-09-09 05:47:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1507 transitions. [2019-09-09 05:47:38,052 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1507 transitions. Word has length 234 [2019-09-09 05:47:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:38,052 INFO L475 AbstractCegarLoop]: Abstraction has 1040 states and 1507 transitions. [2019-09-09 05:47:38,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:47:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1507 transitions. [2019-09-09 05:47:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-09 05:47:38,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:38,055 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:47:38,055 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash 678328095, now seen corresponding path program 1 times [2019-09-09 05:47:38,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:38,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-09 05:47:38,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:38,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:38,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2019-09-09 05:47:38,190 INFO L207 CegarAbsIntRunner]: [0], [1], [7], [11], [14], [23], [34], [39], [48], [50], [55], [60], [65], [70], [75], [80], [85], [90], [93], [95], [100], [105], [108], [110], [115], [118], [120], [125], [128], [130], [135], [138], [140], [145], [150], [155], [158], [160], [165], [170], [175], [180], [185], [190], [193], [195], [200], [203], [205], [210], [213], [280], [283], [291], [293], [296], [304], [309], [311], [313], [316], [325], [327], [330], [336], [366], [371], [381], [385], [396], [398], [408], [410], [415], [428], [438], [440], [474], [477], [485], [490], [492], [494], [499], [504], [510], [515], [517], [522], [525], [595], [597], [610], [611], [612], [614], [616] [2019-09-09 05:47:38,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:38,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:38,534 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:38,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:47:38,868 INFO L272 AbstractInterpreter]: Visited 92 different actions 511 times. Merged at 68 different actions 368 times. Widened at 9 different actions 16 times. Performed 1140 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1140 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 28 fixpoints after 14 different actions. Largest state had 95 variables. [2019-09-09 05:47:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:38,873 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:47:39,323 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 93.18% of their original sizes. [2019-09-09 05:47:39,323 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:47:46,976 INFO L420 sIntCurrentIteration]: We unified 269 AI predicates to 269 [2019-09-09 05:47:46,976 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:47:46,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:47:46,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [4] total 59 [2019-09-09 05:47:46,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:46,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-09 05:47:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-09 05:47:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=2358, Unknown=0, NotChecked=0, Total=3192 [2019-09-09 05:47:46,980 INFO L87 Difference]: Start difference. First operand 1040 states and 1507 transitions. Second operand 57 states. [2019-09-09 05:48:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:38,628 INFO L93 Difference]: Finished difference Result 2816 states and 3945 transitions. [2019-09-09 05:48:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-09 05:48:38,628 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 270 [2019-09-09 05:48:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:38,640 INFO L225 Difference]: With dead ends: 2816 [2019-09-09 05:48:38,640 INFO L226 Difference]: Without dead ends: 2813 [2019-09-09 05:48:38,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 30 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5386 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=3316, Invalid=9116, Unknown=0, NotChecked=0, Total=12432 [2019-09-09 05:48:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-09-09 05:48:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2150. [2019-09-09 05:48:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2019-09-09 05:48:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 3020 transitions. [2019-09-09 05:48:38,695 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 3020 transitions. Word has length 270 [2019-09-09 05:48:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:38,696 INFO L475 AbstractCegarLoop]: Abstraction has 2150 states and 3020 transitions. [2019-09-09 05:48:38,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-09 05:48:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3020 transitions. [2019-09-09 05:48:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-09 05:48:38,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:38,701 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:48:38,702 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -230386138, now seen corresponding path program 1 times [2019-09-09 05:48:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:38,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:38,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-09 05:48:38,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:38,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:38,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:38,846 INFO L87 Difference]: Start difference. First operand 2150 states and 3020 transitions. Second operand 3 states. [2019-09-09 05:48:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:38,882 INFO L93 Difference]: Finished difference Result 4150 states and 5830 transitions. [2019-09-09 05:48:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:38,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-09-09 05:48:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:38,901 INFO L225 Difference]: With dead ends: 4150 [2019-09-09 05:48:38,901 INFO L226 Difference]: Without dead ends: 4150 [2019-09-09 05:48:38,903 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-09 05:48:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2019-09-09 05:48:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 4149. [2019-09-09 05:48:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2019-09-09 05:48:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 5829 transitions. [2019-09-09 05:48:38,998 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 5829 transitions. Word has length 278 [2019-09-09 05:48:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:38,999 INFO L475 AbstractCegarLoop]: Abstraction has 4149 states and 5829 transitions. [2019-09-09 05:48:38,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 5829 transitions. [2019-09-09 05:48:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-09 05:48:39,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:39,011 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:39,011 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:39,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash -860287162, now seen corresponding path program 1 times [2019-09-09 05:48:39,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:39,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-09 05:48:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:39,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:39,115 INFO L87 Difference]: Start difference. First operand 4149 states and 5829 transitions. Second operand 3 states. [2019-09-09 05:48:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:39,254 INFO L93 Difference]: Finished difference Result 4269 states and 5967 transitions. [2019-09-09 05:48:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:39,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-09 05:48:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:39,280 INFO L225 Difference]: With dead ends: 4269 [2019-09-09 05:48:39,280 INFO L226 Difference]: Without dead ends: 2584 [2019-09-09 05:48:39,285 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-09 05:48:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2019-09-09 05:48:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2560. [2019-09-09 05:48:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2019-09-09 05:48:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3553 transitions. [2019-09-09 05:48:39,342 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3553 transitions. Word has length 315 [2019-09-09 05:48:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:39,343 INFO L475 AbstractCegarLoop]: Abstraction has 2560 states and 3553 transitions. [2019-09-09 05:48:39,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3553 transitions. [2019-09-09 05:48:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-09 05:48:39,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:39,351 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:48:39,351 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2044603392, now seen corresponding path program 1 times [2019-09-09 05:48:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:39,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:39,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-09-09 05:48:39,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:39,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:39,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 383 with the following transitions: [2019-09-09 05:48:39,555 INFO L207 CegarAbsIntRunner]: [0], [1], [7], [11], [14], [23], [34], [39], [48], [50], [55], [60], [65], [70], [75], [80], [85], [90], [93], [95], [100], [105], [108], [110], [115], [118], [120], [125], [128], [130], [135], [138], [140], [145], [150], [155], [158], [160], [165], [170], [175], [180], [185], [190], [193], [195], [200], [203], [205], [210], [213], [280], [283], [291], [293], [296], [304], [309], [311], [313], [316], [325], [327], [330], [336], [366], [371], [381], [385], [396], [398], [408], [410], [415], [428], [438], [440], [474], [477], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [522], [525], [528], [534], [539], [541], [595], [597], [610], [611], [612], [614], [616] [2019-09-09 05:48:39,567 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:39,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:39,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:40,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:40,291 INFO L272 AbstractInterpreter]: Visited 102 different actions 2032 times. Merged at 86 different actions 1694 times. Widened at 19 different actions 250 times. Performed 4857 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4857 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 206 fixpoints after 19 different actions. Largest state had 95 variables. [2019-09-09 05:48:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:40,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:40,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:40,293 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-09 05:48:40,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:40,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:40,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:40,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-09-09 05:48:40,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:48:40,620 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:40,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:48:40,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:40,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:40,623 INFO L87 Difference]: Start difference. First operand 2560 states and 3553 transitions. Second operand 3 states. [2019-09-09 05:48:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:40,671 INFO L93 Difference]: Finished difference Result 3213 states and 4467 transitions. [2019-09-09 05:48:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:40,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-09-09 05:48:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:40,680 INFO L225 Difference]: With dead ends: 3213 [2019-09-09 05:48:40,680 INFO L226 Difference]: Without dead ends: 3213 [2019-09-09 05:48:40,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2019-09-09 05:48:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3213. [2019-09-09 05:48:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3213 states. [2019-09-09 05:48:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4467 transitions. [2019-09-09 05:48:40,735 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4467 transitions. Word has length 382 [2019-09-09 05:48:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:40,736 INFO L475 AbstractCegarLoop]: Abstraction has 3213 states and 4467 transitions. [2019-09-09 05:48:40,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4467 transitions. [2019-09-09 05:48:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-09 05:48:40,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:40,744 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:40,744 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 134700959, now seen corresponding path program 1 times [2019-09-09 05:48:40,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:40,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:40,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-09 05:48:40,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:40,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:40,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 454 with the following transitions: [2019-09-09 05:48:40,920 INFO L207 CegarAbsIntRunner]: [0], [1], [7], [11], [14], [23], [34], [39], [48], [50], [55], [60], [65], [70], [75], [80], [85], [90], [93], [95], [100], [105], [108], [110], [115], [118], [120], [125], [128], [130], [135], [138], [140], [145], [150], [155], [158], [160], [165], [170], [175], [180], [185], [190], [193], [195], [200], [203], [205], [210], [213], [280], [283], [291], [293], [296], [304], [309], [311], [313], [316], [325], [327], [330], [336], [366], [371], [381], [385], [396], [398], [408], [410], [415], [428], [438], [440], [474], [477], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [525], [528], [534], [537], [539], [541], [595], [597], [610], [611], [612], [614], [616] [2019-09-09 05:48:40,929 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:40,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:41,043 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:42,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:42,317 INFO L272 AbstractInterpreter]: Visited 104 different actions 2154 times. Merged at 88 different actions 1770 times. Widened at 18 different actions 265 times. Performed 5267 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5267 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 249 fixpoints after 22 different actions. Largest state had 95 variables. [2019-09-09 05:48:42,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:42,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:42,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:42,318 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-09 05:48:42,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:42,331 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-09 05:48:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:42,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:42,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-09-09 05:48:42,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-09-09 05:48:42,758 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:42,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:48:42,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:42,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:42,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:42,759 INFO L87 Difference]: Start difference. First operand 3213 states and 4467 transitions. Second operand 3 states. [2019-09-09 05:48:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:42,781 INFO L93 Difference]: Finished difference Result 2708 states and 3756 transitions. [2019-09-09 05:48:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:42,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-09-09 05:48:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:42,787 INFO L225 Difference]: With dead ends: 2708 [2019-09-09 05:48:42,787 INFO L226 Difference]: Without dead ends: 2708 [2019-09-09 05:48:42,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-09-09 05:48:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2622. [2019-09-09 05:48:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2622 states. [2019-09-09 05:48:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3637 transitions. [2019-09-09 05:48:42,823 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3637 transitions. Word has length 453 [2019-09-09 05:48:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:42,824 INFO L475 AbstractCegarLoop]: Abstraction has 2622 states and 3637 transitions. [2019-09-09 05:48:42,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3637 transitions. [2019-09-09 05:48:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-09 05:48:42,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:42,831 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:42,832 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1776341599, now seen corresponding path program 1 times [2019-09-09 05:48:42,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:42,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-09 05:48:42,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:42,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:42,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 454 with the following transitions: [2019-09-09 05:48:42,984 INFO L207 CegarAbsIntRunner]: [0], [1], [7], [11], [14], [23], [34], [39], [48], [50], [55], [60], [65], [70], [75], [80], [85], [90], [93], [95], [100], [105], [108], [110], [115], [118], [120], [125], [128], [130], [135], [138], [140], [145], [150], [155], [158], [160], [165], [170], [175], [180], [185], [190], [193], [195], [200], [203], [205], [210], [213], [280], [283], [291], [293], [296], [304], [309], [311], [313], [316], [325], [327], [330], [336], [366], [371], [381], [385], [396], [398], [408], [410], [415], [428], [438], [440], [474], [477], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [525], [528], [534], [539], [541], [595], [597], [610], [611], [612], [614], [616] [2019-09-09 05:48:42,986 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:42,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:43,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:43,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:43,848 INFO L272 AbstractInterpreter]: Visited 103 different actions 2142 times. Merged at 87 different actions 1775 times. Widened at 19 different actions 266 times. Performed 5112 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5112 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 236 fixpoints after 24 different actions. Largest state had 95 variables. [2019-09-09 05:48:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:43,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:43,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:43,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:48:43,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:43,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:43,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:43,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-09 05:48:44,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-09 05:48:44,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:48:44,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:48:44,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:44,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:48:44,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:48:44,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:44,278 INFO L87 Difference]: Start difference. First operand 2622 states and 3637 transitions. Second operand 4 states. [2019-09-09 05:48:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:44,535 INFO L93 Difference]: Finished difference Result 2974 states and 3956 transitions. [2019-09-09 05:48:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:44,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 453 [2019-09-09 05:48:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:44,541 INFO L225 Difference]: With dead ends: 2974 [2019-09-09 05:48:44,541 INFO L226 Difference]: Without dead ends: 2919 [2019-09-09 05:48:44,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 906 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-09 05:48:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2019-09-09 05:48:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2459. [2019-09-09 05:48:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-09-09 05:48:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3287 transitions. [2019-09-09 05:48:44,574 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3287 transitions. Word has length 453 [2019-09-09 05:48:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:44,575 INFO L475 AbstractCegarLoop]: Abstraction has 2459 states and 3287 transitions. [2019-09-09 05:48:44,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:48:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3287 transitions. [2019-09-09 05:48:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-09-09 05:48:44,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:44,586 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:44,587 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:44,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1812552048, now seen corresponding path program 1 times [2019-09-09 05:48:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:44,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-09-09 05:48:45,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:45,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:45,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 855 with the following transitions: [2019-09-09 05:48:45,032 INFO L207 CegarAbsIntRunner]: [0], [1], [7], [11], [14], [23], [34], [39], [48], [50], [55], [60], [65], [70], [75], [80], [85], [90], [93], [95], [100], [105], [108], [110], [115], [118], [120], [125], [128], [130], [135], [138], [140], [145], [150], [155], [158], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [195], [200], [203], [205], [210], [213], [280], [283], [291], [293], [296], [304], [309], [311], [313], [316], [325], [327], [330], [336], [366], [371], [381], [385], [396], [398], [408], [410], [415], [428], [438], [440], [442], [447], [452], [457], [460], [465], [467], [472], [474], [477], [479], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [525], [528], [534], [539], [541], [595], [597], [610], [611], [612], [614], [616] [2019-09-09 05:48:45,033 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:45,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:45,072 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:46,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:46,074 INFO L272 AbstractInterpreter]: Visited 115 different actions 2356 times. Merged at 96 different actions 1896 times. Widened at 22 different actions 290 times. Performed 5852 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5852 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 296 fixpoints after 23 different actions. Largest state had 99 variables. [2019-09-09 05:48:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:46,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:46,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:46,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:48:46,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:46,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:48:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:46,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:46,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-09-09 05:48:46,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-09-09 05:48:46,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:48:46,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:48:46,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:46,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:48:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:48:46,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:46,903 INFO L87 Difference]: Start difference. First operand 2459 states and 3287 transitions. Second operand 4 states. [2019-09-09 05:48:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:47,173 INFO L93 Difference]: Finished difference Result 3297 states and 4409 transitions. [2019-09-09 05:48:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:48:47,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2019-09-09 05:48:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:47,184 INFO L225 Difference]: With dead ends: 3297 [2019-09-09 05:48:47,184 INFO L226 Difference]: Without dead ends: 3045 [2019-09-09 05:48:47,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1713 GetRequests, 1708 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-09 05:48:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2019-09-09 05:48:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2415. [2019-09-09 05:48:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2019-09-09 05:48:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 3238 transitions. [2019-09-09 05:48:47,224 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 3238 transitions. Word has length 854 [2019-09-09 05:48:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:47,225 INFO L475 AbstractCegarLoop]: Abstraction has 2415 states and 3238 transitions. [2019-09-09 05:48:47,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:48:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 3238 transitions. [2019-09-09 05:48:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-09-09 05:48:47,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:47,240 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:47,240 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1607522492, now seen corresponding path program 1 times [2019-09-09 05:48:47,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:47,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:47,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-09-09 05:48:47,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:47,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:47,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:47,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:47,787 INFO L87 Difference]: Start difference. First operand 2415 states and 3238 transitions. Second operand 3 states. [2019-09-09 05:48:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:47,955 INFO L93 Difference]: Finished difference Result 2460 states and 3272 transitions. [2019-09-09 05:48:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:47,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1035 [2019-09-09 05:48:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:47,964 INFO L225 Difference]: With dead ends: 2460 [2019-09-09 05:48:47,964 INFO L226 Difference]: Without dead ends: 2460 [2019-09-09 05:48:47,964 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-09 05:48:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2019-09-09 05:48:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2415. [2019-09-09 05:48:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2019-09-09 05:48:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 3218 transitions. [2019-09-09 05:48:47,994 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 3218 transitions. Word has length 1035 [2019-09-09 05:48:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:47,994 INFO L475 AbstractCegarLoop]: Abstraction has 2415 states and 3218 transitions. [2019-09-09 05:48:47,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 3218 transitions. [2019-09-09 05:48:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-09-09 05:48:48,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,009 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:48,009 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash 123556935, now seen corresponding path program 1 times [2019-09-09 05:48:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-09-09 05:48:48,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:48,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:48,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:48,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:48,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,511 INFO L87 Difference]: Start difference. First operand 2415 states and 3218 transitions. Second operand 3 states. [2019-09-09 05:48:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:48,676 INFO L93 Difference]: Finished difference Result 2432 states and 3192 transitions. [2019-09-09 05:48:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:48,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1050 [2019-09-09 05:48:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:48,684 INFO L225 Difference]: With dead ends: 2432 [2019-09-09 05:48:48,684 INFO L226 Difference]: Without dead ends: 2417 [2019-09-09 05:48:48,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-09-09 05:48:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2400. [2019-09-09 05:48:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-09-09 05:48:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3153 transitions. [2019-09-09 05:48:48,712 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3153 transitions. Word has length 1050 [2019-09-09 05:48:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:48,712 INFO L475 AbstractCegarLoop]: Abstraction has 2400 states and 3153 transitions. [2019-09-09 05:48:48,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3153 transitions. [2019-09-09 05:48:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-09-09 05:48:48,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,728 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:48,728 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 860689758, now seen corresponding path program 1 times [2019-09-09 05:48:48,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-09-09 05:48:49,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:49,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:49,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:49,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:49,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:49,756 INFO L87 Difference]: Start difference. First operand 2400 states and 3153 transitions. Second operand 3 states. [2019-09-09 05:48:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:49,963 INFO L93 Difference]: Finished difference Result 2470 states and 3231 transitions. [2019-09-09 05:48:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:49,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2019-09-09 05:48:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:49,971 INFO L225 Difference]: With dead ends: 2470 [2019-09-09 05:48:49,971 INFO L226 Difference]: Without dead ends: 2452 [2019-09-09 05:48:49,971 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-09 05:48:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2019-09-09 05:48:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2442. [2019-09-09 05:48:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2019-09-09 05:48:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3201 transitions. [2019-09-09 05:48:50,016 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3201 transitions. Word has length 1078 [2019-09-09 05:48:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:50,018 INFO L475 AbstractCegarLoop]: Abstraction has 2442 states and 3201 transitions. [2019-09-09 05:48:50,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3201 transitions. [2019-09-09 05:48:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-09-09 05:48:50,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:50,047 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:50,047 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1775510994, now seen corresponding path program 1 times [2019-09-09 05:48:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:50,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:50,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:50,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-09-09 05:48:50,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:50,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:50,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:50,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:50,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:50,755 INFO L87 Difference]: Start difference. First operand 2442 states and 3201 transitions. Second operand 3 states. [2019-09-09 05:48:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:50,903 INFO L93 Difference]: Finished difference Result 1077 states and 1343 transitions. [2019-09-09 05:48:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:50,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-09-09 05:48:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:50,904 INFO L225 Difference]: With dead ends: 1077 [2019-09-09 05:48:50,905 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:48:50,905 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-09 05:48:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:48:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:48:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:48:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:48:50,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-09-09 05:48:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:50,907 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:48:50,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:48:50,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:48:50,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:48:50 BoogieIcfgContainer [2019-09-09 05:48:50,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:48:50,914 INFO L168 Benchmark]: Toolchain (without parser) took 83942.49 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 88.5 MB in the beginning and 156.4 MB in the end (delta: -68.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-09 05:48:50,915 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:48:50,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.71 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 88.3 MB in the beginning and 175.0 MB in the end (delta: -86.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:50,917 INFO L168 Benchmark]: Boogie Preprocessor took 67.27 ms. Allocated memory is still 201.9 MB. Free memory was 175.0 MB in the beginning and 172.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:50,917 INFO L168 Benchmark]: RCFGBuilder took 866.29 ms. Allocated memory is still 201.9 MB. Free memory was 172.6 MB in the beginning and 122.8 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:50,918 INFO L168 Benchmark]: TraceAbstraction took 82470.98 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 122.8 MB in the beginning and 156.4 MB in the end (delta: -33.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-09 05:48:50,921 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 529.71 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 88.3 MB in the beginning and 175.0 MB in the end (delta: -86.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.27 ms. Allocated memory is still 201.9 MB. Free memory was 175.0 MB in the beginning and 172.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.29 ms. Allocated memory is still 201.9 MB. Free memory was 172.6 MB in the beginning and 122.8 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82470.98 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 122.8 MB in the beginning and 156.4 MB in the end (delta: -33.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 154 locations, 1 error locations. SAFE Result, 82.3s OverallTime, 38 OverallIterations, 38 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6358 SDtfs, 17393 SDslu, 7174 SDs, 0 SdLazy, 11240 SolverSat, 2938 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4801 GetRequests, 4534 SyntacticMatches, 30 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5388 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4149occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.7671402161198071 AbsIntWeakeningRatio, 0.43866171003717475 AbsIntAvgWeakeningVarsNumRemoved, 20.260223048327138 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 2102 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 13172 NumberOfCodeBlocks, 13172 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 15268 ConstructedInterpolants, 0 QuantifiedInterpolants, 11131504 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3481 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 99697/99931 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...