java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:59:01,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:59:01,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:59:01,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:59:01,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:59:01,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:59:01,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:59:01,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:59:01,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:59:01,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:59:01,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:59:01,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:59:01,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:59:01,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:59:01,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:59:01,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:59:01,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:59:01,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:59:01,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:59:01,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:59:01,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:59:01,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:59:01,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:59:01,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:59:01,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:59:01,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:59:01,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:59:01,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:59:01,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:59:01,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:59:01,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:59:01,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:59:01,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:59:01,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:59:01,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:59:01,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:59:01,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:59:01,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:59:01,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:59:01,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:59:01,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:59:01,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:59:02,010 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:59:02,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:59:02,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:59:02,011 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:59:02,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:59:02,012 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:59:02,012 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:59:02,012 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:59:02,013 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:59:02,013 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:59:02,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:59:02,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:59:02,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:59:02,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:59:02,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:59:02,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:59:02,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:59:02,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:59:02,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:59:02,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:59:02,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:59:02,016 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:59:02,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:59:02,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:59:02,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:59:02,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:59:02,017 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:59:02,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:59:02,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:59:02,017 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:59:02,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:59:02,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:59:02,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:59:02,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:59:02,077 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:59:02,078 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:59:02,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4ccd672/974cbdfc1dcf436093e6c964b9a17f69/FLAGf3dd0c859 [2019-09-10 06:59:02,985 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:59:02,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:59:03,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4ccd672/974cbdfc1dcf436093e6c964b9a17f69/FLAGf3dd0c859 [2019-09-10 06:59:03,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4ccd672/974cbdfc1dcf436093e6c964b9a17f69 [2019-09-10 06:59:03,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:59:03,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:59:03,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:59:03,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:59:03,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:59:03,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:59:03" (1/1) ... [2019-09-10 06:59:03,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:03, skipping insertion in model container [2019-09-10 06:59:03,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:59:03" (1/1) ... [2019-09-10 06:59:03,541 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:59:03,733 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:59:05,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:59:05,157 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:59:05,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:59:05,784 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:59:05,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05 WrapperNode [2019-09-10 06:59:05,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:59:05,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:59:05,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:59:05,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:59:05,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:05,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:05,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:05,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:06,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:06,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:06,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... [2019-09-10 06:59:06,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:59:06,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:59:06,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:59:06,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:59:06,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:59:06,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:59:06,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:59:06,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:59:06,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:59:06,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:59:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:59:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:59:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:59:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:59:06,242 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:59:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:59:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:59:06,244 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:59:06,245 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:59:06,245 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:59:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:59:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:59:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:59:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:59:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:59:12,105 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:59:12,105 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:59:12,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:59:12 BoogieIcfgContainer [2019-09-10 06:59:12,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:59:12,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:59:12,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:59:12,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:59:12,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:59:03" (1/3) ... [2019-09-10 06:59:12,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e7b6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:59:12, skipping insertion in model container [2019-09-10 06:59:12,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:05" (2/3) ... [2019-09-10 06:59:12,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e7b6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:59:12, skipping insertion in model container [2019-09-10 06:59:12,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:59:12" (3/3) ... [2019-09-10 06:59:12,119 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:59:12,133 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:59:12,144 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 06:59:12,162 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 06:59:12,195 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:59:12,195 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:59:12,195 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:59:12,195 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:59:12,195 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:59:12,196 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:59:12,196 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:59:12,196 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:59:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states. [2019-09-10 06:59:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:59:12,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:12,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:12,284 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash 938283624, now seen corresponding path program 1 times [2019-09-10 06:59:12,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:12,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:12,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:13,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:13,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:59:13,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:13,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:13,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:13,047 INFO L87 Difference]: Start difference. First operand 2034 states. Second operand 5 states. [2019-09-10 06:59:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:16,913 INFO L93 Difference]: Finished difference Result 2669 states and 4704 transitions. [2019-09-10 06:59:16,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:16,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:59:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:16,973 INFO L225 Difference]: With dead ends: 2669 [2019-09-10 06:59:16,973 INFO L226 Difference]: Without dead ends: 2657 [2019-09-10 06:59:16,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-09-10 06:59:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2651. [2019-09-10 06:59:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2651 states. [2019-09-10 06:59:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3521 transitions. [2019-09-10 06:59:17,190 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3521 transitions. Word has length 68 [2019-09-10 06:59:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:17,192 INFO L475 AbstractCegarLoop]: Abstraction has 2651 states and 3521 transitions. [2019-09-10 06:59:17,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3521 transitions. [2019-09-10 06:59:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:59:17,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:17,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:17,209 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1195772802, now seen corresponding path program 1 times [2019-09-10 06:59:17,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:17,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:17,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:17,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:17,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:17,528 INFO L87 Difference]: Start difference. First operand 2651 states and 3521 transitions. Second operand 6 states. [2019-09-10 06:59:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:19,790 INFO L93 Difference]: Finished difference Result 3334 states and 4533 transitions. [2019-09-10 06:59:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:19,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:59:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:19,812 INFO L225 Difference]: With dead ends: 3334 [2019-09-10 06:59:19,812 INFO L226 Difference]: Without dead ends: 3334 [2019-09-10 06:59:19,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:59:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-09-10 06:59:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3317. [2019-09-10 06:59:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3317 states. [2019-09-10 06:59:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4521 transitions. [2019-09-10 06:59:19,920 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4521 transitions. Word has length 69 [2019-09-10 06:59:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:19,921 INFO L475 AbstractCegarLoop]: Abstraction has 3317 states and 4521 transitions. [2019-09-10 06:59:19,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4521 transitions. [2019-09-10 06:59:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:59:19,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:19,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:19,931 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1930205448, now seen corresponding path program 1 times [2019-09-10 06:59:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:20,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:20,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:20,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:20,193 INFO L87 Difference]: Start difference. First operand 3317 states and 4521 transitions. Second operand 6 states. [2019-09-10 06:59:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:22,703 INFO L93 Difference]: Finished difference Result 5812 states and 7939 transitions. [2019-09-10 06:59:22,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:22,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:59:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:22,734 INFO L225 Difference]: With dead ends: 5812 [2019-09-10 06:59:22,734 INFO L226 Difference]: Without dead ends: 5812 [2019-09-10 06:59:22,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:59:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2019-09-10 06:59:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 5788. [2019-09-10 06:59:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5788 states. [2019-09-10 06:59:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 7922 transitions. [2019-09-10 06:59:22,897 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 7922 transitions. Word has length 69 [2019-09-10 06:59:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:22,898 INFO L475 AbstractCegarLoop]: Abstraction has 5788 states and 7922 transitions. [2019-09-10 06:59:22,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 7922 transitions. [2019-09-10 06:59:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:59:22,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:22,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:22,906 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1715973779, now seen corresponding path program 1 times [2019-09-10 06:59:22,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:22,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:23,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:23,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:23,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:23,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:23,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:23,254 INFO L87 Difference]: Start difference. First operand 5788 states and 7922 transitions. Second operand 9 states. [2019-09-10 06:59:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:28,014 INFO L93 Difference]: Finished difference Result 7549 states and 10646 transitions. [2019-09-10 06:59:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:59:28,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 06:59:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:28,048 INFO L225 Difference]: With dead ends: 7549 [2019-09-10 06:59:28,048 INFO L226 Difference]: Without dead ends: 7549 [2019-09-10 06:59:28,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:59:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2019-09-10 06:59:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 5788. [2019-09-10 06:59:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5788 states. [2019-09-10 06:59:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 7921 transitions. [2019-09-10 06:59:28,188 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 7921 transitions. Word has length 70 [2019-09-10 06:59:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:28,189 INFO L475 AbstractCegarLoop]: Abstraction has 5788 states and 7921 transitions. [2019-09-10 06:59:28,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 7921 transitions. [2019-09-10 06:59:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:59:28,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:28,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:28,197 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:28,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1147545370, now seen corresponding path program 1 times [2019-09-10 06:59:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:28,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:28,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:28,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:28,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:28,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:28,505 INFO L87 Difference]: Start difference. First operand 5788 states and 7921 transitions. Second operand 10 states. [2019-09-10 06:59:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:36,256 INFO L93 Difference]: Finished difference Result 16714 states and 24913 transitions. [2019-09-10 06:59:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:59:36,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-09-10 06:59:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:36,309 INFO L225 Difference]: With dead ends: 16714 [2019-09-10 06:59:36,309 INFO L226 Difference]: Without dead ends: 16714 [2019-09-10 06:59:36,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:59:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16714 states. [2019-09-10 06:59:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16714 to 5795. [2019-09-10 06:59:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5795 states. [2019-09-10 06:59:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5795 states to 5795 states and 7928 transitions. [2019-09-10 06:59:36,483 INFO L78 Accepts]: Start accepts. Automaton has 5795 states and 7928 transitions. Word has length 70 [2019-09-10 06:59:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:36,484 INFO L475 AbstractCegarLoop]: Abstraction has 5795 states and 7928 transitions. [2019-09-10 06:59:36,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5795 states and 7928 transitions. [2019-09-10 06:59:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:59:36,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:36,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:36,492 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2042672088, now seen corresponding path program 1 times [2019-09-10 06:59:36,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:36,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:36,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:37,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:37,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:59:37,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:37,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:59:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:59:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:59:37,066 INFO L87 Difference]: Start difference. First operand 5795 states and 7928 transitions. Second operand 12 states. [2019-09-10 06:59:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:41,415 INFO L93 Difference]: Finished difference Result 32261 states and 48397 transitions. [2019-09-10 06:59:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:59:41,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 06:59:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:41,483 INFO L225 Difference]: With dead ends: 32261 [2019-09-10 06:59:41,483 INFO L226 Difference]: Without dead ends: 32261 [2019-09-10 06:59:41,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:59:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32261 states. [2019-09-10 06:59:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32261 to 5787. [2019-09-10 06:59:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-09-10 06:59:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7920 transitions. [2019-09-10 06:59:41,766 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7920 transitions. Word has length 71 [2019-09-10 06:59:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:41,767 INFO L475 AbstractCegarLoop]: Abstraction has 5787 states and 7920 transitions. [2019-09-10 06:59:41,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:59:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7920 transitions. [2019-09-10 06:59:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:59:41,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:41,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:41,788 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1298648854, now seen corresponding path program 1 times [2019-09-10 06:59:41,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:41,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:41,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:41,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:41,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:41,930 INFO L87 Difference]: Start difference. First operand 5787 states and 7920 transitions. Second operand 6 states. [2019-09-10 06:59:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:43,913 INFO L93 Difference]: Finished difference Result 10272 states and 14174 transitions. [2019-09-10 06:59:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:43,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:59:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:43,935 INFO L225 Difference]: With dead ends: 10272 [2019-09-10 06:59:43,936 INFO L226 Difference]: Without dead ends: 10272 [2019-09-10 06:59:43,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:59:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2019-09-10 06:59:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 10260. [2019-09-10 06:59:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10260 states. [2019-09-10 06:59:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 14166 transitions. [2019-09-10 06:59:44,111 INFO L78 Accepts]: Start accepts. Automaton has 10260 states and 14166 transitions. Word has length 71 [2019-09-10 06:59:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:44,112 INFO L475 AbstractCegarLoop]: Abstraction has 10260 states and 14166 transitions. [2019-09-10 06:59:44,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10260 states and 14166 transitions. [2019-09-10 06:59:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:59:44,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:44,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:44,121 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1959113445, now seen corresponding path program 1 times [2019-09-10 06:59:44,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:44,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:44,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:44,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:44,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:44,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:44,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:59:44,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:44,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:59:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:59:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:59:44,675 INFO L87 Difference]: Start difference. First operand 10260 states and 14166 transitions. Second operand 12 states. [2019-09-10 06:59:47,104 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-09-10 06:59:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:48,721 INFO L93 Difference]: Finished difference Result 50144 states and 75779 transitions. [2019-09-10 06:59:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:59:48,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 06:59:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:48,813 INFO L225 Difference]: With dead ends: 50144 [2019-09-10 06:59:48,813 INFO L226 Difference]: Without dead ends: 50144 [2019-09-10 06:59:48,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:59:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50144 states. [2019-09-10 06:59:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50144 to 10134. [2019-09-10 06:59:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10134 states. [2019-09-10 06:59:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10134 states to 10134 states and 13980 transitions. [2019-09-10 06:59:49,239 INFO L78 Accepts]: Start accepts. Automaton has 10134 states and 13980 transitions. Word has length 71 [2019-09-10 06:59:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:49,240 INFO L475 AbstractCegarLoop]: Abstraction has 10134 states and 13980 transitions. [2019-09-10 06:59:49,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:59:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 10134 states and 13980 transitions. [2019-09-10 06:59:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:59:49,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:49,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:49,251 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1685661044, now seen corresponding path program 1 times [2019-09-10 06:59:49,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:49,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:49,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:49,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:49,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:49,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:49,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:49,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:49,494 INFO L87 Difference]: Start difference. First operand 10134 states and 13980 transitions. Second operand 10 states. [2019-09-10 06:59:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:56,604 INFO L93 Difference]: Finished difference Result 31088 states and 45624 transitions. [2019-09-10 06:59:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:59:56,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 06:59:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:56,648 INFO L225 Difference]: With dead ends: 31088 [2019-09-10 06:59:56,648 INFO L226 Difference]: Without dead ends: 31088 [2019-09-10 06:59:56,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:59:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31088 states. [2019-09-10 06:59:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31088 to 10067. [2019-09-10 06:59:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2019-09-10 06:59:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13884 transitions. [2019-09-10 06:59:57,659 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13884 transitions. Word has length 72 [2019-09-10 06:59:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:57,660 INFO L475 AbstractCegarLoop]: Abstraction has 10067 states and 13884 transitions. [2019-09-10 06:59:57,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13884 transitions. [2019-09-10 06:59:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:59:57,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:57,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:57,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2102800860, now seen corresponding path program 1 times [2019-09-10 06:59:57,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:57,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:57,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:57,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:57,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:57,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:57,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:57,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:57,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:57,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:57,902 INFO L87 Difference]: Start difference. First operand 10067 states and 13884 transitions. Second operand 9 states. [2019-09-10 07:00:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:02,648 INFO L93 Difference]: Finished difference Result 20008 states and 29024 transitions. [2019-09-10 07:00:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:00:02,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:00:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:02,671 INFO L225 Difference]: With dead ends: 20008 [2019-09-10 07:00:02,671 INFO L226 Difference]: Without dead ends: 20008 [2019-09-10 07:00:02,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:00:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20008 states. [2019-09-10 07:00:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20008 to 10067. [2019-09-10 07:00:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2019-09-10 07:00:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13883 transitions. [2019-09-10 07:00:02,860 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13883 transitions. Word has length 73 [2019-09-10 07:00:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:02,861 INFO L475 AbstractCegarLoop]: Abstraction has 10067 states and 13883 transitions. [2019-09-10 07:00:02,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:00:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13883 transitions. [2019-09-10 07:00:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:00:02,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:02,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:02,871 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:02,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:02,871 INFO L82 PathProgramCache]: Analyzing trace with hash -204470104, now seen corresponding path program 1 times [2019-09-10 07:00:02,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:02,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:02,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:02,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:02,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:03,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:03,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:00:03,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:03,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:00:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:00:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:00:03,626 INFO L87 Difference]: Start difference. First operand 10067 states and 13883 transitions. Second operand 13 states. [2019-09-10 07:00:03,787 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-09-10 07:00:04,204 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-09-10 07:00:04,395 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-09-10 07:00:05,016 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:00:05,336 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:00:05,636 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:00:06,046 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:00:06,300 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:00:06,585 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:00:07,413 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:00:08,199 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:00:09,848 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:00:10,426 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:00:10,797 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:00:11,090 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:00:11,385 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:00:11,734 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 07:00:12,005 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:00:12,263 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 07:00:12,523 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:00:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:12,874 INFO L93 Difference]: Finished difference Result 66990 states and 101918 transitions. [2019-09-10 07:00:12,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 07:00:12,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-10 07:00:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:12,950 INFO L225 Difference]: With dead ends: 66990 [2019-09-10 07:00:12,951 INFO L226 Difference]: Without dead ends: 66990 [2019-09-10 07:00:12,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:00:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66990 states. [2019-09-10 07:00:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66990 to 10077. [2019-09-10 07:00:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10077 states. [2019-09-10 07:00:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 13896 transitions. [2019-09-10 07:00:13,465 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 13896 transitions. Word has length 73 [2019-09-10 07:00:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:13,465 INFO L475 AbstractCegarLoop]: Abstraction has 10077 states and 13896 transitions. [2019-09-10 07:00:13,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:00:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 13896 transitions. [2019-09-10 07:00:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:00:13,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:13,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:13,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1308525850, now seen corresponding path program 1 times [2019-09-10 07:00:13,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:13,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:13,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:13,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:13,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:13,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:13,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:00:13,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:13,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:00:13,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:00:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:13,658 INFO L87 Difference]: Start difference. First operand 10077 states and 13896 transitions. Second operand 9 states. [2019-09-10 07:00:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:18,597 INFO L93 Difference]: Finished difference Result 26345 states and 38783 transitions. [2019-09-10 07:00:18,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:00:18,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-10 07:00:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:18,622 INFO L225 Difference]: With dead ends: 26345 [2019-09-10 07:00:18,622 INFO L226 Difference]: Without dead ends: 26345 [2019-09-10 07:00:18,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:00:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26345 states. [2019-09-10 07:00:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26345 to 10077. [2019-09-10 07:00:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10077 states. [2019-09-10 07:00:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 13895 transitions. [2019-09-10 07:00:18,784 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 13895 transitions. Word has length 74 [2019-09-10 07:00:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:18,784 INFO L475 AbstractCegarLoop]: Abstraction has 10077 states and 13895 transitions. [2019-09-10 07:00:18,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:00:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 13895 transitions. [2019-09-10 07:00:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:00:18,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:18,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:18,793 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1594234650, now seen corresponding path program 1 times [2019-09-10 07:00:18,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:18,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:18,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:19,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:19,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:00:19,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:19,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:00:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:00:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:00:19,424 INFO L87 Difference]: Start difference. First operand 10077 states and 13895 transitions. Second operand 13 states. [2019-09-10 07:00:20,270 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:00:20,498 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:00:20,743 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:00:21,032 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:00:21,259 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:00:23,272 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:00:23,715 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:00:24,295 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:00:24,512 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:00:24,792 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 07:00:25,276 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:00:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:25,718 INFO L93 Difference]: Finished difference Result 61978 states and 94145 transitions. [2019-09-10 07:00:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:00:25,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2019-09-10 07:00:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:25,787 INFO L225 Difference]: With dead ends: 61978 [2019-09-10 07:00:25,787 INFO L226 Difference]: Without dead ends: 61978 [2019-09-10 07:00:25,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:00:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61978 states. [2019-09-10 07:00:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61978 to 10087. [2019-09-10 07:00:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10087 states. [2019-09-10 07:00:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10087 states to 10087 states and 13908 transitions. [2019-09-10 07:00:26,126 INFO L78 Accepts]: Start accepts. Automaton has 10087 states and 13908 transitions. Word has length 74 [2019-09-10 07:00:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:26,126 INFO L475 AbstractCegarLoop]: Abstraction has 10087 states and 13908 transitions. [2019-09-10 07:00:26,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:00:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 10087 states and 13908 transitions. [2019-09-10 07:00:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:00:26,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:26,136 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:26,136 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1506198473, now seen corresponding path program 1 times [2019-09-10 07:00:26,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:26,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:26,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:26,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:26,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:26,218 INFO L87 Difference]: Start difference. First operand 10087 states and 13908 transitions. Second operand 3 states. [2019-09-10 07:00:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:26,381 INFO L93 Difference]: Finished difference Result 10613 states and 15169 transitions. [2019-09-10 07:00:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:26,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:00:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:26,399 INFO L225 Difference]: With dead ends: 10613 [2019-09-10 07:00:26,399 INFO L226 Difference]: Without dead ends: 10613 [2019-09-10 07:00:26,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10613 states. [2019-09-10 07:00:26,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10613 to 10609. [2019-09-10 07:00:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10609 states. [2019-09-10 07:00:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10609 states to 10609 states and 15167 transitions. [2019-09-10 07:00:26,546 INFO L78 Accepts]: Start accepts. Automaton has 10609 states and 15167 transitions. Word has length 74 [2019-09-10 07:00:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:26,547 INFO L475 AbstractCegarLoop]: Abstraction has 10609 states and 15167 transitions. [2019-09-10 07:00:26,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 10609 states and 15167 transitions. [2019-09-10 07:00:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:00:26,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:26,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:26,555 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1708091960, now seen corresponding path program 1 times [2019-09-10 07:00:26,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:26,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:26,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:26,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:26,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:26,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:26,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:26,621 INFO L87 Difference]: Start difference. First operand 10609 states and 15167 transitions. Second operand 3 states. [2019-09-10 07:00:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:26,871 INFO L93 Difference]: Finished difference Result 14037 states and 20545 transitions. [2019-09-10 07:00:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:26,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:00:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:26,891 INFO L225 Difference]: With dead ends: 14037 [2019-09-10 07:00:26,891 INFO L226 Difference]: Without dead ends: 14037 [2019-09-10 07:00:26,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-09-10 07:00:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 14033. [2019-09-10 07:00:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14033 states. [2019-09-10 07:00:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14033 states to 14033 states and 20543 transitions. [2019-09-10 07:00:27,034 INFO L78 Accepts]: Start accepts. Automaton has 14033 states and 20543 transitions. Word has length 74 [2019-09-10 07:00:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,035 INFO L475 AbstractCegarLoop]: Abstraction has 14033 states and 20543 transitions. [2019-09-10 07:00:27,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 14033 states and 20543 transitions. [2019-09-10 07:00:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:00:27,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:27,041 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1609177361, now seen corresponding path program 1 times [2019-09-10 07:00:27,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:27,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:27,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:27,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:27,127 INFO L87 Difference]: Start difference. First operand 14033 states and 20543 transitions. Second operand 3 states. [2019-09-10 07:00:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:27,291 INFO L93 Difference]: Finished difference Result 22442 states and 33434 transitions. [2019-09-10 07:00:27,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:27,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:00:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:27,321 INFO L225 Difference]: With dead ends: 22442 [2019-09-10 07:00:27,322 INFO L226 Difference]: Without dead ends: 22442 [2019-09-10 07:00:27,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22442 states. [2019-09-10 07:00:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22442 to 16428. [2019-09-10 07:00:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16428 states. [2019-09-10 07:00:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16428 states to 16428 states and 24256 transitions. [2019-09-10 07:00:28,228 INFO L78 Accepts]: Start accepts. Automaton has 16428 states and 24256 transitions. Word has length 75 [2019-09-10 07:00:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:28,228 INFO L475 AbstractCegarLoop]: Abstraction has 16428 states and 24256 transitions. [2019-09-10 07:00:28,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 16428 states and 24256 transitions. [2019-09-10 07:00:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:00:28,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:28,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:28,233 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 646929734, now seen corresponding path program 1 times [2019-09-10 07:00:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:28,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:28,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:28,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:28,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:00:28,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:28,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:00:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:00:28,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:00:28,464 INFO L87 Difference]: Start difference. First operand 16428 states and 24256 transitions. Second operand 10 states. [2019-09-10 07:00:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:33,960 INFO L93 Difference]: Finished difference Result 66282 states and 99625 transitions. [2019-09-10 07:00:33,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:00:33,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-10 07:00:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:34,047 INFO L225 Difference]: With dead ends: 66282 [2019-09-10 07:00:34,048 INFO L226 Difference]: Without dead ends: 66282 [2019-09-10 07:00:34,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:00:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66282 states. [2019-09-10 07:00:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66282 to 16428. [2019-09-10 07:00:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16428 states. [2019-09-10 07:00:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16428 states to 16428 states and 24255 transitions. [2019-09-10 07:00:34,609 INFO L78 Accepts]: Start accepts. Automaton has 16428 states and 24255 transitions. Word has length 75 [2019-09-10 07:00:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:34,610 INFO L475 AbstractCegarLoop]: Abstraction has 16428 states and 24255 transitions. [2019-09-10 07:00:34,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:00:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 16428 states and 24255 transitions. [2019-09-10 07:00:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:00:34,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:34,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:34,615 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash 651271719, now seen corresponding path program 1 times [2019-09-10 07:00:34,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:34,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:34,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:34,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:34,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:00:34,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:34,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:00:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:00:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:00:34,825 INFO L87 Difference]: Start difference. First operand 16428 states and 24255 transitions. Second operand 10 states. [2019-09-10 07:00:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:39,333 INFO L93 Difference]: Finished difference Result 40816 states and 61483 transitions. [2019-09-10 07:00:39,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:00:39,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-10 07:00:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:39,372 INFO L225 Difference]: With dead ends: 40816 [2019-09-10 07:00:39,372 INFO L226 Difference]: Without dead ends: 40816 [2019-09-10 07:00:39,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:00:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40816 states. [2019-09-10 07:00:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40816 to 16428. [2019-09-10 07:00:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16428 states. [2019-09-10 07:00:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16428 states to 16428 states and 24254 transitions. [2019-09-10 07:00:39,647 INFO L78 Accepts]: Start accepts. Automaton has 16428 states and 24254 transitions. Word has length 75 [2019-09-10 07:00:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:39,647 INFO L475 AbstractCegarLoop]: Abstraction has 16428 states and 24254 transitions. [2019-09-10 07:00:39,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:00:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16428 states and 24254 transitions. [2019-09-10 07:00:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:00:39,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:39,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:39,652 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2070521782, now seen corresponding path program 1 times [2019-09-10 07:00:39,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:39,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:39,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:39,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:39,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:39,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:39,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:39,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:39,873 INFO L87 Difference]: Start difference. First operand 16428 states and 24254 transitions. Second operand 3 states. [2019-09-10 07:00:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:40,034 INFO L93 Difference]: Finished difference Result 28673 states and 42328 transitions. [2019-09-10 07:00:40,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:40,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:00:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:40,071 INFO L225 Difference]: With dead ends: 28673 [2019-09-10 07:00:40,071 INFO L226 Difference]: Without dead ends: 28673 [2019-09-10 07:00:40,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2019-09-10 07:00:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24429. [2019-09-10 07:00:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24429 states. [2019-09-10 07:00:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24429 states to 24429 states and 35908 transitions. [2019-09-10 07:00:40,322 INFO L78 Accepts]: Start accepts. Automaton has 24429 states and 35908 transitions. Word has length 76 [2019-09-10 07:00:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:40,323 INFO L475 AbstractCegarLoop]: Abstraction has 24429 states and 35908 transitions. [2019-09-10 07:00:40,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 24429 states and 35908 transitions. [2019-09-10 07:00:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:00:40,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:40,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:40,328 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1074481646, now seen corresponding path program 1 times [2019-09-10 07:00:40,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:40,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:40,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:40,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:40,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:40,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:40,408 INFO L87 Difference]: Start difference. First operand 24429 states and 35908 transitions. Second operand 3 states. [2019-09-10 07:00:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:40,657 INFO L93 Difference]: Finished difference Result 41899 states and 61701 transitions. [2019-09-10 07:00:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:40,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:00:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:40,723 INFO L225 Difference]: With dead ends: 41899 [2019-09-10 07:00:40,723 INFO L226 Difference]: Without dead ends: 41899 [2019-09-10 07:00:40,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41899 states. [2019-09-10 07:00:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41899 to 41897. [2019-09-10 07:00:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41897 states. [2019-09-10 07:00:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41897 states to 41897 states and 61700 transitions. [2019-09-10 07:00:41,179 INFO L78 Accepts]: Start accepts. Automaton has 41897 states and 61700 transitions. Word has length 76 [2019-09-10 07:00:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:41,179 INFO L475 AbstractCegarLoop]: Abstraction has 41897 states and 61700 transitions. [2019-09-10 07:00:41,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 41897 states and 61700 transitions. [2019-09-10 07:00:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:00:41,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:41,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:41,183 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1384207412, now seen corresponding path program 1 times [2019-09-10 07:00:41,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:41,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:41,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:41,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:41,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:00:41,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:41,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:00:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:00:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:41,332 INFO L87 Difference]: Start difference. First operand 41897 states and 61700 transitions. Second operand 9 states. [2019-09-10 07:00:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:44,977 INFO L93 Difference]: Finished difference Result 96877 states and 143326 transitions. [2019-09-10 07:00:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:00:44,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-10 07:00:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:45,097 INFO L225 Difference]: With dead ends: 96877 [2019-09-10 07:00:45,097 INFO L226 Difference]: Without dead ends: 96877 [2019-09-10 07:00:45,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:00:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96877 states. [2019-09-10 07:00:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96877 to 41897. [2019-09-10 07:00:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41897 states. [2019-09-10 07:00:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41897 states to 41897 states and 61698 transitions. [2019-09-10 07:00:45,794 INFO L78 Accepts]: Start accepts. Automaton has 41897 states and 61698 transitions. Word has length 77 [2019-09-10 07:00:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 41897 states and 61698 transitions. [2019-09-10 07:00:45,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:00:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 41897 states and 61698 transitions. [2019-09-10 07:00:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:00:45,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:45,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:45,799 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1238767409, now seen corresponding path program 1 times [2019-09-10 07:00:45,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:45,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:45,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:45,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:45,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:45,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:45,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:45,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:45,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:45,857 INFO L87 Difference]: Start difference. First operand 41897 states and 61698 transitions. Second operand 3 states. [2019-09-10 07:00:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:46,085 INFO L93 Difference]: Finished difference Result 71354 states and 105959 transitions. [2019-09-10 07:00:46,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:46,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:00:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:46,162 INFO L225 Difference]: With dead ends: 71354 [2019-09-10 07:00:46,163 INFO L226 Difference]: Without dead ends: 71354 [2019-09-10 07:00:46,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71354 states. [2019-09-10 07:00:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71354 to 55108. [2019-09-10 07:00:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-10 07:00:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81784 transitions. [2019-09-10 07:00:47,011 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81784 transitions. Word has length 77 [2019-09-10 07:00:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:47,011 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81784 transitions. [2019-09-10 07:00:47,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81784 transitions. [2019-09-10 07:00:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:00:47,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:47,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:47,015 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash 145235885, now seen corresponding path program 1 times [2019-09-10 07:00:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:47,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:47,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:47,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:00:47,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:47,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:00:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:00:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:00:47,200 INFO L87 Difference]: Start difference. First operand 55108 states and 81784 transitions. Second operand 10 states. [2019-09-10 07:00:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:52,221 INFO L93 Difference]: Finished difference Result 116050 states and 170771 transitions. [2019-09-10 07:00:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:00:52,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-10 07:00:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:52,360 INFO L225 Difference]: With dead ends: 116050 [2019-09-10 07:00:52,360 INFO L226 Difference]: Without dead ends: 116050 [2019-09-10 07:00:52,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:00:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116050 states. [2019-09-10 07:00:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116050 to 55108. [2019-09-10 07:00:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-10 07:00:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81783 transitions. [2019-09-10 07:00:53,653 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81783 transitions. Word has length 78 [2019-09-10 07:00:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:53,654 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81783 transitions. [2019-09-10 07:00:53,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:00:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81783 transitions. [2019-09-10 07:00:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:00:53,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:53,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:53,657 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 125712707, now seen corresponding path program 1 times [2019-09-10 07:00:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:53,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:53,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:53,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:53,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:00:53,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:53,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:00:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:00:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:53,819 INFO L87 Difference]: Start difference. First operand 55108 states and 81783 transitions. Second operand 9 states. [2019-09-10 07:00:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:57,410 INFO L93 Difference]: Finished difference Result 129196 states and 191828 transitions. [2019-09-10 07:00:57,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:00:57,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:00:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:57,578 INFO L225 Difference]: With dead ends: 129196 [2019-09-10 07:00:57,578 INFO L226 Difference]: Without dead ends: 129196 [2019-09-10 07:00:57,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:00:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129196 states. [2019-09-10 07:01:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129196 to 55108. [2019-09-10 07:01:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-10 07:01:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81782 transitions. [2019-09-10 07:01:00,418 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81782 transitions. Word has length 78 [2019-09-10 07:01:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:00,418 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81782 transitions. [2019-09-10 07:01:00,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81782 transitions. [2019-09-10 07:01:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:01:00,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:00,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:00,421 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1261749334, now seen corresponding path program 1 times [2019-09-10 07:01:00,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:00,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:00,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:00,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:00,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:00,579 INFO L87 Difference]: Start difference. First operand 55108 states and 81782 transitions. Second operand 9 states. [2019-09-10 07:01:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:03,665 INFO L93 Difference]: Finished difference Result 97581 states and 144494 transitions. [2019-09-10 07:01:03,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:01:03,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:01:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:03,780 INFO L225 Difference]: With dead ends: 97581 [2019-09-10 07:01:03,780 INFO L226 Difference]: Without dead ends: 97581 [2019-09-10 07:01:03,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:01:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97581 states. [2019-09-10 07:01:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97581 to 55108. [2019-09-10 07:01:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-10 07:01:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81781 transitions. [2019-09-10 07:01:04,512 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81781 transitions. Word has length 78 [2019-09-10 07:01:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:04,513 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81781 transitions. [2019-09-10 07:01:04,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81781 transitions. [2019-09-10 07:01:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:01:04,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:04,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:04,516 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448037, now seen corresponding path program 1 times [2019-09-10 07:01:04,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:04,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:04,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:04,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:04,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:04,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:04,673 INFO L87 Difference]: Start difference. First operand 55108 states and 81781 transitions. Second operand 9 states. [2019-09-10 07:01:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:08,252 INFO L93 Difference]: Finished difference Result 97581 states and 144492 transitions. [2019-09-10 07:01:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:01:08,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:01:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:08,381 INFO L225 Difference]: With dead ends: 97581 [2019-09-10 07:01:08,382 INFO L226 Difference]: Without dead ends: 97581 [2019-09-10 07:01:08,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:01:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97581 states. [2019-09-10 07:01:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97581 to 55108. [2019-09-10 07:01:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-10 07:01:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81779 transitions. [2019-09-10 07:01:09,196 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81779 transitions. Word has length 78 [2019-09-10 07:01:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:09,197 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81779 transitions. [2019-09-10 07:01:09,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81779 transitions. [2019-09-10 07:01:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:01:09,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:09,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:09,200 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash -54132195, now seen corresponding path program 1 times [2019-09-10 07:01:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:09,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:09,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:09,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:09,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:09,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:09,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:09,348 INFO L87 Difference]: Start difference. First operand 55108 states and 81779 transitions. Second operand 9 states. [2019-09-10 07:01:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:13,240 INFO L93 Difference]: Finished difference Result 129196 states and 191823 transitions. [2019-09-10 07:01:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:01:13,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:01:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:13,426 INFO L225 Difference]: With dead ends: 129196 [2019-09-10 07:01:13,426 INFO L226 Difference]: Without dead ends: 129196 [2019-09-10 07:01:13,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:01:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129196 states. [2019-09-10 07:01:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129196 to 55108. [2019-09-10 07:01:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-10 07:01:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81777 transitions. [2019-09-10 07:01:14,413 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81777 transitions. Word has length 78 [2019-09-10 07:01:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:14,414 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81777 transitions. [2019-09-10 07:01:14,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81777 transitions. [2019-09-10 07:01:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:01:14,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:14,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:14,417 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1470820597, now seen corresponding path program 1 times [2019-09-10 07:01:14,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:14,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:14,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:14,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:14,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:14,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:14,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:14,485 INFO L87 Difference]: Start difference. First operand 55108 states and 81777 transitions. Second operand 3 states. [2019-09-10 07:01:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:14,757 INFO L93 Difference]: Finished difference Result 100250 states and 147353 transitions. [2019-09-10 07:01:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:14,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:01:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:14,871 INFO L225 Difference]: With dead ends: 100250 [2019-09-10 07:01:14,872 INFO L226 Difference]: Without dead ends: 100250 [2019-09-10 07:01:14,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100250 states. [2019-09-10 07:01:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100250 to 69224. [2019-09-10 07:01:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69224 states. [2019-09-10 07:01:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69224 states to 69224 states and 101691 transitions. [2019-09-10 07:01:15,710 INFO L78 Accepts]: Start accepts. Automaton has 69224 states and 101691 transitions. Word has length 78 [2019-09-10 07:01:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:15,711 INFO L475 AbstractCegarLoop]: Abstraction has 69224 states and 101691 transitions. [2019-09-10 07:01:15,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 69224 states and 101691 transitions. [2019-09-10 07:01:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:01:15,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:15,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:15,715 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash 176888478, now seen corresponding path program 1 times [2019-09-10 07:01:15,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:15,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:15,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:16,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:16,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:16,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:16,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:16,172 INFO L87 Difference]: Start difference. First operand 69224 states and 101691 transitions. Second operand 9 states. [2019-09-10 07:01:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:19,480 INFO L93 Difference]: Finished difference Result 160774 states and 236073 transitions. [2019-09-10 07:01:19,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:01:19,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 07:01:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:19,661 INFO L225 Difference]: With dead ends: 160774 [2019-09-10 07:01:19,661 INFO L226 Difference]: Without dead ends: 160774 [2019-09-10 07:01:19,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:01:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160774 states. [2019-09-10 07:01:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160774 to 69219. [2019-09-10 07:01:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69219 states. [2019-09-10 07:01:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69219 states to 69219 states and 101682 transitions. [2019-09-10 07:01:20,846 INFO L78 Accepts]: Start accepts. Automaton has 69219 states and 101682 transitions. Word has length 78 [2019-09-10 07:01:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:20,846 INFO L475 AbstractCegarLoop]: Abstraction has 69219 states and 101682 transitions. [2019-09-10 07:01:20,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:01:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69219 states and 101682 transitions. [2019-09-10 07:01:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:01:20,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:20,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:20,850 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1389547110, now seen corresponding path program 1 times [2019-09-10 07:01:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:20,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:20,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:22,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:22,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:01:22,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:22,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:01:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:01:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:01:22,336 INFO L87 Difference]: Start difference. First operand 69219 states and 101682 transitions. Second operand 22 states. [2019-09-10 07:01:22,989 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-09-10 07:01:23,134 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:01:23,582 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 07:01:23,878 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:01:24,176 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:01:24,591 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:01:25,174 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-10 07:01:25,533 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:01:26,285 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 07:01:26,737 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:01:27,448 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:01:27,819 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:01:28,246 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:01:28,818 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 07:01:29,313 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:01:30,162 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 07:01:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:35,073 INFO L93 Difference]: Finished difference Result 134377 states and 197776 transitions. [2019-09-10 07:01:35,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:01:35,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2019-09-10 07:01:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:35,236 INFO L225 Difference]: With dead ends: 134377 [2019-09-10 07:01:35,236 INFO L226 Difference]: Without dead ends: 134377 [2019-09-10 07:01:35,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=398, Invalid=1324, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:01:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134377 states. [2019-09-10 07:01:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134377 to 69211. [2019-09-10 07:01:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69211 states. [2019-09-10 07:01:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69211 states to 69211 states and 101668 transitions. [2019-09-10 07:01:38,386 INFO L78 Accepts]: Start accepts. Automaton has 69211 states and 101668 transitions. Word has length 80 [2019-09-10 07:01:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:38,387 INFO L475 AbstractCegarLoop]: Abstraction has 69211 states and 101668 transitions. [2019-09-10 07:01:38,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:01:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 69211 states and 101668 transitions. [2019-09-10 07:01:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:01:38,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:38,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:38,391 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash -967908922, now seen corresponding path program 1 times [2019-09-10 07:01:38,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:38,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:38,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:38,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:38,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:01:38,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:38,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:01:38,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:01:38,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:38,489 INFO L87 Difference]: Start difference. First operand 69211 states and 101668 transitions. Second operand 7 states. [2019-09-10 07:01:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:39,620 INFO L93 Difference]: Finished difference Result 316108 states and 453464 transitions. [2019-09-10 07:01:39,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:01:39,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-09-10 07:01:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:40,097 INFO L225 Difference]: With dead ends: 316108 [2019-09-10 07:01:40,097 INFO L226 Difference]: Without dead ends: 316108 [2019-09-10 07:01:40,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:01:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316108 states. [2019-09-10 07:01:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316108 to 243700. [2019-09-10 07:01:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243700 states. [2019-09-10 07:01:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243700 states to 243700 states and 350366 transitions. [2019-09-10 07:01:43,684 INFO L78 Accepts]: Start accepts. Automaton has 243700 states and 350366 transitions. Word has length 80 [2019-09-10 07:01:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:43,684 INFO L475 AbstractCegarLoop]: Abstraction has 243700 states and 350366 transitions. [2019-09-10 07:01:43,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:01:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 243700 states and 350366 transitions. [2019-09-10 07:01:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:01:43,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:43,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:43,689 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1076301669, now seen corresponding path program 1 times [2019-09-10 07:01:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:43,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:43,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:43,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:44,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:01:44,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:44,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:01:44,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:01:44,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:01:44,967 INFO L87 Difference]: Start difference. First operand 243700 states and 350366 transitions. Second operand 21 states. [2019-09-10 07:01:45,693 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:01:45,909 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:01:46,205 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:01:46,667 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:01:47,009 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:01:47,516 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 07:01:47,897 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-10 07:01:48,413 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-10 07:01:48,723 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:01:49,146 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 07:01:49,465 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:01:50,833 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 07:01:51,459 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:01:52,419 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 07:01:55,752 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:01:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:59,752 INFO L93 Difference]: Finished difference Result 300096 states and 429859 transitions. [2019-09-10 07:01:59,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:01:59,752 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-09-10 07:01:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:00,238 INFO L225 Difference]: With dead ends: 300096 [2019-09-10 07:02:00,239 INFO L226 Difference]: Without dead ends: 300096 [2019-09-10 07:02:00,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=411, Invalid=1845, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:02:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300096 states. [2019-09-10 07:02:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300096 to 243699. [2019-09-10 07:02:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243699 states. [2019-09-10 07:02:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243699 states to 243699 states and 350364 transitions. [2019-09-10 07:02:03,859 INFO L78 Accepts]: Start accepts. Automaton has 243699 states and 350364 transitions. Word has length 81 [2019-09-10 07:02:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:03,859 INFO L475 AbstractCegarLoop]: Abstraction has 243699 states and 350364 transitions. [2019-09-10 07:02:03,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:02:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 243699 states and 350364 transitions. [2019-09-10 07:02:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:02:03,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:03,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:03,865 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash -54118251, now seen corresponding path program 1 times [2019-09-10 07:02:03,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:03,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:04,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:04,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:02:04,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:04,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:02:04,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:02:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:02:04,775 INFO L87 Difference]: Start difference. First operand 243699 states and 350364 transitions. Second operand 18 states. [2019-09-10 07:02:05,506 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:02:05,742 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:02:06,061 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:02:06,357 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:02:06,909 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:02:07,659 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:02:08,246 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:02:08,531 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:02:08,805 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:02:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:15,428 INFO L93 Difference]: Finished difference Result 328279 states and 470454 transitions. [2019-09-10 07:02:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:02:15,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-09-10 07:02:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:15,884 INFO L225 Difference]: With dead ends: 328279 [2019-09-10 07:02:15,884 INFO L226 Difference]: Without dead ends: 328279 [2019-09-10 07:02:15,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=293, Invalid=1039, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:02:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328279 states. [2019-09-10 07:02:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328279 to 243670. [2019-09-10 07:02:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243670 states. [2019-09-10 07:02:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243670 states to 243670 states and 350328 transitions. [2019-09-10 07:02:19,460 INFO L78 Accepts]: Start accepts. Automaton has 243670 states and 350328 transitions. Word has length 81 [2019-09-10 07:02:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:19,460 INFO L475 AbstractCegarLoop]: Abstraction has 243670 states and 350328 transitions. [2019-09-10 07:02:19,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:02:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 243670 states and 350328 transitions. [2019-09-10 07:02:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:02:19,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:19,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:19,466 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:19,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash -227440160, now seen corresponding path program 1 times [2019-09-10 07:02:19,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:19,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:19,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:20,097 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:02:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:20,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:20,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:02:20,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:20,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:02:20,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:02:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:02:20,699 INFO L87 Difference]: Start difference. First operand 243670 states and 350328 transitions. Second operand 21 states. [2019-09-10 07:02:21,395 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:02:21,615 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:02:22,273 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:02:22,523 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 07:02:22,751 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:02:23,110 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:02:23,390 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 07:02:23,969 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2019-09-10 07:02:24,148 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:02:24,420 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:02:24,641 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:02:25,565 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:02:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:35,465 INFO L93 Difference]: Finished difference Result 359852 states and 515132 transitions. [2019-09-10 07:02:35,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:02:35,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-09-10 07:02:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:35,971 INFO L225 Difference]: With dead ends: 359852 [2019-09-10 07:02:35,971 INFO L226 Difference]: Without dead ends: 359852 [2019-09-10 07:02:35,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:02:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359852 states. [2019-09-10 07:02:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359852 to 243641. [2019-09-10 07:02:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243641 states. [2019-09-10 07:02:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243641 states to 243641 states and 350292 transitions. [2019-09-10 07:02:39,867 INFO L78 Accepts]: Start accepts. Automaton has 243641 states and 350292 transitions. Word has length 81 [2019-09-10 07:02:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:39,867 INFO L475 AbstractCegarLoop]: Abstraction has 243641 states and 350292 transitions. [2019-09-10 07:02:39,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:02:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 243641 states and 350292 transitions. [2019-09-10 07:02:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:02:43,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:43,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:43,377 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1469890646, now seen corresponding path program 1 times [2019-09-10 07:02:43,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:43,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:44,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:44,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:02:44,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:44,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:02:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:02:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:02:44,137 INFO L87 Difference]: Start difference. First operand 243641 states and 350292 transitions. Second operand 16 states. [2019-09-10 07:02:45,245 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:02:45,486 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:02:45,631 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 07:02:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:49,129 INFO L93 Difference]: Finished difference Result 491032 states and 706493 transitions. [2019-09-10 07:02:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:02:49,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-10 07:02:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:49,778 INFO L225 Difference]: With dead ends: 491032 [2019-09-10 07:02:49,778 INFO L226 Difference]: Without dead ends: 491026 [2019-09-10 07:02:49,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:02:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491026 states. [2019-09-10 07:02:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491026 to 243619. [2019-09-10 07:02:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243619 states. [2019-09-10 07:02:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243619 states to 243619 states and 350262 transitions. [2019-09-10 07:02:58,926 INFO L78 Accepts]: Start accepts. Automaton has 243619 states and 350262 transitions. Word has length 81 [2019-09-10 07:02:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:58,926 INFO L475 AbstractCegarLoop]: Abstraction has 243619 states and 350262 transitions. [2019-09-10 07:02:58,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:02:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 243619 states and 350262 transitions. [2019-09-10 07:02:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:02:58,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:58,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:58,931 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash -690329320, now seen corresponding path program 1 times [2019-09-10 07:02:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:58,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:58,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:02:59,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:59,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:02:59,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:02:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:02:59,552 INFO L87 Difference]: Start difference. First operand 243619 states and 350262 transitions. Second operand 12 states. [2019-09-10 07:03:00,311 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:03:00,542 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:03:00,775 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:03:01,024 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:03:01,297 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:03:01,764 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:03:02,023 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:03:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:05,053 INFO L93 Difference]: Finished difference Result 692866 states and 994311 transitions. [2019-09-10 07:03:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:03:05,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-09-10 07:03:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:06,215 INFO L225 Difference]: With dead ends: 692866 [2019-09-10 07:03:06,216 INFO L226 Difference]: Without dead ends: 692866 [2019-09-10 07:03:06,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:03:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692866 states. [2019-09-10 07:03:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692866 to 243511. [2019-09-10 07:03:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243511 states. [2019-09-10 07:03:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243511 states to 243511 states and 350135 transitions. [2019-09-10 07:03:19,304 INFO L78 Accepts]: Start accepts. Automaton has 243511 states and 350135 transitions. Word has length 81 [2019-09-10 07:03:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:19,304 INFO L475 AbstractCegarLoop]: Abstraction has 243511 states and 350135 transitions. [2019-09-10 07:03:19,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:03:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 243511 states and 350135 transitions. [2019-09-10 07:03:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:03:19,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:19,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:19,310 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash -369367105, now seen corresponding path program 1 times [2019-09-10 07:03:19,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:19,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:19,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:19,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:19,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:19,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:19,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:19,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:19,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:19,447 INFO L87 Difference]: Start difference. First operand 243511 states and 350135 transitions. Second operand 6 states. [2019-09-10 07:03:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:20,337 INFO L93 Difference]: Finished difference Result 156518 states and 219796 transitions. [2019-09-10 07:03:20,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:03:20,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-10 07:03:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:20,520 INFO L225 Difference]: With dead ends: 156518 [2019-09-10 07:03:20,520 INFO L226 Difference]: Without dead ends: 156518 [2019-09-10 07:03:20,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156518 states. [2019-09-10 07:03:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156518 to 109742. [2019-09-10 07:03:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109742 states. [2019-09-10 07:03:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109742 states to 109742 states and 154895 transitions. [2019-09-10 07:03:23,227 INFO L78 Accepts]: Start accepts. Automaton has 109742 states and 154895 transitions. Word has length 81 [2019-09-10 07:03:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:23,228 INFO L475 AbstractCegarLoop]: Abstraction has 109742 states and 154895 transitions. [2019-09-10 07:03:23,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109742 states and 154895 transitions. [2019-09-10 07:03:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:03:23,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:23,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:23,233 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash -584700421, now seen corresponding path program 1 times [2019-09-10 07:03:23,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:23,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:23,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:23,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:23,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:03:23,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:23,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:03:23,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:03:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:03:23,699 INFO L87 Difference]: Start difference. First operand 109742 states and 154895 transitions. Second operand 12 states. [2019-09-10 07:03:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:26,068 INFO L93 Difference]: Finished difference Result 196122 states and 276347 transitions. [2019-09-10 07:03:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:03:26,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-10 07:03:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:26,326 INFO L225 Difference]: With dead ends: 196122 [2019-09-10 07:03:26,326 INFO L226 Difference]: Without dead ends: 196122 [2019-09-10 07:03:26,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:03:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196122 states. [2019-09-10 07:03:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196122 to 109741. [2019-09-10 07:03:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109741 states. [2019-09-10 07:03:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109741 states to 109741 states and 154893 transitions. [2019-09-10 07:03:30,812 INFO L78 Accepts]: Start accepts. Automaton has 109741 states and 154893 transitions. Word has length 82 [2019-09-10 07:03:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:30,812 INFO L475 AbstractCegarLoop]: Abstraction has 109741 states and 154893 transitions. [2019-09-10 07:03:30,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:03:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 109741 states and 154893 transitions. [2019-09-10 07:03:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:03:30,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:30,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:30,816 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1810804093, now seen corresponding path program 1 times [2019-09-10 07:03:30,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:30,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:31,419 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-09-10 07:03:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:32,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:32,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:03:32,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:32,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:03:32,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:03:32,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:03:32,081 INFO L87 Difference]: Start difference. First operand 109741 states and 154893 transitions. Second operand 18 states. [2019-09-10 07:03:32,876 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 07:03:33,068 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:03:33,254 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:03:33,528 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 07:03:33,888 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:03:35,644 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:03:36,280 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:03:36,924 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:03:37,903 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 07:03:39,213 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:03:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:41,582 INFO L93 Difference]: Finished difference Result 252740 states and 355552 transitions. [2019-09-10 07:03:41,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:03:41,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2019-09-10 07:03:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:41,913 INFO L225 Difference]: With dead ends: 252740 [2019-09-10 07:03:41,913 INFO L226 Difference]: Without dead ends: 252740 [2019-09-10 07:03:41,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=376, Invalid=1516, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:03:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252740 states. [2019-09-10 07:03:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252740 to 109725. [2019-09-10 07:03:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109725 states. [2019-09-10 07:03:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109725 states to 109725 states and 154873 transitions. [2019-09-10 07:03:44,208 INFO L78 Accepts]: Start accepts. Automaton has 109725 states and 154873 transitions. Word has length 82 [2019-09-10 07:03:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:44,209 INFO L475 AbstractCegarLoop]: Abstraction has 109725 states and 154873 transitions. [2019-09-10 07:03:44,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:03:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 109725 states and 154873 transitions. [2019-09-10 07:03:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:03:44,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:44,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:44,214 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1121104637, now seen corresponding path program 1 times [2019-09-10 07:03:44,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:44,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:44,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:44,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:44,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:44,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:44,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:44,305 INFO L87 Difference]: Start difference. First operand 109725 states and 154873 transitions. Second operand 6 states. [2019-09-10 07:03:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:45,423 INFO L93 Difference]: Finished difference Result 193825 states and 269223 transitions. [2019-09-10 07:03:45,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:03:45,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-10 07:03:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:45,740 INFO L225 Difference]: With dead ends: 193825 [2019-09-10 07:03:45,740 INFO L226 Difference]: Without dead ends: 193825 [2019-09-10 07:03:45,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193825 states. [2019-09-10 07:03:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193825 to 112713. [2019-09-10 07:03:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112713 states. [2019-09-10 07:03:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112713 states to 112713 states and 157210 transitions. [2019-09-10 07:03:48,241 INFO L78 Accepts]: Start accepts. Automaton has 112713 states and 157210 transitions. Word has length 82 [2019-09-10 07:03:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:48,242 INFO L475 AbstractCegarLoop]: Abstraction has 112713 states and 157210 transitions. [2019-09-10 07:03:48,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 112713 states and 157210 transitions. [2019-09-10 07:03:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:03:48,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:48,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:48,250 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash 401445696, now seen corresponding path program 1 times [2019-09-10 07:03:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:48,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:48,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:48,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:48,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:48,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:48,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:48,315 INFO L87 Difference]: Start difference. First operand 112713 states and 157210 transitions. Second operand 3 states. [2019-09-10 07:03:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:48,850 INFO L93 Difference]: Finished difference Result 201933 states and 278083 transitions. [2019-09-10 07:03:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:48,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:03:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:49,092 INFO L225 Difference]: With dead ends: 201933 [2019-09-10 07:03:49,092 INFO L226 Difference]: Without dead ends: 201933 [2019-09-10 07:03:49,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201933 states. [2019-09-10 07:03:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201933 to 199801. [2019-09-10 07:03:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199801 states. [2019-09-10 07:03:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199801 states to 199801 states and 275952 transitions. [2019-09-10 07:03:51,972 INFO L78 Accepts]: Start accepts. Automaton has 199801 states and 275952 transitions. Word has length 83 [2019-09-10 07:03:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:51,972 INFO L475 AbstractCegarLoop]: Abstraction has 199801 states and 275952 transitions. [2019-09-10 07:03:51,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 199801 states and 275952 transitions. [2019-09-10 07:03:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:03:51,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:51,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:51,979 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash -55569574, now seen corresponding path program 1 times [2019-09-10 07:03:51,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:51,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:51,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:52,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:03:52,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:52,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:03:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:03:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:03:52,051 INFO L87 Difference]: Start difference. First operand 199801 states and 275952 transitions. Second operand 5 states. [2019-09-10 07:03:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:57,091 INFO L93 Difference]: Finished difference Result 575427 states and 785806 transitions. [2019-09-10 07:03:57,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:03:57,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:03:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:57,996 INFO L225 Difference]: With dead ends: 575427 [2019-09-10 07:03:57,996 INFO L226 Difference]: Without dead ends: 575427 [2019-09-10 07:03:57,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575427 states. [2019-09-10 07:04:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575427 to 354172. [2019-09-10 07:04:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354172 states. [2019-09-10 07:04:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354172 states to 354172 states and 485780 transitions. [2019-09-10 07:04:07,639 INFO L78 Accepts]: Start accepts. Automaton has 354172 states and 485780 transitions. Word has length 84 [2019-09-10 07:04:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:07,639 INFO L475 AbstractCegarLoop]: Abstraction has 354172 states and 485780 transitions. [2019-09-10 07:04:07,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:04:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 354172 states and 485780 transitions. [2019-09-10 07:04:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:04:07,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:07,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:07,649 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2020047279, now seen corresponding path program 1 times [2019-09-10 07:04:07,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:07,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:07,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:07,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:04:07,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:07,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:04:07,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:04:07,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:04:07,726 INFO L87 Difference]: Start difference. First operand 354172 states and 485780 transitions. Second operand 5 states. [2019-09-10 07:04:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:11,539 INFO L93 Difference]: Finished difference Result 619551 states and 839969 transitions. [2019-09-10 07:04:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:04:11,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 07:04:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:12,536 INFO L225 Difference]: With dead ends: 619551 [2019-09-10 07:04:12,537 INFO L226 Difference]: Without dead ends: 619551 [2019-09-10 07:04:12,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:04:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619551 states. [2019-09-10 07:04:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619551 to 417047. [2019-09-10 07:04:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417047 states. [2019-09-10 07:04:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417047 states to 417047 states and 565968 transitions. [2019-09-10 07:04:27,688 INFO L78 Accepts]: Start accepts. Automaton has 417047 states and 565968 transitions. Word has length 88 [2019-09-10 07:04:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:27,689 INFO L475 AbstractCegarLoop]: Abstraction has 417047 states and 565968 transitions. [2019-09-10 07:04:27,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:04:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 417047 states and 565968 transitions. [2019-09-10 07:04:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:04:27,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:27,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:27,698 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 927073752, now seen corresponding path program 1 times [2019-09-10 07:04:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:27,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:27,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:04:27,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:04:27,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:27,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:04:27,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:04:27,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:04:27,766 INFO L87 Difference]: Start difference. First operand 417047 states and 565968 transitions. Second operand 5 states. [2019-09-10 07:04:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:33,496 INFO L93 Difference]: Finished difference Result 1014033 states and 1354529 transitions. [2019-09-10 07:04:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:04:33,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 07:04:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:35,421 INFO L225 Difference]: With dead ends: 1014033 [2019-09-10 07:04:35,422 INFO L226 Difference]: Without dead ends: 1014033 [2019-09-10 07:04:35,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:04:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014033 states. [2019-09-10 07:04:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014033 to 697494. [2019-09-10 07:04:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697494 states. [2019-09-10 07:05:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697494 states to 697494 states and 941068 transitions. [2019-09-10 07:05:08,527 INFO L78 Accepts]: Start accepts. Automaton has 697494 states and 941068 transitions. Word has length 88 [2019-09-10 07:05:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:08,528 INFO L475 AbstractCegarLoop]: Abstraction has 697494 states and 941068 transitions. [2019-09-10 07:05:08,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:05:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 697494 states and 941068 transitions. [2019-09-10 07:05:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:05:08,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:08,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:08,538 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -953547309, now seen corresponding path program 1 times [2019-09-10 07:05:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:08,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:08,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:08,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:08,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:05:08,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:08,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:05:08,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:05:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:05:08,596 INFO L87 Difference]: Start difference. First operand 697494 states and 941068 transitions. Second operand 5 states. [2019-09-10 07:05:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:12,800 INFO L93 Difference]: Finished difference Result 891606 states and 1207080 transitions. [2019-09-10 07:05:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:05:12,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 07:05:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:14,199 INFO L225 Difference]: With dead ends: 891606 [2019-09-10 07:05:14,199 INFO L226 Difference]: Without dead ends: 891606 [2019-09-10 07:05:14,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891606 states. [2019-09-10 07:05:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891606 to 688882. [2019-09-10 07:05:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688882 states. [2019-09-10 07:05:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688882 states to 688882 states and 929772 transitions. [2019-09-10 07:05:35,563 INFO L78 Accepts]: Start accepts. Automaton has 688882 states and 929772 transitions. Word has length 90 [2019-09-10 07:05:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:35,563 INFO L475 AbstractCegarLoop]: Abstraction has 688882 states and 929772 transitions. [2019-09-10 07:05:35,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:05:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 688882 states and 929772 transitions. [2019-09-10 07:05:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:05:35,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:35,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:35,575 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:35,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1116583624, now seen corresponding path program 1 times [2019-09-10 07:05:35,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:35,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:35,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:35,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:35,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:05:35,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:35,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:05:35,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:05:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:35,716 INFO L87 Difference]: Start difference. First operand 688882 states and 929772 transitions. Second operand 7 states. [2019-09-10 07:05:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:48,195 INFO L93 Difference]: Finished difference Result 1036108 states and 1397767 transitions. [2019-09-10 07:05:48,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:05:48,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-10 07:05:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:49,756 INFO L225 Difference]: With dead ends: 1036108 [2019-09-10 07:05:49,756 INFO L226 Difference]: Without dead ends: 1036108 [2019-09-10 07:05:49,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:05:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036108 states. [2019-09-10 07:06:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036108 to 1016782. [2019-09-10 07:06:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016782 states. [2019-09-10 07:06:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016782 states to 1016782 states and 1371908 transitions. [2019-09-10 07:06:23,417 INFO L78 Accepts]: Start accepts. Automaton has 1016782 states and 1371908 transitions. Word has length 94 [2019-09-10 07:06:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:23,417 INFO L475 AbstractCegarLoop]: Abstraction has 1016782 states and 1371908 transitions. [2019-09-10 07:06:23,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1016782 states and 1371908 transitions. [2019-09-10 07:06:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:06:23,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:23,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:23,430 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:23,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1975090032, now seen corresponding path program 1 times [2019-09-10 07:06:23,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:23,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:23,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:23,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:23,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:23,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:23,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:23,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:23,494 INFO L87 Difference]: Start difference. First operand 1016782 states and 1371908 transitions. Second operand 3 states. [2019-09-10 07:06:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:28,221 INFO L93 Difference]: Finished difference Result 1101806 states and 1460744 transitions. [2019-09-10 07:06:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:28,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:06:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:40,901 INFO L225 Difference]: With dead ends: 1101806 [2019-09-10 07:06:40,901 INFO L226 Difference]: Without dead ends: 1101806 [2019-09-10 07:06:40,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101806 states. [2019-09-10 07:06:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101806 to 863617. [2019-09-10 07:06:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863617 states. [2019-09-10 07:06:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863617 states to 863617 states and 1148626 transitions. [2019-09-10 07:06:56,490 INFO L78 Accepts]: Start accepts. Automaton has 863617 states and 1148626 transitions. Word has length 95 [2019-09-10 07:06:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:56,491 INFO L475 AbstractCegarLoop]: Abstraction has 863617 states and 1148626 transitions. [2019-09-10 07:06:56,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 863617 states and 1148626 transitions. [2019-09-10 07:06:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:06:56,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:56,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:56,501 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2112768597, now seen corresponding path program 1 times [2019-09-10 07:06:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:56,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:56,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:56,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:56,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:56,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:56,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:56,567 INFO L87 Difference]: Start difference. First operand 863617 states and 1148626 transitions. Second operand 3 states. [2019-09-10 07:07:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:09,612 INFO L93 Difference]: Finished difference Result 1162605 states and 1519779 transitions. [2019-09-10 07:07:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:09,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:07:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:12,492 INFO L225 Difference]: With dead ends: 1162605 [2019-09-10 07:07:12,492 INFO L226 Difference]: Without dead ends: 1162605 [2019-09-10 07:07:12,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162605 states. [2019-09-10 07:07:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162605 to 900848. [2019-09-10 07:07:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900848 states. [2019-09-10 07:07:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900848 states to 900848 states and 1183265 transitions. [2019-09-10 07:07:41,415 INFO L78 Accepts]: Start accepts. Automaton has 900848 states and 1183265 transitions. Word has length 98 [2019-09-10 07:07:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:41,415 INFO L475 AbstractCegarLoop]: Abstraction has 900848 states and 1183265 transitions. [2019-09-10 07:07:41,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 900848 states and 1183265 transitions. [2019-09-10 07:07:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:07:41,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:41,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:41,424 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash 366658281, now seen corresponding path program 1 times [2019-09-10 07:07:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:41,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:41,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:41,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:41,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:41,574 INFO L87 Difference]: Start difference. First operand 900848 states and 1183265 transitions. Second operand 7 states. [2019-09-10 07:07:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:48,942 INFO L93 Difference]: Finished difference Result 1274250 states and 1671478 transitions. [2019-09-10 07:07:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:07:48,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-09-10 07:07:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:51,125 INFO L225 Difference]: With dead ends: 1274250 [2019-09-10 07:07:51,126 INFO L226 Difference]: Without dead ends: 1274250 [2019-09-10 07:07:51,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:08:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274250 states. [2019-09-10 07:08:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274250 to 1268676. [2019-09-10 07:08:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268676 states. [2019-09-10 07:08:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268676 states to 1268676 states and 1664051 transitions. [2019-09-10 07:08:40,620 INFO L78 Accepts]: Start accepts. Automaton has 1268676 states and 1664051 transitions. Word has length 101 [2019-09-10 07:08:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:40,621 INFO L475 AbstractCegarLoop]: Abstraction has 1268676 states and 1664051 transitions. [2019-09-10 07:08:40,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1268676 states and 1664051 transitions. [2019-09-10 07:08:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:08:40,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:40,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:40,630 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 752567499, now seen corresponding path program 1 times [2019-09-10 07:08:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:40,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:40,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:40,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:08:40,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:40,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:08:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:08:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:08:40,706 INFO L87 Difference]: Start difference. First operand 1268676 states and 1664051 transitions. Second operand 5 states. [2019-09-10 07:09:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:09,159 INFO L93 Difference]: Finished difference Result 2376615 states and 3068166 transitions. [2019-09-10 07:09:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:09:09,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:09:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:12,823 INFO L225 Difference]: With dead ends: 2376615 [2019-09-10 07:09:12,824 INFO L226 Difference]: Without dead ends: 2376615 [2019-09-10 07:09:12,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376615 states.